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 available as:
[img]
Preview
PDF
Download (246kB) | Preview

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
Document type
Preprint
Creators
CreatorsAffiliationORCID
Polacek, Michael
Doerner, Karl F.
Hartl, Richard F.
Maniezzo, Vittorio
Keywords
Capacitated Arc Routing Problem, Variable Neighborhood Search, Intermediate Facilities, Tour Length Restriction
Subjects
DOI
Deposit date
16 May 2006
Last modified
23 Aug 2011 11:22
URI

Other metadata

Downloads

Downloads

Staff only: View the document

^