Article

A building-block royal road where crossover is provably essential

Authors:

Richard A. Watson,

Thomas JansenAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

Pages 1452 - 1459

https://doi.org/10.1145/1276958.1277224

Published: 07 July 2007 Publication History

Abstract

One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it has been suggested that crossover in GAs can assemble short low-order schemata of above average fitness (building blocks) to create higher-order higher-fitness schemata. However, there has been considerable difficulty in demonstrating this rigorously and intuitively. Here we provide a simple building-block function that a GA with two-point crossover can solve on average in polynomial time, whereas an asexual population or mutation hill-climber cannot.

References

[1]

J. C. Culberson, "Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions", Evolutionary Computation 2, 279 (1995).

Digital Library

[2]

K. Deb, D. E. Goldberg. "Analyzing Deception in Trap Functions", in D. Whitley, Ed. Foundations of Genetic Algorithms 2, (Morgan Kaufmann, San Mateo, CA, 1992) pp. 93--108.

[3]

K. Deb, D. E. Goldberg, "Sufficient Conditions for Deceptive and Easy Binary Functions", Annals of Mathematics and Artificial Intelligence 10, 385 (1992).

[4]

M. Dietzfelbinger, B. Naudts, C. van Hoyweghen, I. Wegener, "The analysis of a recombinative hill-climber on H IFF", IEEE-Trans. on Evolutionary Computation 7, 417 (2002).

Digital Library

[5]

S. Droste, T. Jansen, I. Wegener, "On the analysis of the (1+1) evolutionary algorithm", Theoretical Computer Science, 276, 51. (2002)

Digital Library

[6]

S. Forrest, M. Mitchell, "Relative Building-block fitness and the Building-block Hypothesis", in D. Whitley, Ed., Foundations of Genetic Algorithms 2, (Morgan Kaufmann, San Mateo, CA, 1993), pp. 109--126.

[7]

S. Forrest, M. Mitchell, "What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation", Machine Learning 13(2), 285 (1993).

[8]

D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading, MA, 1989).

Digital Library

[9]

G. Harik, D. E. Goldberg, "Learning Linkage", in R. K. Belew, M. D. Vose, Eds. Foundations of Genetic Algorithms 4 (Morgan Kaufmann, San Francisco, 1997), pp. 247--262.

[10]

J. H. Holland, Adaptation in Natural and Artificial Systems (Ann Arbor, MI: Univ. Michigan Press, 1975).

Digital Library

[11]

J. H. Holland, "Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions", Evolutionary Computation 8, 373 (2000).

Digital Library

[12]

C. Igel, M. Toussaint, "A no-free-lunch theorem for non-uniform distributions of target functions", Journal of Mathematical Modeling and Algorithms, 3(4), 313 (2004).

[13]

T. Jansen, I. Wegener, "Real royal road functions -- where crossover provably is essential", Discrete Applied Mathematics 149, 111 (2005).

Digital Library

[14]

T. Jones, Evolutionary Algorithms, Fitness Landscapes and Search, PhD dissertation, 95-05-048, University of New Mexico, Albuquerque (1995).

[15]

S. Kauffman, S. Levin, "Towards a general theory of adaptive walks on rugged landscapes", J. Theor. Biol. 128, 11 (1987).

[16]

V. Kvasnicka, "An Evolutionary Model of Symbiosis", Studies in Fuzziness and Soft Computing, 54, 293 (2000).

[17]

M. Mitchell, S. Forrest, J. H. Holland, "The royal road for genetic algorithms: Fitness landscapes and GA performance", in F. J. Varela, P. Bourgine Eds., Procs. of first European Conference on Artificial Life, (MIT Press, Cambridge, MA, 1992) pp. 245--254.

[18]

R. Motwani, P. Raghavan. Randomized Algorithms. (Cambridge Univ. Press, 1995).

Digital Library

[19]

M. Pelikan, Bayesian Optimization Algorithm: From Single Level to Hierarchy, Ph.D. Dissertation, Dept. of Computer Science at the University of Illinois at Urbana-Champaign (2002).

Digital Library

[20]

M. A. Potter, K. A. De Jong, "Cooperative Co-evolution: An Architecture for Evolving Coadapted Subcomponents", Evolutionary Computation, 8(1), 1 (2000).

Digital Library

[21]

A. Rogers, A. Prügel-Bennett, "A Solvable Model of a Hard Optimisation Problem", in L. Kallel, B.Naudts, A.Rogers, Eds. Procs. of Theoretical Aspects of Evolutionary Computing (Springer, Berlin, 2001), pp. 207--221.

Digital Library

[22]

J.L. Shapiro, A. Prügel-Bennett, "Genetic algorithm dynamics in two-well potentials with basins and barrier", in Foundations of Genetic Algorithms 4, R. K. Belew, M. D. Vose, Eds. (Morgan Kaufmann, San Francisco, 1997), pp. 101--116.

[23]

W. M. Spears, "Crossover or Mutation?", in D. Whitley, Ed. Foundations of Genetic Algorithms 2, (Morgan Kaufmann, San Mateo, CA, 1992), pp. 221--237.

[24]

M. D. Vose, G. E. Liepins,. "Schema disruption", in Procs. of the Fourth International Conference on Genetic Algorithms, (Morgan Kaufmann: San Mateo, 1991), pp. 237--243.

[25]

M. D. Vose, A. H. Wright, "The Simple Genetic Algorithm and the Walsh Transform: part I, Theory", Evolutionary Computation, 6(3), 253 (1998).

Digital Library

[26]

R. A. Watson, "A Simple Two-Module Problem to Exemplify Building-Block Assembly Under Crossover", in X. Yao et al. Eds. Parallel Problem Solving from Nature -- PPSN VIII, (Springer, Berlin, 2004), pp. 161--171.

