Comparing communities of optima with funnels in combinatorial fitness landscapes

The existence of sub-optimal funnels in combinatorial fitness landscapes has been linked to search difficulty. The exact nature of these structures --- and how commonly they appear --- is not yet fully understood. Improving our understanding of funnels could help with designing effective diversification mechanisms for a 'smoothing' effect, making optimisation easier. We model fitness landscapes as local optima networks. The relationship between communities of local optima found by network clustering algorithms and funnels is explored. Funnels are identified using the notion of monotonic sequences from the study of energy landscapes in theoretical chemistry. NK Landscapes and the Quadratic Assignment Problem are used as case studies. Our results show that communities are linked to funnels. The analysis exhibits relationships between these landscape structures and the performance of trajectory-based metaheuristics such as Simulated Annealing (SA) and Iterated Local Search (ILS). In particular, ILS gets trapped in funnels, and modular communities of optima slow it down. The funnels contribute to lower success for SA. We show that increasing the strength of ILS perturbation helps to 'smooth' the funnels and improves performance in multi-funnel landscapes.

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

[2]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

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

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

[5]  Thomas Bartz-Beielstein,et al.  Experimental Methods for the Analysis of Optimization Algorithms , 2010 .

[6]  Carl T. Bergstrom,et al.  The map equation , 2009, 0906.1405.

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

[8]  S. Dongen A cluster algorithm for graphs , 2000 .

[9]  P. Stadler Fitness Landscapes , 1993 .

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

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

[12]  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.

[13]  David W. Corne,et al.  Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem , 2003, EMO.

[14]  D. Bates,et al.  Fitting Linear Mixed-Effects Models Using lme4 , 2014, 1406.5823.

[15]  Sébastien Vérel,et al.  ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms , 2013, Journal of Heuristics.

[16]  Shinichi Nakagawa,et al.  A general and simple method for obtaining R2 from generalized linear mixed‐effects models , 2013 .

[17]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

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

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

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