Multiple traveling salesman problem using novel crossover and group theory

This paper propose a new technique which uses novel crossover with multi chromosome representation using group theory for tour construction for solving the multiple traveling salesmen problem (MTSP) using a genetic algorithm (GA) for near-optimal solutions. In the proposed algorithm, we use group tour construction method to get population having rich diversity. In group tour construction method each individual / initial tour is distinct provided that population size is less than the total number of cities. We also use multi chromosome representation technique, which minimizes the search space. We evaluated and compare the proposed technique with four different crossover methods for two MTSP objective functions, namely, total travel of the cost of m tours of the m salesman and longest tour cost travel by any one salesman. In this MTSP, we minimize these objective functions. Computational results obtained from proposed crossover with group tour construction is better than T CX, ORX+A, CYX+A, PMX + A crossover based method.

[1]  Chang-Sung Jeong,et al.  Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections , 1991, Parallel Comput..

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

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

[4]  János Abonyi,et al.  Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm , 2011, Intelligent Computational Optimization in Engineering.

[5]  Dharm Raj Singh,et al.  A hybrid heuristic algorithm for the Euclidean traveling salesman problem , 2015, International Conference on Computing, Communication & Automation.

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

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

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

[9]  Kenneth H.Rosen,et al.  "Discrete Mathematics and its Applications", 7th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011 , 2015 .

[10]  Novruz Allahverdi,et al.  Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms , 2011, Expert Syst. Appl..

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

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

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

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

[15]  J. Monnot,et al.  The Traveling Salesman Problem and its Variations , 2014 .

[16]  Dharm Raj Singh,et al.  A Hybrid Algorithm with Modified Inver-Over Operator and Genetic Algorithm Search for Traveling Salesman Problem , 2016 .

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

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

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

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