The Arc Routing and Scheduling Problem with Transshipment
Barbara De Rosa,
Gennaro Improta (),
Gianpaolo Ghiani () and
Roberto Musmanno ()
Additional contact information
Barbara De Rosa: Dipartimento di Ingegneria Economico-Gestionale, Università degli Studi di Napoli “Federico II,” Via Claudio, 21, 80125 Napoli, Italy
Gennaro Improta: Dipartimento di Ingegneria Economico-Gestionale, Università degli Studi di Napoli “Federico II,” Via Claudio, 21, 80125 Napoli, Italy
Gianpaolo Ghiani: Dipartimento di Ingegneria dell'Innovazione, Edificio "La Stecca," Via per Arnesano, 73100 Lecce, Italy
Roberto Musmanno: Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, Via per Monteroni, 73100 Lecce, Italy
Transportation Science, 2002, vol. 36, issue 3, 301-313
Abstract:
This article introduces the Arc Routing and Scheduling Problem with Transshipment (ARPT), a particular Arc 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.
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)
Downloads: (external link)
http://dx.doi.org/10.1287/trsc.36.3.301.7832 (application/pdf)
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:inm:ortrsc:v:36:y:2002:i:3:p:301-313
Access Statistics for this article
More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().