Quantcast

Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions

Research paper by Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, Francesco Mari

Indexed on: 21 Oct '08Published on: 21 Oct '08Published in: Journal of Heuristics



Abstract

The aim of this paper is to introduce a new ant colony optimization procedure for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions (CLARPIF), a variant of the Capacitated Arc Routing Problem (CARP) and of the Capacitated Arc Routing Problem with Intermediate Facilities (CARPIF). Computational results show that this algorithm is capable of providing substantial improvements over other known heuristics.