[27]

R. A. Watson, "Analysis of Recombinative Algorithms on a Non-Separable Building-Block Problem", in W.N. Martin, W.M. Spears, Eds. Foundation of Genetic Algorithms 6, (Morgan Kaufmann, San Francisco, 2001) pp. 69--89.

[28]

R. A. Watson, "On the Unit of Selection in Sexual Populations", in Advances in Artificial Life, Eighth European Conference (ECAL 2005) (Springer, Berlin, 2005), pp. 895--905.

Digital Library

[29]

R. A. Watson, D. Weinreich, J. Wakeley, "Sex avoids intragenic local optima that trap asexuals", in prep.

[30]

J. B. Wolf, E. D. Brodie III, M. J. Wade, Epistasis and the Evolutionary Process. (Oxford University Press: New York, 2000).

Cited By

Hough KBell JRoychoudhury APaiva AAbreu RStorey M(2024)Crossover in Parametric FuzzingProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639160(1-12)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639160
Aboutaib BSutton A(2023)The Influence of Noise on Multi-parent Crossover for an Island Model Genetic AlgorithmACM Transactions on Evolutionary Learning and Optimization10.1145/36306384:2(1-28)Online publication date: 9-Nov-2023
https://dl.acm.org/doi/10.1145/3630638
Friedrich TKötzing TRadhakrishnan ASchiller LSchirneck MTennigkeit GWietheger S(2023)Crossover for Cardinality Constrained OptimizationACM Transactions on Evolutionary Learning and Optimization10.1145/36036293:2(1-32)Online publication date: 9-Jun-2023
https://dl.acm.org/doi/10.1145/3603629
Show More Cited By

Index Terms

A building-block royal road where crossover is provably essential
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction

Recommendations

Crossover speeds up building-block assembly
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

We re-investigate a fundamental question: how effective is crossover in combining building blocks? Although this has been discussed controversially for decades, we are still lacking a rigorous and intuitive answer. We provide such answers for royal road ...
Real royal road functions-where crossover provably is essential
Special issue: Boolean and pseudo-boolean funtions

Mutation and crossover are the main search operators of different variants of evolutionary algorithms. Despite the many discussions on the importance of crossover nobody has proved rigorously for some explicitly defined fitness functions f"n:{0,1}^n->R ...
A parameter-less genetic algorithm with customized crossover and mutation operators
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation

Genetic algorithm is one of the well-known population based meta-heuristics. The reasonable performance of the algorithm on a wide variety of problems as well as its simplicity made this algorithm a first choice in lots of cases. However, the algorithm ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

July 2007

2313 pages

ISBN:9781595936974

DOI:10.1145/1276958

General Chair:
Hod Lipson
Cornell University, USA

Copyright © 2007 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: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, England

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
387
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)9

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hough KBell JRoychoudhury APaiva AAbreu RStorey M(2024)Crossover in Parametric FuzzingProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639160(1-12)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639160
Aboutaib BSutton A(2023)The Influence of Noise on Multi-parent Crossover for an Island Model Genetic AlgorithmACM Transactions on Evolutionary Learning and Optimization10.1145/36306384:2(1-28)Online publication date: 9-Nov-2023
https://dl.acm.org/doi/10.1145/3630638
Friedrich TKötzing TRadhakrishnan ASchiller LSchirneck MTennigkeit GWietheger S(2023)Crossover for Cardinality Constrained OptimizationACM Transactions on Evolutionary Learning and Optimization10.1145/36036293:2(1-32)Online publication date: 9-Jun-2023
https://dl.acm.org/doi/10.1145/3603629
Scott EDe Jong K(2023)First Complexity Results for Evolutionary Knowledge TransferProceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms10.1145/3594805.3607137(140-151)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3594805.3607137
Spirov AMyasnikova E(2023)Problem of Domain/Building Block Preservation in the Evolution of Biological Macromolecules and Evolutionary ComputationIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2022.317590820:2(1345-1362)Online publication date: 1-Mar-2023
https://doi.org/10.1109/TCBB.2022.3175908
Yuan HNi CWang HZhang XCong LSzepesvári CWang MKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Bandit theory and thompson sampling-guided directed evolution for sequence optimizationProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3603044(38291-38304)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3603044
Aboutaib BSutton AWagner M(2022)The influence of noise on multi-parent crossover for an island model GAProceedings of the Genetic and Evolutionary Computation Conference10.1145/3512290.3528854(666-674)Online publication date: 8-Jul-2022
https://dl.acm.org/doi/10.1145/3512290.3528854
Meyerson EQiu XMiikkulainen RWagner M(2022)Simple genetic operators are universal approximators of probability distributions (and other advantages of expressive encodings)Proceedings of the Genetic and Evolutionary Computation Conference10.1145/3512290.3528746(739-748)Online publication date: 8-Jul-2022
https://dl.acm.org/doi/10.1145/3512290.3528746
Friedrich TKötzing TRadhakrishnan ASchiller LSchirneck MTennigkeit GWietheger SWagner M(2022)Crossover for cardinality constrained optimizationProceedings of the Genetic and Evolutionary Computation Conference10.1145/3512290.3528713(1399-1407)Online publication date: 8-Jul-2022
https://dl.acm.org/doi/10.1145/3512290.3528713
Olsthoorn MDwyer M(2022)More effective test case generation with multiple tribes of AIProceedings of the ACM/IEEE 44th International Conference on Software Engineering: Companion Proceedings10.1145/3510454.3517066(286-290)Online publication date: 21-May-2022
https://dl.acm.org/doi/10.1145/3510454.3517066
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