A Tabu Search Heuristic for the Capacitated Arc Routing Problem

  • Authors:
  • Alain Hertz;Gilbert Laporte;Michel Mittaz

  • Affiliations:
  • -;-;-

  • Venue:
  • Operations Research
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.