A parallel ensemble genetic algorithm for the traveling salesman problem

A parallel ensemble of Genetic Algorithms for the Traveling Salesman Problem (TSP) is proposed. Different TSP solvers perform efficiently on different instance types. However, finding the best solver for all instances is challenging. A hybrid of the Mixing Genetic Algorithm (MGA) and Edge Assembly Crossover (EAX) has been shown to perform well on hard instances. The MGA uses Generalized Partition Crossover (GPX) to find the best and worst out of 2k possible solutions, where k is a decomposition factor of two-parent tours. MGA mixes the edges without any loss of diversity in the population. The best individuals move to the top of the population. The worst individuals are filtered to the bottom of the population. Previously, MGA was applied to TSP instances with less than 4,500 vertices. In this article, various Island Model implementations of MGA are introduced to handle larger problem sizes. The island model uses two mixing policies - migration, which does not lose diversity, and replacement, which loses some population diversity. The islands are configured in two patterns - a ring and a hypercube. An ensemble running multiple versions of an hybrid of MGA and EAX algorithms yields excellent performance for problems as large as 85,900.

[1]  Wayne Luk,et al.  Pipelined Genetic Propagation , 2015, 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines.

[2]  Isao Ono,et al.  A parallel genetic algorithm with edge assembly crossover for 100,000-city scale TSPs , 2013, 2013 IEEE Congress on Evolutionary Computation.

[3]  Anthony A. Maciejewski,et al.  A Study of Five Parallel Approaches to a Genetic Algorithm for the Traveling Salesman Problem , 2005, Intell. Autom. Soft Comput..

[4]  Shigenobu Kobayashi,et al.  A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem , 2013, INFORMS J. Comput..

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

[6]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[7]  L. Darrell Whitley,et al.  Improving an exact solver for the traveling salesman problem using partition crossover , 2017, GECCO.

[8]  L. Darrell Whitley,et al.  A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima , 2019, Evolutionary Computation.

[9]  Heike Trautmann,et al.  Leveraging TSP Solver Complementarity through Machine Learning , 2018, Evolutionary Computation.

[10]  L. Darrell Whitley,et al.  The massively parallel mixing genetic algorithm for the traveling salesman problem , 2019, GECCO.

[11]  L. Darrell Whitley,et al.  A New Method for Identification of Recombining Components in the Generalized Partition Crossover , 2019, 2019 8th Brazilian Conference on Intelligent Systems (BRACIS).

[12]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[13]  Joseph Culberson,et al.  Genetic Invariance: A New Paradigm for Genetic Algorithm Design , 1992 .

[14]  L. Darrell Whitley,et al.  Why many travelling salesman problem instances are easier than you think , 2020, GECCO.

[15]  L. Darrell Whitley,et al.  Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic , 2018, PPSN.

[16]  L. Darrell Whitley,et al.  Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover , 2017, GECCO.