期刊
JOURNAL OF HEURISTICS
卷 14, 期 5, 页码 405-423出版社
SPRINGER
DOI: 10.1007/s10732-007-9050-2
关键词
capacitated arc routing problem; variable neighborhood search; intermediate facilities; tour length restriction
资金
- Oesterreichische Nationalbank (OeNB) [11187]
- Fonds zur Forderung der wissenschaftlichen Forschung (FWF) [L286-N04]
- Ser.In.Ar. fund
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据