Skip to main content
SpringerLink
Log in

Saddles and Barrier in Landscapes of Generalized Search Operators

  • Conference paper
Book cover 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

Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes defined over general multi-parent search operators based on a suitable notion of topological connectedness that depends explicitly on the search operator. We show that in the case of recombination spaces, path-connectedness coincides with connectedness as defined by the mutation operator alone. In contrast, topological connectedness is more general and depends on the details of the recombination operators as well. Barrier trees can be meaningfully defined for both concepts of connectedness.

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

Access this chapter

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 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. Klotz, T., Kobe, S.: Valley Structures in the phase space of a finite 3D Ising spin glass with ±i interactions. J. Phys. A: Math. Gen. 27, L95–L100 (1994)

    Article  MathSciNet  Google Scholar 

  2. Garstecki, P., Hoang, T.X., Cieplak, M.: Energy landscapes, supergraphs, and folding funnels in spin systems. Phys. Rev. E 60, 3219–3226 (1999)

    Article  Google Scholar 

  3. Doye, J.P., Miller, M.A., Welsh, D.J.: Evolution of the potential energy surface with size for Lennard-Jones clusters. J. Chem. Phys. 111, 8417–8429 (1999)

    Article  Google Scholar 

  4. Flamm, C., Fontana, W., Hofacker, I., Schuster, P.: RNA folding kinetics at elementary step resolution. RNA 6, 325–338 (2000)

    Article  Google Scholar 

  5. Flamm, C., Hofacker, I.L., Stadler, P.F., Wolfinger, M.T.: Barrier trees of degenerate landscapes. Z. Phys. Chem. 216, 155–173 (2002)

    Google Scholar 

  6. Stadler, P.F., Flamm, C.: Barrier trees on poset-valued landscapes. Genetic Prog. Evolv. Mach. 4, 7–20 (2003)

    Article  MATH  Google Scholar 

  7. Hallam, J., Prügel-Bennett, A.: Barrier trees for search analysis. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1586–1587. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Hallam, J., Prügel-Bennett, A.: Large barrier trees for studying search. IEEE Trans. Evol. Comput. 9, 385–397 (2005)

    Article  Google Scholar 

  9. Stadler, B.M.R., Stadler, P.F., Shpak, M., Wagner, G.P.: Recombination spaces, metrics, and pretopologies. Z. Phys. Chem. 216, 217–234 (2002)

    Google Scholar 

  10. Stadler, B.M.R., Stadler, P.F.: Generalized topological spaces in evolutionary theory and combinatorial chemistry. J.Chem. Inf. Comput. Sci. 42, 577–585 (2002) Proceedings MCC 2001, Dubrovnik

    Article  Google Scholar 

  11. Benkö, G., Centler, F., Dittrich, P., Flamm, C., Stadler, B.M.R., Stadler, P.F.: A topological approach to chemical organizations. Alife 2006 (submitted)

    Google Scholar 

  12. Stadler, P.F., Stadler, B.M.R.: The genotype-phenotype map. Biological Theory 3, 268–279 (2006)

    Article  Google Scholar 

  13. Azencott, R.: Simulated Annealing. John Wiley & Sons, New York (1992)

    MATH  Google Scholar 

  14. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester, NY (2001)

    MATH  Google Scholar 

  15. Maynard-Smith, J.: Natural selection and the concept of a protein space. Nature 225, 563–564 (1970)

    Article  Google Scholar 

  16. Eigen, M., Schuster, P.: The Hypercycle. Springer, Heidelberg (1979)

    Google Scholar 

  17. Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review 44, 3–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  18. Gitchoff, P., Wagner, G.P.: Recombination induced hypergraphs: a new approach to mutation-recombination isomorphism. Complexity 2, 37–43 (1996)

    Article  MathSciNet  Google Scholar 

  19. Shpak, M., Wagner, G.P.: Asymmetry of configuration space induced by unequal crossover: implications for a mathematical theory of evolutionary innovation. Artificial Life 6, 25–43 (2000)

    Article  Google Scholar 

  20. Changat, M., Klavžar, S., Mulder, H.M.: The all-path transit function of a graph. Czech. Math. J. 51, 439–448 (2001)

    Article  MATH  Google Scholar 

  21. Stadler, P.F., Wagner, G.P.: The algebraic theory of recombination spaces. Evol. Comp. 5, 241–275 (1998)

    Article  Google Scholar 

  22. Stadler, P.F., Seitz, R., Wagner, G.P.: Evolvability of complex characters: Population dependent Fourier decomposition of fitness landscapes over recombination spaces. Bull. Math. Biol. 62, 399–428 (2000)

    Article  Google Scholar 

  23. Antonisse, J.: A new interpretation of schema notation the overturns the binary encoding constraint. In: Proceedings of the Third International Conference of Genetic Algorithms, pp. 86–97. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  24. Imrich, W., Klavžar, S.: Product Graphs: Structure and Recognition. Wiley, New York (2000)

    Google Scholar 

  25. Kuratowski, C.: Sur la notion de limite topologique d’ensembles. Ann. Soc. Polon. Math. 21, 219–225 (1949)

    MATH  MathSciNet  Google Scholar 

  26. Imrich, W., Stadler, P.F.: A prime factor theorem for a generalized direct product. Discussiones Math. Graph Th. 26, 135–140 (2006)

    MATH  MathSciNet  Google Scholar 

  27. Mitavskiy, B.: Crossover invariant subsets of the search space for evolutionary algorithms. Evol. Comp. 12, 19–46 (2004)

    Article  Google Scholar 

  28. Čech, E.: Topological Spaces. Wiley, London (1966)

    MATH  Google Scholar 

  29. Hammer, P.C.: General topoloy, symmetry, and convexity. Trans. Wisconsin Acad. Sci. Arts, Letters 44, 221–255 (1955)

    MathSciNet  Google Scholar 

  30. Hammer, P.C.: Extended topology: Set-valued set functions. Nieuw Arch. Wisk. III 10, 55–77 (1962)

    MATH  MathSciNet  Google Scholar 

  31. Day, M.M.: Convergence, closure, and neighborhoods. Duke Math. J. 11, 181–199 (1944)

    Article  MATH  MathSciNet  Google Scholar 

  32. Brissaud, M.M.: Les espaces prétopologiques. C. R. Acad. Sc. Paris Ser. A 280, 705–708 (1975)

    MATH  MathSciNet  Google Scholar 

  33. Gniłka, S.: On extended topologies. I: Closure operators. Ann. Soc. Math. Pol. Ser. I, Commentat. Math. 34, 81–94 (1994)

    MATH  Google Scholar 

  34. Stadler, B.M.R., Stadler, P.F.: The topology of evolutionary biology. In: Ciobanu (ed.) Modeling in Molecular Biology. Natural Computing Series, pp. 267–286. Springer, Heidelberg (2004)

    Google Scholar 

  35. Hammer, P.C.: Extended topology: Continuity I. Portug. Math. 25, 77–93 (1964)

    MathSciNet  Google Scholar 

  36. Gniłka, S.: On continuity in extended topologies. Ann. Soc. Math. Pol. Ser. I, Commentat. Math. 37, 99–108 (1997)

    MATH  Google Scholar 

  37. Wallace, A.D.: Separation spaces. Ann. Math, 687–697 (1941)

    Google Scholar 

  38. Hammer, P.C.: Extended topology: Connected sets and Wallace separations. Portug. Math. 22, 77–93 (1963)

    MathSciNet  Google Scholar 

  39. Harris, J.M.: Continuity and separation for point-wise symmetric isotonic closure functions. Technical Report 0507230, arXiv:math.GN (2005)

    Google Scholar 

  40. Habil, E.D., Elzenati, K.A.: Connectedness in isotonic spaces. Turk. J. Math 30, 247–262 (2006)

    MATH  MathSciNet  Google Scholar 

  41. Stadler, B.M.R., Stadler, P.F., Wagner, G., Fontana, W.: The topology of the possible: Formal spaces underlying patterns of evolutionary change. J. Theor. Biol. 213, 241–274 (2001)

    Article  MathSciNet  Google Scholar 

  42. Catoni, O.: Rough large deviation estimates for simulated annealing: Application to exponential schedules. Ann. Probab. 20, 1109–1146 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  43. Catoni, O.: Simulated annealing algorithms and Markov chains with rate transitions. In: Azema, J., Emery, M., Ledoux, M., Yor, M. (eds.) Seminaire de Probabilites XXXIII. Lecture Notes in Mathematics, vol. 709, pp. 69–119. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  44. Becker, O.M., Karplus, M.: The topology of multidimensional potential energy surfaces: Theory and application to peptide structure and kinetics. J. Chem. Phys. 106, 1495–1517 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Chemistry University of Vienna, Währingerstraße 17, A-1090 Wien, Austria

    Christoph Flamm, Ivo L. Hofacker & Peter F. Stadler

  2. Max Planck Institute for Mathematics in the Sciences, Inselstrasse 22-26, D-04103 Leipzig, Germany

    Bärbel M. R. Stadler

  3. Bioinformatics Group, Department of Computer Science, and, Interdisciplinary Center for Bioinformatics (IZBI), University of Leipzig, Härtelstraße 16-18, D-04107 Leipzig, Germany

    Peter F. Stadler

  4. Santa Fe Institute, 1399 Hyde Park Rd., Santa Fe, NM 87501, USA

    Peter F. Stadler

Authors
  1. Christoph Flamm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivo L. Hofacker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bärbel M. R. Stadler
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter F. Stadler
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Flamm, C., Hofacker, I.L., Stadler, B.M.R., Stadler, P.F. (2007). Saddles and Barrier in Landscapes of Generalized Search 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_11

Download citation

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

  • 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

Search

Navigation