A tabu search heuristic for the capacitated arc routing problem
成果类型：
Article
署名作者：
Hertz, A; Laporte, G; Mittaz, M
署名单位：
Swiss Federal Institutes of Technology Domain; Ecole Polytechnique Federale de Lausanne; Universite de Montreal; HEC Montreal
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.48.1.129.12455
发表日期：
2000
页码：
129-135
关键词：
摘要：
The Capacitated Are Routing Problem arises in several contexts where streets or roads must be traversed for maintenance purposes or for the delivery of services. A tabu search is proposed for this difficult problem. On benchmark instances, it outperforms all known heuristics and often produces a proven optimum.