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

被引：2

作者：

Yu, Vincent F. ^{[1
,2
]}

Jodiawan, Panca ^{[1
]}

Lin, Shih-Wei ^{[3
,4
,5
]}

Nadira, Winy Fara ^{[1
,6
]}

Asih, Anna Maria Sri ^{[6
]}

Vinh, Le Nguyen Hoang ^{[1
]}

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106335, Taiwan

[2] Portland State Univ, Dept Civil & Environm Engn, Portland, OR 97201 USA

[3] Chang Gung Univ, Dept Informat Management, Taoyuan 33302, Taiwan

[4] Ming Chi Univ Technol, Dept Ind Engn & Management, New Taipei 243303, Taiwan

[5] Keelung Chang Gung Mem Hosp, Dept Emergency Med, Keelung 20401, Taiwan

[6] Univ Gadjah Mada, Dept Mech & Ind Engn, Yogyakarta 55281, Indonesia

来源：

MATHEMATICS | 2024年 / 12卷 / 03期

关键词：

waste collection; vehicle routing problem; self-delivery option; simulated annealing; ANT COLONY ALGORITHM; OPTIMIZATION; MODEL; SYSTEM;

D O I：

10.3390/math12030501

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页数：20

共 55 条

[1] Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem
Abdulkader, Mohamed M. S.
Gajpal, Yuvraj
ElMekkawy, Tarek Y.
[J]. APPLIED SOFT COMPUTING, 2015, 37 : 196 - 203
[2] Theoretical model and implementation of a real time intelligent bin status monitoring system using rule based decision algorithms
Al Mamun, Md. Abdulla
Hannan, M. A.
Hussain, Aini
Basri, Hassan
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 48 : 76 - 88
[3] A novel bi-objective credibility-based fuzzy model for municipal waste collection with hard time windows
Aliahmadi, Seyed Zeinab
Barzinpour, Farnaz
Pishvaee, Mir Saman
[J]. JOURNAL OF CLEANER PRODUCTION, 2021, 296
[4] Amalia S., 2020, J. Ilmu Adm, V17, P306, DOI [10.31113/jia.v17i2.613, DOI 10.31113/JIA.V17I2.613]
[5] Toward a more flexible VRP with pickup and delivery allowing consolidations
Ancele, Yannis
Ha, Minh Hoang
Lersteau, Charly
Matellini, Dante Ben
Nguyen, Trung Thanh
[J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 128
[6] Astuti F.A., 2018, Sci. Tech. J. Ilmu Pengetah. Dan Teknol, V4, P59
[7] Municipal Solid Waste Collection and Management Problems: A Literature Review
Belien, Jeroen
De Boeck, Liesje
Van Ackere, Jonas
[J]. TRANSPORTATION SCIENCE, 2014, 48 (01) : 78 - 102
[8] Dynamic Multi-Compartment Vehicle Routing Problem for Smart Waste Collection
Bouleft, Yousra
Elhilali Alaoui, Ahmed
[J]. APPLIED SYSTEM INNOVATION, 2023, 6 (01)
[9] The waste collection vehicle routing problem with time windows in a city logistics context
Buhrkal, Katja
Larsen, Allan
Ropke, Stefan
[J]. SEVENTH INTERNATIONAL CONFERENCE ON CITY LOGISTICS, 2012, 39 : 241 - 254
[10] An ILS Heuristic for the Waste Collection Vehicle Routing Problem with Time Windows
Campos, Alba A.
Arroyo, Jose Elias C.
[J]. INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2016), 2017, 557 : 889 - 899

← 1 2 3 4 5 6 →