A tabu search heuristic for the capacitated arc routing problem

A tabu search heuristic for the capacitated arc routing problem

0.00 Avg rating0 Votes
Article ID: iaor20011921
Country: United States
Volume: 48
Issue: 1
Start Page Number: 129
End Page Number: 135
Publication Date: Jan 2000
Journal: Operations Research
Authors: , ,
Keywords: networks: path
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.