Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Problem Solving from Nature

PPSN 2004: Parallel Problem Solving from Nature - PPSN VIII pp 121–130Cite as

Expected Rates of Building Block Discovery, Retention and Combination Under 1-Point and Uniform Crossover

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3242))

Abstract

Choosing the right crossover operator for the problem at hand is a difficult problem. We describe an experiment that shows a surprising result when comparing 1-point and uniform crossover on the Royal Road problem and derive equations for calculating the expected rates of building block discovery, retention and combination. These equations provide an explanation for the surprising results and suggest several directions for future research into hybrid operators.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. Mitchell, M., Forrest, S., Holland, J.H.: The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance. In: Varela, F.J., Bourgine, P. (eds.) Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, pp. 245–254. MIT Press, Cambridge (1992)

    Google Scholar 

  3. Pollack, J.B., Watson, R.A.: RecombinationWithout Respect: Schema Combination and Disruption in Genetic Algorithm Crossover. In: et al, D.W. (ed.) Proc. GECCO 2000, pp. 112–119. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  4. Watson, R.A., Pollack, J.B.: Symbiotic Combination as an Alternative to Sexual Recombination in Genetic Algorithms. In: Schwefel, H.P., Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J. (eds.) Parallel Problem Solving from Nature VI, Springer, Heidelberg (2000)

    Google Scholar 

  5. Spears, W.M.: Crossover or Mutation? In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms, vol. 2, pp. 221–237. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  6. Spears, W.M., Jong, K.A.D.: On the Virtues of Parameterized Uniform Crossover. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230–236. Morgan Kaufman, San Francisco (1991)

    Google Scholar 

  7. Skinner, C.: Selection, Mutation and the Discovery of Lowest-Level Building Blocks. In: Barry, A.M. (ed.) GECCO 2003: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, AAAI, Menlo Park (2003)

    Google Scholar 

  8. Sastry, K., Goldberb, D.E.: Analysis of Mixing in Genetic Algorithms: A Survey. Technical Report 2002012, Illinois Genetic Algorithms Laboratory, IlliGAL (2002)

    Google Scholar 

  9. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Auckland,  

    Cameron Skinner & Patricia Riddle

Authors
  1. Cameron Skinner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patricia Riddle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Xin Yao

  2. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund K. Burke

  3. Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel de Lardizábal 1, 20018, San Sebastian, Donostia, Spain

    José A. Lozano

  4. University of the West of England, Bristol, United Kingdom

    Jim Smith

  5. GeNeura Team, Depto. Arquitectura y Tecnología de Computadores, Universidad de Granada, Spain

    Juan Julián Merelo-Guervós

  6. School of Computer Science, The University of Birmingham, B15 1TT, Edgbaston, Birmingham, UK

    John A. Bullinaria

  7. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, Great Britain

    Jonathan E. Rowe

  8. School of Computer Science, University of Birmingham, United Kingdom

    Peter Tiňo

  9. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Ata Kabán

  10. Faculty of Computer Science, Dortmund University of Technology, 44221, Dortmund, Germany

    Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skinner, C., Riddle, P. (2004). Expected Rates of Building Block Discovery, Retention and Combination Under 1-Point and Uniform Crossover. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30217-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23092-2

  • Online ISBN: 978-3-540-30217-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation