Ant Colony optimization technique to Solve the min-max multi depot vehicle routing problem

In this paper, we extend our work on solving minmax single depot vehicle routing, published in the proceedings of the ACC 2011, to solving min-max multi depot vehicle routing problem. The min-max multi-depot vehicle routing problem involves minimizing the maximum distance travelled by any vehicle in case of vehicles starting from multiple depots and travelling to each customer location (or city) at least once. This problem is of specific significance in case of time critical applications such as emergency response in large-scale disasters, and server-client network latency. In this paper we extend the ant colony based algorithm which was proposed earlier in our previous paper and introduce a novel way to address the min-max multi-depot vehicle routing problem. The approach uses a region partitioning method developed by Carlsson et al. to convert the multi-depot problem into multiple single-depot versions. A computer simulation model using MATLAB was developed. Also, in terms of optimality of solution and computational time, a comparison with the existing Carlsson model has been carried out.

[1]  Germano C. Vasconcelos,et al.  A hybrid search method for the vehicle routing problem with time windows , 2010, Ann. Oper. Res..

[2]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[3]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[4]  Richard M. Karp,et al.  A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[5]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

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

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

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

[9]  John Gunnar Carlsson,et al.  Solving Min-Max Multi-Depot Vehicle Routing Problem ⁄ , 2007 .

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

[11]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[12]  Joseph ORourke,et al.  Computational Geometry in C Second Edition , 1998 .

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

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

[15]  Radoslaw Hofman,et al.  Report on article The Travelling Salesman Problem: A Linear Programming Formulation , 2008, ArXiv.

[16]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[17]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[18]  Manish Kumar,et al.  Ant colony optimization technique to solve the min-max Single Depot Vehicle Routing Problem , 2011, Proceedings of the 2011 American Control Conference.

[19]  John W. Chinneck,et al.  Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods , 2007 .

[20]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[21]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[22]  Yinyu Ye,et al.  Finding equitable convex partitions of points in a polygon efficiently , 2010, TALG.

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

[24]  Roberto Montemanni,et al.  Ant Colony Optimisation for vehicle routing problems: from theory to applications. , 2004 .

[25]  Dirk Sudholt,et al.  Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search , 2009, Innovations in Swarm Intelligence.

[26]  E Bonabeau,et al.  Swarm Intelligence: A Whole New Way to Think about Business , 2001 .

[27]  Jing Wang,et al.  Swarm Intelligence in Cellular Robotic Systems , 1993 .

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

[29]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[30]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

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

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

[33]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

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

[35]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

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

[37]  J. Tukey,et al.  Generalized “sandwich” theorems , 1942 .

[38]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

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

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

[41]  Thomas Stützle,et al.  ACO Algorithms for the Travelling Salesman Problem , 1999 .

[42]  Sergey Bereg,et al.  Generalizing Ham Sandwich Cuts to Equitable Subdivisions , 2000, Discret. Comput. Geom..

[43]  Jon Lee.  A First Course in Combinatorial Optimization , 2004 .

[44]  Andrew Lim,et al.  Multi-depot vehicle routing problem: a one-stage approach , 2005, IEEE Transactions on Automation Science and Engineering.

[45]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..