An improved ant colony optimization based algorithm for the capacitated arc routing problem

The capacitated arc routing problem is a well-studied problem in the Transportation/Logistics/OR literature. The problem consists of identifying the minimum cost routes required to service (e.g., pickup or deliver) demand located along the edges of a network. Unfortunately, the problem belongs to the set of NP-Hard problems; consequently, numerous heuristic and metaheuristic solution approaches have been developed to solve it. In this article, an ant colony optimization based metaheuristic is presented. Modifications are introduced for various components of the ant colony metaheuristics; specifically for those associated with the "initial population", the "ant decision rule" and the "local search procedure". The new metaheuristic was tested on seven standard test networks for the capacitated arc routing problem. The results demonstrate that the proposed approach performs extremely well vis-a-vis the state-of-the-art metaheuristics for the problem.

[1]  Philippe Lacomme,et al.  First Competitive Ant Colony Scheme for the CARP , 2004, ANTS Workshop.

[2]  Roberto Baldacci,et al.  Exact methods based on node-routing formulations for undirected arc-routing problems , 2006 .

[3]  Akio Imai,et al.  A Lagrangian relaxation-based heuristic for the vehicle routing with full container load , 2007, Eur. J. Oper. Res..

[4]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[5]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[6]  Richard W. Eglese,et al.  A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..

[7]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[8]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[9]  Irene Loiseau,et al.  An Ant Colony Algorithm for the Capacitated Vehicle Routing , 2004, Electron. Notes Discret. Math..

[10]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[11]  Marc Reimann,et al.  Comparing backhauling strategies in vehicle routing using Ant Colony Optimization , 2006, Central Eur. J. Oper. Res..

[12]  G Laporte,et al.  Solving arc routing problems with turn penalties , 2000, J. Oper. Res. Soc..

[13]  Miguel A. Figliozzi,et al.  Analysis of the efficiency of urban commercial vehicle tours: Data collection, methodology, and policy implications , 2007 .

[14]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[17]  Luís Santos,et al.  An improved heuristic for the capacitated arc routing problem , 2009, Comput. Oper. Res..

[18]  José-Manuel Belenguer,et al.  Lower and upper bounds for the mixed capacitated arc routing problem , 2006, Comput. Oper. Res..

[19]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[20]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[21]  Richard W. Eglese,et al.  A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .

[22]  Wen Lea Pearn,et al.  Approximate solutions for the capacitated arc routing problem , 1989, Comput. Oper. Res..

[23]  Yanfeng Ouyang,et al.  Design of vehicle routing zones for large-scale distribution systems , 2007 .

[24]  Luca Maria Gambardella,et al.  Ant Colony Optimization , 2004 .

[25]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[26]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

[27]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[28]  Karen Renee Smilowitz,et al.  Modeling Techniques for Periodic Vehicle Routing Problems , 2006 .

[29]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[30]  John R. Current,et al.  Implementing a multi-vehicle multi-route spatial decision support system for efficient trash collection in Portugal , 2008 .

[31]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[32]  Richard W. Eglese,et al.  An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .

[33]  Patrick Prosser,et al.  Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics , 2000, J. Heuristics.

[34]  Lincoln C. Wood,et al.  The relative impact of consignee behaviour and road traffic congestion on distribution costs , 2007 .

[35]  Joaquín Bautista,et al.  Solving an urban waste collection problem using ants heuristics , 2008, Comput. Oper. Res..

[36]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[37]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[38]  J. Current,et al.  An Improved Solution Algorithm for the Constrained Shortest Path Problem , 2007 .

[39]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[40]  Seiji S.C. Steimetz,et al.  Defensive driving and the external costs of accidents and travel delays , 2008 .

[41]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[42]  Godfrey C. Onwubolu,et al.  New optimization techniques in engineering , 2004, Studies in Fuzziness and Soft Computing.

[43]  José-Manuel Belenguer,et al.  A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..

[44]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[45]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[46]  Philippe Lacomme,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.

[47]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[48]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..