IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i3p501-d1333931.html
   My bibliography  Save this article

Using Simulated Annealing to Solve the Multi-Depot Waste Collection Vehicle Routing Problem with Time Window and Self-Delivery Option

Author

Listed:
  • Vincent F. Yu

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
    Department of Civil and Environmental Engineering, Portland State University, Portland, OR 97201, USA)

  • Panca Jodiawan

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan)

  • Shih-Wei Lin

    (Department of Information Management, Chang Gung University, Taoyuan 33302, Taiwan
    Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei 243303, Taiwan
    Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung 20401, Taiwan)

  • Winy Fara Nadira

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
    Department of Mechanical and Industrial Engineering, Universitas Gadjah Mada, Yogyakarta 55281, Indonesia)

  • Anna Maria Sri Asih

    (Department of Mechanical and Industrial Engineering, Universitas Gadjah Mada, Yogyakarta 55281, Indonesia)

  • Le Nguyen Hoang Vinh

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan)

Abstract

This research introduces the Multi-Depot Waste Collection Vehicle Routing Problem with Time Windows and Self-Delivery Option (MDWCVRPTW-SDO). The problem comes from the waste bank operation implemented in Yogyakarta City, Indonesia. A set of vehicles is dispatched from the waste banks to pick up waste from residents’ locations within the time windows specified by the residents. Residents may be compensated for delivering their waste to a waste bank by themselves. The objective of MDWCVRPTW-SDO is minimizing the sum of investment costs, routing costs, and total compensation paid to the residents. We model this problem as a mixed integer linear programming model and propose Simulated Annealing (SA) as an effective solution approach. Extensive computational experiments confirm that SA is effective to solve MDWCVRPTW-SDO. Moreover, the number of waste banks, compensation paid to residents, and the distribution of residents of each type are crucial for the success of the implementation.

Suggested Citation

  • Vincent F. Yu & Panca Jodiawan & Shih-Wei Lin & Winy Fara Nadira & Anna Maria Sri Asih & Le Nguyen Hoang Vinh, 2024. "Using Simulated Annealing to Solve the Multi-Depot Waste Collection Vehicle Routing Problem with Time Window and Self-Delivery Option," Mathematics, MDPI, vol. 12(3), pages 1-22, February.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:501-:d:1333931
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/3/501/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/3/501/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hailin Wu & Fengming Tao & Bo Yang, 2020. "Optimization of Vehicle Routing for Waste Collection and Transportation," IJERPH, MDPI, vol. 17(14), pages 1-26, July.
    2. Surya Sahoo & Seongbae Kim & Byung-In Kim & Bob Kraas & Alexander Popov, 2005. "Routing Optimization for Waste Management," Interfaces, INFORMS, vol. 35(1), pages 24-36, February.
    3. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    4. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    5. Jeroen Beliën & Liesje De Boeck & Jonas Van Ackere, 2014. "Municipal Solid Waste Collection and Management Problems: A Literature Review," Transportation Science, INFORMS, vol. 48(1), pages 78-102, February.
    6. T R P Ramos & R C Oliveira, 2011. "Delimitation of service areas in reverse logistics networks with multiple depots," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1198-1210, July.
    7. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    8. 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.
    9. J-F Cordeau & G Laporte & A Mercier, 2001. "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(8), pages 928-936, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marseglia, G. & Mesa, J.A. & Ortega, F.A. & Piedra-de-la-Cuadra, R., 2022. "A heuristic for the deployment of collecting routes for urban recycle stations (eco-points)," Socio-Economic Planning Sciences, Elsevier, vol. 82(PA).
    2. Asif Iqbal & Abdullah Yasar & Abdul-Sattar Nizami & Rafia Haider & Faiza Sharif & Imran Ali Sultan & Amtul Bari Tabinda & Aman Anwer Kedwaii & Muhammad Murtaza Chaudhary, 2022. "Municipal Solid Waste Collection and Haulage Modeling Design for Lahore, Pakistan: Transition toward Sustainability and Circular Economy," Sustainability, MDPI, vol. 14(23), pages 1-39, December.
    3. Wanting Zhang & Ming Zeng & Peng Guo & Kun Wen, 2022. "Variable Neighborhood Search for Multi-Cycle Medical Waste Recycling Vehicle Routing Problem with Time Windows," IJERPH, MDPI, vol. 19(19), pages 1-25, October.
    4. Michael Schneider & Andreas Stenger & Dominik Goeke, 2014. "The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations," Transportation Science, INFORMS, vol. 48(4), pages 500-520, November.
    5. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns," Omega, Elsevier, vol. 48(C), pages 60-74.
    6. Gamberini, Rita & Gebennini, Elisa & Manzini, Riccardo & Ziveri, Andrea, 2010. "On the integration of planning and environmental impact assessment for a WEEE transportation network—A case study," Resources, Conservation & Recycling, Elsevier, vol. 54(11), pages 937-951.
    7. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    8. 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.
    9. Lavigne, Carolien & Inghels, Dirk & Dullaert, Wout & Dewil, Reginald, 2023. "A memetic algorithm for solving rich waste collection problems," European Journal of Operational Research, Elsevier, vol. 308(2), pages 581-604.
    10. Jens Van Engeland & Jeroen Beliën, 2021. "Tactical waste collection: column generation and mixed integer programming based heuristics," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 89-126, March.
    11. Lin, Hung-Yueh & Chen, Guan-Hwa & Lee, Pei-Hao & Lin, Chun-Hsu, 2010. "An interactive optimization system for the location of supplementary recycling depots," Resources, Conservation & Recycling, Elsevier, vol. 54(10), pages 615-622.
    12. Peng, Xiaoshuai & Zhang, Lele & Thompson, Russell G. & Wang, Kangzhou, 2023. "A three-phase heuristic for last-mile delivery with spatial-temporal consolidation and delivery options," International Journal of Production Economics, Elsevier, vol. 266(C).
    13. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    14. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    15. Pearce, Joshua M. & Johnson, Sara J. & Grant, Gabriel B., 2007. "3D-mapping optimization of embodied energy of transportation," Resources, Conservation & Recycling, Elsevier, vol. 51(2), pages 435-453.
    16. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    17. repec:dar:wpaper:62383 is not listed on IDEAS
    18. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    19. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    20. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    21. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.

    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:gam:jmathe:v:12:y:2024:i:3:p:501-:d:1333931. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.