This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by De Rosa, B. Articles by Musmanno, R. Search for Related Content

The Arc Routing and Scheduling Problem with Transshipment

Dipartimento di Ingegneria Economico-Gestionale, Università degli Studi di Napoli "Federico II," Via Claudio, 21, 80125 Napoli, Italy
Dipartimento di Ingegneria Economico-Gestionale, Università degli Studi di Napoli "Federico II," Via Claudio, 21, 80125 Napoli, Italy
Dipartimento di Ingegneria dell'Innovazione, Edificio "La Stecca," Via per Arnesano, 73100 Lecce, Italy
Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, Via per Monteroni, 73100 Lecce, Italy
improta{at}unina.it
gianpaolo.ghiani{at}unile.it
musmanno{at}unical.it

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.

History: Received: February 2001; revised: June 2001; accepted: July 2001.