A Variable Neighborhood Search for the Capacitated Arc Routing Problem with Intermediate Facilities

Polacek, Michael ; Doerner, Karl F. ; Hartl, Richard F. ; Maniezzo, Vittorio (2006) A Variable Neighborhood Search for the Capacitated Arc Routing Problem with Intermediate Facilities. [Preprint]
Full text disponibile come:
[thumbnail of polacek_carpif.pdf]
Anteprima
Documento PDF
Download (246kB) | Anteprima

Abstract

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. The proposed Variable Neighborhood Search (VNS) is a simple and robust solution technique which tackles the basic problem as well as its extensions. Particularly, it outperforms all known heuristics on four sets of benchmark instances.

Abstract
Tipologia del documento
Preprint
Autori
AutoreAffiliazioneORCID
Polacek, Michael
Doerner, Karl F.
Hartl, Richard F.
Maniezzo, Vittorio
Parole chiave
Capacitated Arc Routing Problem, Variable Neighborhood Search, Intermediate Facilities, Tour Length Restriction
Settori scientifico-disciplinari
DOI
Data di deposito
16 Mag 2006
Ultima modifica
23 Ago 2011 11:22
URI

Altri metadati

Statistica sui download

Statistica sui download

Gestione del documento: Visualizza il documento

^