The aim of this paper is to introduce a new ant colony optimization procedurefor the Arc Routing Problem with Intermediate Facilities under Capacity andLength 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 providingsubstantial improvements over other known heuristics.
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
Ghiani G;Laganà D;
2010-01-01
Abstract
The aim of this paper is to introduce a new ant colony optimization procedurefor the Arc Routing Problem with Intermediate Facilities under Capacity andLength 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 providingsubstantial improvements over other known heuristics.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
