Journal
JOURNAL OF HEURISTICS
Volume 14, Issue 5, Pages 405-423Publisher
SPRINGER
DOI: 10.1007/s10732-007-9050-2
Keywords
capacitated arc routing problem; variable neighborhood search; intermediate facilities; tour length restriction
Funding
- Oesterreichische Nationalbank (OeNB) [11187]
- Fonds zur Forderung der wissenschaftlichen Forschung (FWF) [L286-N04]
- Ser.In.Ar. fund
Ask authors/readers for more resources
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. The VNS shows excellent results on four different benchmark sets. Particularly, for all 120 instances the best known solution could be found and in 71 cases a new best solution was achieved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available