IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v224y2013i3p466-476.html
   My bibliography  Save this article

The rollon–rolloff waste collection vehicle routing problem with time windows

Author

Listed:
  • Wy, Juyoung
  • Kim, Byung-In
  • Kim, Seongbae

Abstract

This study introduces a rollon–rolloff waste collection vehicle routing problem involving large containers that accumulate huge amounts of garbage at construction sites and shopping districts. In this problem, tractors move one container at a time between customer locations, a depot, disposal facilities, and container storage yards. The complicated constraints discussed in this study arise from having multiple disposal facilities, multiple container storage yards, seven service types of customer demands, different time windows for customer demands and facilities, various types and sizes of containers, and the lunch break of tractor drivers. In addition, real-world issues, such as changing service types, multiple demands at a customer’s location, and tractors with different work schedules, are dealt with. This study proposes a large neighborhood search based iterative heuristic approach consisting of several algorithms for the problem. The effectiveness of the proposed methods is demonstrated by computational experiments using benchmark data, some instances of which are derived from real-world problems.

Suggested Citation

  • Wy, Juyoung & Kim, Byung-In & Kim, Seongbae, 2013. "The rollon–rolloff waste collection vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 224(3), pages 466-476.
  • Handle: RePEc:eee:ejores:v:224:y:2013:i:3:p:466-476 DOI: 10.1016/j.ejor.2012.09.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712006649
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kulcar, Thierry, 1996. "Optimizing solid waste collection in Brussels," European Journal of Operational Research, Elsevier, vol. 90(1), pages 71-77, April.
    2. Tung, Dang Vu & Pinnoi, Anulark, 2000. "Vehicle routing-scheduling for waste collection in Hanoi," European Journal of Operational Research, Elsevier, vol. 125(3), pages 449-468, September.
    3. Donald D. Eisenstein & Ananth. V. Iyer, 1997. "Garbage Collection in Chicago: A Dynamic Scheduling Model," Management Science, INFORMS, vol. 43(7), pages 922-933, July.
    4. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, pages 159-175.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Hongqi & Chang, Xinyu & Zhao, Wencong & Lu, Yingrong, 2017. "The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 859-869.
    2. Neves-Moreira, F. & Amorim, P. & Guimarães, L. & Almada-Lobo, B., 2016. "A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations," European Journal of Operational Research, Elsevier, vol. 248(2), pages 487-506.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:224:y:2013:i:3:p:466-476. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.