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

Vincent F. Yu, Panca Jodiawan, Shih-Wei Lin (), Winy Fara Nadira, Anna Maria Sri Asih and Le Nguyen Hoang Vinh
Additional contact information
Vincent F. Yu: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
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
Winy Fara Nadira: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
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

Mathematics, 2024, vol. 12, issue 3, 1-20

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.

Keywords: waste collection; vehicle routing problem; self-delivery option; simulated annealing (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/3/501/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/3/501/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:3:p:501-:d:1333931

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().