The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration

We use the Local Optima Network model to study the structure of symmetric TSP fitness landscapes. The 'big-valley' hypothesis holds that for TSP and other combinatorial problems, local optima are not randomly distributed, instead they tend to be clustered around the global optimum. However, a recent study has observed that, for solutions close in evaluation to the global optimum, this structure breaks down into multiple valleys, forming what has been called 'multiple funnels'. The multiple funnel concept implies that local optima are organised into clusters, so that a particular local optimum largely belongs to a particular funnel. Our study is the first to extract and visualise local optima networks for TSP and is based on a sampling methodology relying on the Chained Lin-Kernighan algorithm. We confirm the existence of multiple funnels on two selected TSP instances, finding additional funnels in a previously studied instance. Our results suggests that transitions among funnels are possible using operators such as 'double-bridge'. However, for consistently escaping sub-optimal funnels, more robust escaping mechanisms are required.

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

[2]  Doug Hains,et al.  Revisiting the big valley search space structure in the TSP , 2011, J. Oper. Res. Soc..

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

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

[5]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[6]  A. Mobius,et al.  COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.

[7]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[8]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

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

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

[11]  Doug Hains,et al.  A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover , 2010, PPSN.

[12]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[13]  Mark A. Miller,et al.  Archetypal energy landscapes , 1998, Nature.

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

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

[16]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[17]  Sébastien Vérel,et al.  Local Optima Networks: A New Model of Combinatorial Fitness Landscapes , 2014, ArXiv.

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

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

[20]  Mark Newman,et al.  Networks: An Introduction , 2010 .

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