Tunnelling Crossover Networks for the Asymmetric TSP

Local optima networks are a compact representation of fitness landscapes that can be used for analysis and visualisation. This paper provides the first analysis of the Asymmetric Travelling Salesman Problem using local optima networks. These are generated by sampling the search space by recording the progress of an existing evolutionary algorithm based on the Generalised Asymmetric Partition Crossover. They are compared to networks sampled through the Chained Lin-Kernighan heuristic across 25 instances. Structural differences and similarities are identified, as well as examples where crossover smooths the landscape.

[1]  Sébastien Vérel,et al.  Local Optima Networks with Escape Edges , 2011, Artificial Evolution.

[2]  Marco Tomassini,et al.  Data-driven local optima network characterization of QAPLIB instances , 2014, GECCO.

[3]  L. Darrell Whitley,et al.  Tunnelling Crossover Networks , 2015, GECCO.

[4]  Sébastien Vérel,et al.  Local Optima Networks of NK Landscapes With Neutrality , 2011, IEEE Transactions on Evolutionary Computation.

[5]  Edmund K. Burke,et al.  The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration , 2015, Artificial Evolution.

[6]  J. Doye Network topology of a potential energy landscape: a static scale-free network. , 2002, Physical review letters.

[7]  R. Jonker,et al.  Transforming asymmetric into symmetric traveling salesman problems , 1983 .

[8]  L. Darrell Whitley,et al.  Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP , 2014, GECCO.

[9]  Gabriela Ochoa,et al.  Deconstructing the Big Valley Search Space Hypothesis , 2016, EvoCOP.

[10]  Andrew M. Sutton,et al.  Efficient identification of improving moves in a ball for pseudo-boolean problems , 2014, GECCO.

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

[12]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[13]  Sébastien Vérel,et al.  A study of NK landscapes' basins and local optima networks , 2008, GECCO '08.

[14]  Gabriela Ochoa,et al.  Additional Dimensions to the Study of Funnels in Combinatorial Landscapes , 2016, GECCO.

[15]  Doug Hains,et al.  Tunneling between optima: partition crossover for the traveling salesman problem , 2009, GECCO.

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

[17]  Forschungsinstitut für Diskrete Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .

[18]  L. Darrell Whitley,et al.  Partition Crossover for Pseudo-Boolean Optimization , 2015, FOGA.