TY - GEN
T1 - Online Re-routing for Vehicle Breakdown in Residential Waste Collection
AU - Ramamoorthy, Muhilan
AU - Syrotiuk, Violet R.
N1 - Funding Information:
This research was supported in part by the U.S. National Science Foundation NeTS Awards #1421058 and #1813451.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/11
Y1 - 2020/11
N2 - We model residential waste collection as a Capacitated Arc Routing Problem (CARP). Because the collection vehicles are expensive, many public works departments cannot afford extra vehicles on hand if one breaks down. A conventional solution is for the unserved streets in the route of the broken down vehicle to be served by one of the others in the fleet as an overtime job. Instead, we propose to distribute the unserved streets among all remaining operational vehicles when a breakdown occurs. We propose PROBE, an algorithm to dynamically re-route collection vehicles in the event of a breakdown, with the objective to minimize the makespan. We evaluate PROBE on the classical CARP benchmark instances GDB, VAL, EGL, and EGL-Large. Compared to the conventional solution, PROBE obtains reduced makespan, range, and discrepancies which indicate improved balance of the solution. The run time of PROBE is linear in the number of required edges suggesting good scalability.
AB - We model residential waste collection as a Capacitated Arc Routing Problem (CARP). Because the collection vehicles are expensive, many public works departments cannot afford extra vehicles on hand if one breaks down. A conventional solution is for the unserved streets in the route of the broken down vehicle to be served by one of the others in the fleet as an overtime job. Instead, we propose to distribute the unserved streets among all remaining operational vehicles when a breakdown occurs. We propose PROBE, an algorithm to dynamically re-route collection vehicles in the event of a breakdown, with the objective to minimize the makespan. We evaluate PROBE on the classical CARP benchmark instances GDB, VAL, EGL, and EGL-Large. Compared to the conventional solution, PROBE obtains reduced makespan, range, and discrepancies which indicate improved balance of the solution. The run time of PROBE is linear in the number of required edges suggesting good scalability.
KW - Capacitated arc routing
KW - breakdown management
KW - heuristics
KW - vehicle rerouting
UR - http://www.scopus.com/inward/record.url?scp=85101349900&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85101349900&partnerID=8YFLogxK
U2 - 10.1109/VTC2020-Fall49728.2020.9348713
DO - 10.1109/VTC2020-Fall49728.2020.9348713
M3 - Conference contribution
AN - SCOPUS:85101349900
T3 - IEEE Vehicular Technology Conference
BT - 2020 IEEE 92nd Vehicular Technology Conference, VTC 2020-Fall - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 92nd IEEE Vehicular Technology Conference, VTC 2020-Fall
Y2 - 18 November 2020
ER -