Answers are grounded in this paper and cite their sources.
The Capacitated Arc 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.
No takes yet. Share an insight, caveat, or question.
Hertz et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: