Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study

Starting from a case study, a rich vehicle routing problem is analyzed. It is characterized by multiple time windows, heterogeneous fleet, maximum duration, and multiple visits. Two variants of Ant Colony Optimization are proposed in a multiple colonies framework. Two algorithms are tested, giving results that appear satisfactory with respect to the ones achieved by the firm.

[1]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[2]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[3]  Mauro Birattari,et al.  Model-Based Search for Combinatorial Optimization: A Critical Survey , 2004, Ann. Oper. Res..

[4]  Jean-Yves Potvin,et al.  A hybrid approach to vehicle routing using neural networks and genetic algorithms , 1996, Applied Intelligence.

[5]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[6]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[7]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[8]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[9]  Moshe Dror,et al.  A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..

[10]  Paola Pellegrini.  Application of Two Nearest Neighbor Approaches to a Rich Vehicle Routing Problem , 2005 .

[11]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[12]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[13]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[14]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[15]  Mauro Birattari,et al.  The problem of tuning metaheuristics: as seen from the machine learning perspective , 2004 .

[16]  Mauro Birattari,et al.  Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands , 2005, J. Math. Model. Algorithms.

[17]  Mauro Birattari,et al.  Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands , 2004, PPSN.

[18]  Bruce L. Golden,et al.  A Lagrangean relaxation heuristic for vehicle routing , 1984 .

[19]  Attahiru Sule Alfa,et al.  A 3-OPT based simulated annealing algorithm for vehicle routing problems , 1991 .

[20]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[21]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[22]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[23]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[24]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[25]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[26]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[27]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[28]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[29]  M. Birattari,et al.  Artificielle On the Estimation of the Expected Performance of a Metaheuristic on a Class of Instances How many instances , how many runs ? , 2004 .

[30]  Mauro Birattari,et al.  Towards a theory of practice in metaheuristics design: A machine learning perspective , 2006, RAIRO Theor. Informatics Appl..

[31]  Thomas Stützle,et al.  A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.

[32]  Nicos Christofides,et al.  A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..

[33]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[34]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

[35]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[36]  Daniela Favaretto,et al.  Ant colony system for a VRP with multiple time windows and multiple visits , 2007 .