A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

  • Authors:

  • Michael Polacek;Karl F. Doerner;Richard F. Hartl;Vittorio Maniezzo

  • Affiliations:

  • Department of Business Administration, University of Vienna, Vienna, Austria 1210;Department of Business Administration, University of Vienna, Vienna, Austria 1210;Department of Business Administration, University of Vienna, Vienna, Austria 1210;Department of Computer Science, University of Bologna, Bologna, Italy 40100

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.