Skip to main content

Neighborhood Graphs and Symmetric Genetic Operators

  • Conference paper
Foundations of Genetic Algorithms (FOGA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4436))

Included in the following conference series:

Abstract

In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterized by formulas defining them in terms of the search space and its group operation. This provides a representation-free implementation for those operators, in the sense that the genotypic encoding of search space elements is irrelevant. The implementations are parameterized by distributions which may be chosen arbitrarily, and which are analogous to specifying distributions for mutation and crossover masks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biggs, N.L.: Finite groups of automorphisms. Cambridge University Press, Cambridge, UK (1971)

    MATH  Google Scholar 

  2. Rockmore, D., Hordijk, W., Kostelec, P., Stadler, P.: Fast fourier transforms for fitness landscapes. Applied and Computational Harmonic Analysis 12(1), 57–76 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Rowe, J.E., Vose, M.D., Wright, A.H.: Group properties of crossover and mutation. Evolutionary Computation 10, 151–184 (2002)

    Article  Google Scholar 

  4. Rowe, J.E., Vose, M.D., Wright, A.H.: Structural search spaces and genetic operators. Evolutionary Computation 12, 461–494 (2004)

    Article  Google Scholar 

  5. Rowe, J.E., Vose, M.D., Wright, A.H.: Coarse graining selection and mutation. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol. 3469, pp. 176–191. Springer, Heidelberg (2005)

    Google Scholar 

  6. Rowe, J.E., Vose, M.D., Wright, A.H.: Differentiable coarse graining. Theoretical Computer Science 361, 111–129 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Stadler, P.F.: Landscapes and their correlation functions. Journal of Mathematical Chemistry 20(1), 1–45 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Vose, M.D.: Random heuristic search. Theoretical Computer Science 229, 103–142 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA (1999)

    MATH  Google Scholar 

  10. Weinberger, E.D.: Fourier and taylor series on fitness landscapes. Biological Cybernetics 65(5), 321–330 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christopher R. Stephens Marc Toussaint Darrell Whitley Peter F. Stadler

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rowe, J.E., Vose, M.D., Wright, A.H. (2007). Neighborhood Graphs and Symmetric Genetic Operators. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds) Foundations of Genetic Algorithms. FOGA 2007. Lecture Notes in Computer Science, vol 4436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73482-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73482-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73479-6

  • Online ISBN: 978-3-540-73482-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics