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

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

0.00 Avg rating—0 Votes
Article ID: iaor20102679
Volume: 16
Issue: 2
Start Page Number: 211
End Page Number: 233
Publication Date: Apr 2010
Journal: Journal of Heuristics
Authors: , , ,
Keywords: heuristics: ant systems
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.

Reviews

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