Ant Colony Optimisation for vehicle routing problems: from theory to applications.

Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we show its successful application to the Vehicle Routing Problem (VRP). First, we introduce VRP and its many variants, such as VRP with Time Windows, Time Dependent VRP, Dynamic VRP, VRP with Pickup and Delivery. These variants have been formulated in order to bring the VRP as close as possible to the kind of situations encountered in real-world distribution processes. Two case studies are presented: the application of Ant Colony Optimisation to the solution of the Time Dependent VRP, where the travel times depend on the time of the day, and Ant Colony Optimisation for Dynamic VRP, where customers’ orders arrive during the delivery process. Finally, two real-world, industrial-scale applications are presented. The former is an application solving a VRP with Time Windows for a major supermarket chain in Switzerland; the latter is an application solving a VRP with Pickup and Delivery for a leading distribution ∗Corresponding author. Tel: +41 91 610 8663. Fax: +41 91 610 8661. Email: luca@idsia.ch.

[1]  Luca Maria Gambardella,et al.  Simulation and Planning of an Intermodal Container Terminal , 1998, Simul..

[2]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[3]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

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

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

[6]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

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

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

[9]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

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

[12]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[13]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[14]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[15]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[16]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[17]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

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

[19]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[20]  G. Laporte,et al.  Solving Stochastic Routing Problems with the Integer L-Shaped Method , 1998 .

[21]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[22]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[23]  Martin Middendorf,et al.  Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP , 2001, EvoWorkshops.

[24]  Karl F. Doerner,et al.  A Savings Based Ant System For The Vehicle Routing Problem , 2002, GECCO.

[25]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[26]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[27]  Paolo Toth,et al.  Exact Solution of the Vehicle Routing Problem , 1998 .

[28]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[29]  Martin W. P. Savelsbergh,et al.  10. Vehicle routing: handling edge exchanges , 2003 .

[30]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[31]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

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

[33]  ManMohan S. Sodhi,et al.  Special Issue: OR/MS and E-Business: Applications and Opportunities for Operations Research in Internet-Enabled Supply Chains and Electronic Marketplaces , 2001, Interfaces.

[34]  Roberto Montemanni,et al.  A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System , 2002 .

[35]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[36]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[37]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[38]  Patrick Prosser,et al.  Dynamic VRPs: A Study of Scenarios , 1998 .

[39]  T. Stützle,et al.  Analyzing the Run-time Behaviour of Iterated Local Search for the TSP , 1999 .

[40]  Herbert E. Scarf,et al.  Optimal Policies for a Multi-Echelon Inventory Problem , 1960, Manag. Sci..

[41]  Angus R. Simpson,et al.  Ant Colony Optimization for Design of Water Distribution Systems , 2003 .

[42]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[43]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[44]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[45]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[46]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[47]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[48]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[49]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[51]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[52]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[53]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[54]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[55]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[56]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[57]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .