A novel method for multiple depot and open paths, Multiple Traveling Salesmen Problem

Travelling Salesman Problem (TSP) is a typical combinatorial optimization problem. Multiple Travelling Salesmen Problem (MTSP) is a generalization of the TSP, and seems more appropriate for real-life application. Although there exists a great mount of literature for solving TSP, the research on MTSP is limited. This paper proposes a new method which is based on the knowledge of Graph Theory to solve a heterogeneity of MTSP with multiple depots and open paths (marked as mdop). A simple model SModel is proposed to implement the mdop by transforming a complicate graph into a simplified graph with a small number of edges. During the operation of generating SModel, high weighted edges are removed preferentially as possible. Since mdop is implemented based on the SModel, it can be guaranteed that the final result is superior. By the experimental results, it is shown that the new solution is efficient.

[1]  Richard H Mole,et al.  Combinatorial analysis for route first-cluster second vehicle routing , 1983 .

[2]  Swaroop Darbha,et al.  A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem , 2007, ACC.

[3]  T. Glenn Bailey,et al.  Reactive Tabu Search in unmanned aerial reconnaissance simulations , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[4]  Swaroop Darbha,et al.  A transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem , 2009, 2009 American Control Conference.

[5]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[6]  Cliff T. Ragsdale,et al.  A new approach to solving the multiple traveling salesperson problem using genetic algorithms , 2006, Eur. J. Oper. Res..

[7]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[8]  Hussain Aziz Saleh,et al.  The design of the global navigation satellite system surveying networks using genetic algorithms , 2004, Eng. Appl. Artif. Intell..

[9]  Sujian Li,et al.  An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem , 2009, 2009 4th IEEE Conference on Industrial Electronics and Applications.

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

[11]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[12]  Gilbert Laporte,et al.  Heuristics for the black and white traveling salesman problem , 2003, Comput. Oper. Res..

[13]  Manuel López-Ibáñez,et al.  Beam-ACO for the travelling salesman problem with time windows , 2010, Comput. Oper. Res..

[14]  Andrew B. Whinston,et al.  Computer-Assisted School Bus Scheduling , 1972 .

[15]  S. Gorenstein.  Printing Press Scheduling for Multi-Edition Periodicals , 1970 .

[16]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[17]  Zhang Yi,et al.  A columnar competitive model for solving multi-traveling salesman problem☆ , 2007 .

[18]  J. Svestka,et al.  Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .

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

[20]  Agha Iqbal Ali,et al.  The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm , 1986, Discret. Appl. Math..

[21]  Barry Brumitt,et al.  Dynamic mission planning for multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[22]  Takao Enkawa,et al.  Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..