research-article

Understanding elementary landscapes

Authors:

Darrell Whitley,

Andrew M. Sutton,

Adele E. HoweAuthors Info & Claims

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

Pages 585 - 592

https://doi.org/10.1145/1389095.1389208

Published: 12 July 2008 Publication History

Abstract

The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local search on combinatorial optimization problems. A landscape is elementary when it possesses a unique property that results in a relative smoothness and decomposability to its structure. In this paper we explain elementary landscapes in terms of the expected value of solution components which are transformed in the process of moving from an incumbent solution to a neighboring solution. We introduce new results about the properties of elementary landscapes and discuss the practical implications for search algorithms.

References

[1]

L. Barbulescu, A. E. Howe, L. D. Whitley, and M. Roberts. Understanding algorithm performance on an oversubscribed scheduling application. Journal of Artificial Intelligence Research, 27:577--615, Dec 2006.

Digital Library

[2]

J. W. Barnes, B. Dimova, and S. P. Dokov. The theory of elementary landscapes. Applied Mathematics Letters, 16(3):337--343, April 2003.

[3]

L. Barnett. Netcrawling -- optimal evolutionary search with neutral networks. In Proceedings of the 2001 Congress of Evolutionary Computation (CEC2001), pages 30--37, Seoul, Korea, May 2001.

[4]

J. Carlier. Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle/Operations Research, 12:333--351, 1978.

[5]

B. Codenotti and L. Margara. Local properties of some NP-complete problems. Technical Report TR 92--021, International Computer Science Institute, Berkeley, CA, 1992.

[6]

B. Colletti and J. W. Barnes. Linearity in the traveling salesman problem. Applied Mathematics Letters, 13(3):27--32, April 2000.

[7]

B. Dimova, J. Wesley Barnes, and E. Popova. Arbitrary elementary landscapes & ar(1) processes. Appl. Math. Lett., 18(3):287--292, 2005.

[8]

J. Frank, P. Cheeseman, and J. Stutz. When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7:249--281, 1997.

[9]

L. K. Grover. Local search and the local structure of NP-complete problems. Operations Research Letters, 12:235--243, 1992.

Digital Library

[10]

C. M. Reidys and P. F. Stadler. Neutrality in fitness landscapes. Applied Mathematics and Computation, 117:321--350, 2001.

Digital Library

[11]

A. Solomon, J. W. Barnes, S. P. Dokov, and R. Acevedo. Weakly symmetric graphs, elementary landscapes, and the tsp. Appl. Math. Lett., 16(3):401--407, 2003.

[12]

P. F. Stadler. Toward a theory of landscapes. In R. Lopez-Pena, R. Capovilla, R. Garcia-Pelayo, H. Waelbroeck, and F. Zertruche, editors, Complex Systems and Binary Networks, pages 77--163. Springer Verlag, 1995.

[13]

P. F. Stadler. Landscapes and their correlation functions. Journal of Mathematical Chemistry, 20:1--45, 1996.

[14]

P. F. Stadler and G. P. Wagner. Algebraic theory of recombination spaces. Evolutionary Computation, 5(3):241--275, 1997.

Digital Library

[15]

E. Taillard. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operations Research, 47:65--74, 1990.

[16]

S. Wright. The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In Proceedings of the Sixth Congress of Genetics, volume 1, 1932.

Cited By

Elorza AHernando LLozano J(2023)Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier SpaceEvolutionary Computation10.1162/evco_a_0031531:3(163-199)Online publication date: 1-Sep-2023
https://doi.org/10.1162/evco_a_00315
Benavides XCeberio JHernando LLozano JSilva SPaquete L(2023)New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment ProblemProceedings of the Genetic and Evolutionary Computation Conference10.1145/3583131.3590369(239-247)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583131.3590369
Schuster PStadler P(2023)Virus Evolution on Fitness LandscapesViral Fitness and Evolution10.1007/978-3-031-15640-3_1(1-94)Online publication date: 3-Jan-2023
https://doi.org/10.1007/978-3-031-15640-3_1
Show More Cited By

Index Terms

Understanding elementary landscapes
1. Computing methodologies
  1. Artificial intelligence
    1. Control methods
    2. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Dynamic programming

Recommendations

Fitness landscapes and graphs: multimodularity, ruggedness and neutrality
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

One of the most commonly-used metaphors to describe the process of heuristic search methods in solving combinatorial optimization problems is that of a fitness landscape. The landscape metaphor appears most commonly in work related to evolutionary ...
Memetic search for the quadratic assignment problem

We present a memetic algorithm (called BMA) for the well-known QAP.BMA integrates BLS within the population-based evolutionary computing framework.BMA is able to attain the best-known results for 133 out of 135 QAP benchmark instances.We provide ...
Climbing combinatorial fitness landscapes

Graphical abstractDisplay Omitted HighlightsComparison of the behavior of classical basic local search techniques and their ability to reach high local optima in combinatorial fitness landscapes.Two particular aspects of local search are considered: ...

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

33
Total Citations
View Citations
269
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Elorza AHernando LLozano J(2023)Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier SpaceEvolutionary Computation10.1162/evco_a_0031531:3(163-199)Online publication date: 1-Sep-2023
https://doi.org/10.1162/evco_a_00315
Benavides XCeberio JHernando LLozano JSilva SPaquete L(2023)New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment ProblemProceedings of the Genetic and Evolutionary Computation Conference10.1145/3583131.3590369(239-247)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583131.3590369
Schuster PStadler P(2023)Virus Evolution on Fitness LandscapesViral Fitness and Evolution10.1007/978-3-031-15640-3_1(1-94)Online publication date: 3-Jan-2023
https://doi.org/10.1007/978-3-031-15640-3_1
Benavides XCeberio JHernando LKrawiec K(2021)On the symmetry of the quadratic assignment problem through elementary landscape decompositionProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3449726.3463191(1414-1422)Online publication date: 7-Jul-2021
https://dl.acm.org/doi/10.1145/3449726.3463191
Tari SOchoa GKrawiec K(2021)Local search pivoting rules and the landscape global structureProceedings of the Genetic and Evolutionary Computation Conference10.1145/3449639.3459295(278-286)Online publication date: 26-Jun-2021
https://dl.acm.org/doi/10.1145/3449639.3459295
Kaji T(2021)A probabilistic analysis of neighborhoods for combinatorial optimization problems and its applicationJournal of Heuristics10.1007/s10732-021-09484-y27:6(1057-1079)Online publication date: 11-Aug-2021
https://doi.org/10.1007/s10732-021-09484-y
Alyahya KRowe J(2019)Landscape Analysis of a Class of NP-Hard Binary Packing ProblemsEvolutionary Computation10.1162/evco_a_0023727:1(47-73)Online publication date: Mar-2019
https://doi.org/10.1162/evco_a_00237
Ceberio JCalvo BMendiburu ALozano J(2019)Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape DecompositionsEvolutionary Computation10.1162/evco_a_0021927:2(291-311)Online publication date: Jun-2019
https://doi.org/10.1162/evco_a_00219
Hordijk WKauffman SStadler P(2019)Average Fitness Differences on NK LandscapesTheory in Biosciences10.1007/s12064-019-00296-0Online publication date: 18-Jun-2019
https://doi.org/10.1007/s12064-019-00296-0
Beham AWagner SAffenzeller MTakadama K(2018)Algorithm selection on generalized quadratic assignment problem landscapesProceedings of the Genetic and Evolutionary Computation Conference10.1145/3205455.3205585(253-260)Online publication date: 2-Jul-2018
https://dl.acm.org/doi/10.1145/3205455.3205585
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