Skip to main content

Tailoring mutation to landscape properties

  • Conference paper
  • First Online:
Evolutionary Programming VII (EP 1998)

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

Included in the following conference series:

Abstract

We present numerical results on Kauffman's NK landscape family indicating that the optimal distance at which to search for fitter variants depends on both the current fitness and the sampling that can be afforded at each distance. The optimal search distance from average fitness configurations is large to escape local correlation limits and decreases as fitness increases. An analytic derivation of the optimal search distance as a function the landscape correlation ρ, the current fitness f μ, and the number of samples n is determined by introducing a new landscape family — ρ-landscapes. The utility of ρ-landscapes is demonstrated by determining a few of their simple properties.

I thank both Bios Group L.P. and the Santa Fe Institute for support.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bergman, S. P. Otto, and M. W. Feldman. On the evolution of recombination in haploids and diploids i. deterministic models. Complexity, 1:57–67, 1995.

    Google Scholar 

  2. A. Bergman, S. P. Otto, and M. W. Feldman. On the evolution of recombination in haploids and diploids ii. stochastic models. Complexity, 2:49–57, 1995.

    Google Scholar 

  3. B. Derrida. The random energy model. Phys. Rep., 67:29–35, 1980.

    Google Scholar 

  4. B. Derrida. Random energy model: Limit of a family of disordered models. Phys. Rev. Lett., 45:79–82, 1980.

    Google Scholar 

  5. K. H. Fischer and J. A. Hertz. Spin Glasses. Cambridge University Press, 1991.

    Google Scholar 

  6. S. A. Kauffman. The Origin of Order. Oxford University Press, New York, Oxford, 1993.

    Google Scholar 

  7. S. A. Kauffman, J. Lobo, and W. G. Macready. Optimal search on a technology landscape. In review at Econometrica, 1998.

    Google Scholar 

  8. S. A. Kauffman and E. D. Weinberger. The nk model of rugged fitness landscapes and its application to maturation of the immune response. J. Theor. Biol., 141:211, 1989.

    Google Scholar 

  9. W. G. Macready. An annealed theory of landscapes: part 1. In preparation, 1998.

    Google Scholar 

  10. W. G. Macready. An annealed theory of landscapes: part 2. In preparation, 1998.

    Google Scholar 

  11. C. A. Macken and A. S. Perelson. Protein evolution on rugged landscapes. Proc. Natl. Acad. Sci. USA, 86:6191–6195, 1989.

    Google Scholar 

  12. M. Mézard, G. Parisi, and M.A. Virasoro. Spin Glass Theory and Beyond. World Scientific, Singapore, 1987.

    Google Scholar 

  13. W. G. Macready and D. H. Wolpert. What makes an optimization problem? Complexity, 5:40–46, 1996.

    Google Scholar 

  14. P. F. Stadler. Towards a theory of landscapes. In R. Lopéz-Peña, R. Capovilla, R. García-Pelayo, H Waelbroeck, and F. Zertuche, editors, Complex systems and binary networks. Springer Verlag, Berlin, 1995.

    Google Scholar 

  15. E. D. Weinberger. Np completeness of kauffman's nk model, a tuneable rugged fitness landscape. Santa Fe Institute technical report SFI-96-02-003, 1996.

    Google Scholar 

  16. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Trans. Evol. Comp., 1:67–83, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Macready, W.G. (1998). Tailoring mutation to landscape properties. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040788

Download citation

  • DOI: https://doi.org/10.1007/BFb0040788

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64891-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics