An efficient Hybrid Algorithm for the Multiple Traveling Salesmen Problem using novel Crossover and Ant Colony Optimization

[1]  Dharm Raj Singh,et al.  Genetic Algorithm for Solving Multiple Traveling Salesmen Problem using a New Crossover and Population Generation , 2018, Computación y Sistemas.

[2]  M. Yousefikhoshbakht,et al.  Modification of the Ant Colony Optimization for Solving the Multiple Traveling Salesman Problem , 2013 .

[3]  Charles J. Malmborg,et al.  A genetic algorithm for service level based vehicle scheduling , 1996 .

[4]  C. Okonjo-Adigwe.  An effective method of balancing the workload amongst salesmen , 1988 .

[5]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[6]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

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

[8]  Sheldon H. Jacobson,et al.  Optimal search strategies using simultaneous generalized hill climbing algorithms , 2006, Math. Comput. Model..

[9]  Zhang Yi,et al.  Columnar competitive model for solving multi-traveling salesman problem , 2007 .

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

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

[12]  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..

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

[14]  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.

[15]  AllahverdiNovruz,et al.  Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms , 2011 .

[16]  Cliff T. Ragsdale,et al.  A Grouping Genetic Algorithm for the Multiple Traveling Salesperson Problem , 2007, Int. J. Inf. Technol. Decis. Mak..

[17]  Gamini Dissanayake,et al.  A job grouping approach for planning container transfers at automated seaport container terminals , 2011, Adv. Eng. Informatics.

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

[19]  Yang-Byung Park,et al.  A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines , 2001 .

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

[21]  Sushil J. Louis,et al.  Case Injected Genetic Algorithms for Traveling Salesman Problems , 2000, Inf. Sci..

[22]  Yong Chen,et al.  Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution , 2006, cond-mat/0603237.

[23]  Shoudong Huang,et al.  A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms , 2013, Eur. J. Oper. Res..

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

[25]  Kenneth C. Gilbert,et al.  A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem , 1992 .