An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems

The fixed destination multi-depot multiple traveling salesmen problem (MmTSP) is a problem, in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman, and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on it previously. In this paper an ant system is designed to solve the problem and the results are compared to the answers obtained by solving the same problems by Lingo 8.0 which uses exact methods.

[1]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[2]  Chau-Yun Hsu,et al.  A study of feature-mapped approach to the multiple travelling salesmen problem , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[3]  William A. Gruver,et al.  Team scheduling by genetic search , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).

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

[5]  Lixin Tang,et al.  A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..

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

[7]  Kenneth DeJong,et al.  Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema , 2002, EvoWorkshops.

[8]  Takao Enkawa,et al.  A competitive neural network algorithm for solving vehicle routing problem , 1997 .

[9]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

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

[11]  Bruce L. Golden,et al.  Solving vehicle routing problems using elastic nets , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[12]  Gu Guochang,et al.  An implementation of evolutionary computation for path planning of cooperative mobile robots , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).

[13]  Fernando José Von Zuben,et al.  Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem , 2002, J. Intell. Fuzzy Syst..

[14]  Chi-Hwa Song,et al.  Extended simulated annealing for augmented TSP and multi-salesmen TSP , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[15]  Takao Enkawa,et al.  A self‐organizing neural network approach for multiple traveling salesman and vehicle routing problems , 1999 .

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

[17]  Tolga Bektas,et al.  Integer linear programming formulations of multiple salesman problems and its variations , 2006, Eur. J. Oper. Res..

[18]  Jean-Yves Potvin,et al.  A Generalized K-Opt Exchange Procedure For The MTSP , 1989 .

[19]  E. Wacholder,et al.  A neural network algorithm for the multiple traveling salesmen problem , 1989, Biological Cybernetics.