The Arc Routing and Scheduling Problem with Transshipment

Authors:
Barbara De Rosa;Gennaro Improta;Gianpaolo Ghiani;Roberto Musmanno
Affiliations:
-;-;-;-
Venue:
Transportation Science
Year:
2002

Citing 0
Cited 4

Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions

Journal of Heuristics
Supply chain network design and transshipment hub location for third party logistics providers

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
The synchronized arc and node routing problem: Application to road marking

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article introduces theArc Routing and Scheduling Problem with Transshipment (ARPT), a particularArc Routing Problem whose applications arise in garbage collection. In the ARPT,the demand is collected by specially equipped vehicles, taken to a transfer station, shredded or compacted and, finally, transported to a dump site by means of high-capacity trucks. A lower bound, based on a relaxation of an integer linear formulation of the problem, is developed for the ARPT. A tailored Tabu Search heuristic is also devised. Computational results on a set of benchmark instances are reported.