research-article

A study of NK landscapes' basins and local optima networks

Authors:

Gabriela Ochoa,

Marco Tomassini,

Sebástien Vérel,

Christian DarabosAuthors Info & Claims

GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation

Pages 555 - 562

https://doi.org/10.1145/1389095.1389204

Published: 12 July 2008 Publication History

Abstract

We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces (Doye, 2002). We use the well-known family of $NK$ landscapes as an example. In our case the inherent network is the graph where the vertices are all the local maxima and edges mean basin adjacency between two maxima. We exhaustively extract such networks on representative small NK landscape instances, and show that they are 'small-worlds'. However, the maxima graphs are not random, since their clustering coefficients are much larger than those of corresponding random graphs. Furthermore, the degree distributions are close to exponential instead of Poissonian. We also describe the nature of the basins of attraction and their relationship with the local maxima network.

References

[1]

A-L. Barabasi and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509--512.

[2]

K. D. Boese, A. B. Kahng, and S. Muddu, A new adaptive multi-start technique for combinatorial global optimizations, Operations Research Letters 16 (1994), 101--113.

Digital Library

[3]

C. Cotta and J.-J. Merelo, Where is evolutionary computation going? A temporal analysis of the EC community, Genetic Programming and Evolvable Machines 8 (2007), 239--253.

Digital Library

[4]

S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks, Oxford University Press, Oxford, New York, 2003.

[5]

J. P. K. Doye, The network topology of a potential energy landscape: a static scale-free network, Phys. Rev. Lett. 88 (2002), 238701.

[6]

J. P. K. Doye and C. P. Massen, Characterizing the network topology of the energy landscapes of atomic clusters, J. Chem. Phys. 122 (2005), 084105.

[7]

W. Feller, An introduction to probability theory and its applications, Wiley, New York, 1968.

[8]

J. Garnier and L. Kallel, Efficiency of local search with multiple local optima, SIAM Journal on Discrete Mathematics 15 (2001), no. 1, 122--141.

Digital Library

[9]

M. Giacobini, M. Preuss, and M. Tomassini, Effects of scale-free and small-world topologies on binary coded self-adaptive CEA, Evolutionary Computation in Combinatorial Optimization -- EvoCOP 2006 (Budapest), LNCS, vol. 3906, Springer Verlag, 2006, pp. 85--96.

Digital Library

[10]

M. Giacobini, M. Tomassini, and A. Tettamanzi, Takeover time curves in random and small-world structured populations, Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, ACM, 2005, pp. 1333--1340.

Digital Library

[11]

S. A. Kauffman, The origins of order, Oxford University Press, New York, 1993.

[12]

L.Luthi, M. Tomassini, M. Giacobini, and W. B. Langdon, The genetic programming collaboration network and its communities, Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK (Hod Lipson et al., ed.), ACM, 2007, pp. 1643--1650.

Digital Library

[13]

P. Merz and B. Freisleben, Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, Parallel Problem Solving from Nature V (A. E. Eiben, T. Back, M. Schoenauer, and H.-P. Schwefel, eds.), Lecture Notes in Computer Science, vol. 1498, Springer-Verlag, 1998, pp. 765--774.

Digital Library

[14]

M. E. J. Newman, The structure and function of complex networks, SIAM Review \textbf45 (2003), 167--256.

[15]

J. L. Payne and M. J. Epstein, Takeover times on scale-free topologies, Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK (Hod Lipson et al., ed.), ACM, 2007, pp. 308--315.

Digital Library

[16]

C. R. Reeves, Landscapes, operators and heuristic search, Annals of Operations Research 86 (1999), 473--490.

[17]

D. L. Stein, Disordered systems: mostly spin glasses, Lectures in the Sciences of Complexity (D. L. Stein, ed.), Addison-Wesley, 1989, pp. 301--353.

[18]

F.H. Stillinger, A topographic view of supercooled liquids and glass formation, Science 267 (1995), 1935--1939.

[19]

M. Tomassini, M. Giacobini, and C. Darabos, Evolution of small-world networks of automata for computation, Parallel Problem Solving from Nature -- PPSN VIII (Birmingham, UK), LNCS, vol. 3242, Springer-Verlag, 2004, pp. 672--681.

[20]

D. J. Watts, The "new" science of networks, Annual Review of Sociology 30 (2004), 243--270.

[21]

D. J. Watts and S. H. Strogatz, Collective dynamics of "small-world" networks, Nature 393 (1998), 440--442.

Cited By

