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

Authors:
Gianpaolo Ghiani;Demetrio Laganà;Gilbert Laporte;Francesco Mari
Affiliations:
Department of Innovation Engineering, University of Lecce, Lecce, Italy 73100;Department of Electronics, Informatics and Systems, University of Calabria, Rende, Italy 87036;Canada Research Chair in Distribution Management, HEC Montréal, Montréal, Canada H3T 2A7;Supercomputing Center for Computational Engineering (CESIC), NEC Italy, Rende, Italy 87036
Venue:
Journal of Heuristics
Year:
2010

Citing 11
Cited 2

The ant colony optimization meta-heuristic

New ideas in optimization
Ant algorithms for discrete optimization

Artificial Life
SavingsAnts for the Vehicle Routing Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Racing Algorithm for Configuring Metaheuristics

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

Transportation Science
The Arc Routing and Scheduling Problem with Transshipment

Transportation Science
Ant Colony Optimization

Ant Colony Optimization
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Capacitated arc routing problem with deadheading demands

Computers and Operations Research
A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.