Mapping the global structure of TSP fitness landscapes

The global structure of combinatorial landscapes is not fully understood, yet it is known to impact the performance of heuristic search methods. We use a so-called local optima network model to characterise and visualise the global structure of travelling salesperson fitness landscapes of different classes, including random and structured real-world instances of realistic size. Our study brings rigour to the characterisation of so-called funnels, and proposes an intensive and effective sampling procedure for extracting the networks. We propose enhanced visualisation techniques, including 3D plots and the incorporation of colour, sizes and widths, to reflect relevant aspects of the search process. This brings an almost tangible new perspective to the landscape and funnel metaphors. Our results reveal a much richer global structure than the suggestion of a ‘big-valley’ structure. Most landscapes of the tested instances have multiple valleys or funnels; and the number, disposition and interaction of these funnels seem to relate to search difficulty on the studied landscapes. We also find that the structured TSP instances feature high levels of neutrality, an observation not previously reported in the literature. We then propose ways of analysing and visualising these neutral landscapes.

[1]  Heike Trautmann,et al.  Detecting Funnel Structures by Means of Exploratory Landscape Analysis , 2015, GECCO.

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

[3]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[4]  D. Wales Energy landscapes and properties of biomolecules , 2005, Physical biology.

[5]  Sébastien Vérel,et al.  Complex-network analysis of combinatorial spaces: The NK landscape case , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Sébastien Vérel,et al.  Communities of Minima in Local Optima Networks of Combinatorial Spaces , 2011, ArXiv.

[7]  P. Stadler Fitness Landscapes , 1993 .

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

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

[10]  Andreas Noack,et al.  Modularity clustering is force-directed layout , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[12]  L. Darrell Whitley,et al.  The dispersion metric and the CMA evolution strategy , 2006, GECCO.

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

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

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

[16]  Bernd Bischl,et al.  A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem , 2012, Annals of Mathematics and Artificial Intelligence.

[17]  Berry,et al.  Topography and Dynamics of Multidimensional Interatomic Potential Surfaces. , 1995, Physical review letters.

[18]  M. Karplus,et al.  The topology of multidimensional potential energy surfaces: Theory and application to peptide structure and kinetics , 1997 .

[19]  Bernd Freisleben,et al.  Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem , 1998, PPSN.

[20]  J. Hartigan,et al.  The Dip Test of Unimodality , 1985 .

[21]  J. Doye,et al.  THE DOUBLE-FUNNEL ENERGY LANDSCAPE OF THE 38-ATOM LENNARD-JONES CLUSTER , 1998, cond-mat/9808265.

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

[23]  Franz Rothlauf,et al.  Communities of Local Optima as Funnels in Fitness Landscapes , 2016, GECCO.

[24]  C. R. Reeves,et al.  Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..

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

[26]  Peter F. Stadler,et al.  Shapes of tree representations of spin-glass landscapes , 2003 .

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

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

[29]  Adam Prügel-Bennett,et al.  Large barrier trees for studying search , 2005, IEEE Transactions on Evolutionary Computation.

[30]  Michael T. Wolfinger,et al.  Barrier Trees of Degenerate Landscapes , 2002 .

[31]  Bernd Bischl,et al.  Algorithm selection based on exploratory landscape analysis and cost-sensitive learning , 2012, GECCO '12.

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

[33]  Andrew M. Sutton,et al.  The Impact of Global Structure on Search , 2008, PPSN.

[34]  Marco Locatelli,et al.  On the Multilevel Structure of Global Optimization Problems , 2005, Comput. Optim. Appl..

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