Deconstructing the Big Valley Search Space Hypothesis

The big valley hypothesis suggests that, in combinatorial optimisation, local optima of good quality are clustered and surround the global optimum. We show here that the idea of a single valley does not always hold. Instead the big valley seems to de-construct into several valleys, also called ‘funnels’ in theoretical chemistry. We use the local optima networks model and propose an effective procedure for extracting the network data. We conduct a detailed study on four selected TSP instances of moderate size and observe that the big valley decomposes into a number of sub-valleys of different sizes and fitness distributions. Sometimes the global optimum is located in the largest valley, which suggests an easy to search landscape, but this is not generally the case. The global optimum might be located in a small valley, which offers a clear and visual explanation of the increased search difficulty in these cases. Our study opens up new possibilities for analysing and visualising combinatorial landscapes as complex networks.

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

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

[3]  Peter F. Stadler,et al.  Funnels in energy landscapes , 2007, 0707.3719.

[4]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

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

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

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

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

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

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

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

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

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

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

[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]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

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

[19]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

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

[21]  Jaroslav Nesetril,et al.  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..

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

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