Fieldsend J(2025)Multi-objective Optimisation with Uncertainty: Some Considerations for Wind Farm OptimisationOptimization, Uncertainty and Machine Learning in Wind Energy Conversion Systems10.1007/978-981-97-7909-3_2(25-44)Online publication date: 25-Jan-2025
https://doi.org/10.1007/978-981-97-7909-3_2
Adair JThomson SBrownlee ALi XHandl J(2024)Explaining evolutionary feature selection via local optima networksProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664183(1573-1581)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638530.3664183
Thomson SLe Goff LHart EBuchanan ELi XHandl J(2024)Understanding Fitness Landscapes in Morpho-Evolution via Local Optima NetworksProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3654059(114-123)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3654059
Show More Cited By

Index Terms

A study of NK landscapes' basins and local optima networks

Recommendations

Adaptation of a multiagent evolutionary algorithm to NK landscapes
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Multiagent evolutionary algorithm (MEA) is a relatively new optimization technique, where a life cycle of a population of agents, which perform local search, is simulated. The algorithm was originally intended as a method for solving the graph coloring ...
Maximally rugged NK landscapes contain the highest peaks
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation

NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima regresses to the mean of the landscape with increasing epistasis, k. This ...
Boomerang-shaped neural embeddings for NK landscapes
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference

Understanding the landscape underlying NK models is of fundamental interest. Different representations have been proposed to better understand how the ruggedness of the landscape is influenced by the model parameters, such as the problem dimension, the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation

July 2008

1814 pages

ISBN:9781605581309

DOI:10.1145/1389095

Conference Chair:
Conor Ryan
University of Limerick, Ireland
,
Editor:
Maarten Keijzer
Chordiant Software International B.V., The Netherlands

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO08

Sponsor:

GECCO08: Genetic and Evolutionary Computation Conference

July 12 - 16, 2008

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

142
Total Citations
View Citations
454
Total Downloads

Downloads (Last 12 months)57
Downloads (Last 6 weeks)5

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fieldsend J(2025)Multi-objective Optimisation with Uncertainty: Some Considerations for Wind Farm OptimisationOptimization, Uncertainty and Machine Learning in Wind Energy Conversion Systems10.1007/978-981-97-7909-3_2(25-44)Online publication date: 25-Jan-2025
https://doi.org/10.1007/978-981-97-7909-3_2
Adair JThomson SBrownlee ALi XHandl J(2024)Explaining evolutionary feature selection via local optima networksProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3664183(1573-1581)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638530.3664183
Thomson SLe Goff LHart EBuchanan ELi XHandl J(2024)Understanding Fitness Landscapes in Morpho-Evolution via Local Optima NetworksProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3654059(114-123)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3654059
Tran BLuong NLi XHandl J(2024)On the Investigation of Multimodal Evolutionary Algorithms Using Search Trajectory NetworksProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3654050(32-40)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3654050
Phan QLuong NLi XHandl J(2024)Efficient Multi-Fidelity Neural Architecture Search with Zero-Cost Proxy-Guided Local SearchProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3654027(232-240)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3654027
Tanaka SOchoa GLiefooghe ATakadama KSato HLi XHandl J(2024)Approximating Pareto Local Optimal Solution NetworksProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3653999(603-611)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3653999
Lustosa AMenzies T(2024)Learning from Very Little Data: On the Value of Landscape Analysis for Predicting Software Project HealthACM Transactions on Software Engineering and Methodology10.1145/363025233:3(1-22)Online publication date: 14-Mar-2024
https://dl.acm.org/doi/10.1145/3630252
Du WFang WLiang CTang YJin Y(2024)A Novel Dual-Stage Evolutionary Algorithm for Finding Robust SolutionsIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2024.33697108:5(3589-3602)Online publication date: Oct-2024
https://doi.org/10.1109/TETCI.2024.3369710
Nurcahyadi TBlum C(2024)Enhancing Search Efficiency: Analyzing Learning Mechanisms in Metaheuristics2024 International Conference on Information Technology and Computing (ICITCOM)10.1109/ICITCOM62788.2024.10762200(195-200)Online publication date: 7-Aug-2024
https://doi.org/10.1109/ICITCOM62788.2024.10762200
Richter HThomson S(2024)Information Flow and Laplacian Dynamics on Local Optima Networks2024 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC60901.2024.10612156(01-08)Online publication date: 30-Jun-2024
https://doi.org/10.1109/CEC60901.2024.10612156
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten