Skip to main content

The Creativity Potential Within Evolutionary Algorithms

  • Conference paper
  • 1193 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4648))

Abstract

The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order schemata in high-quality strings, in a strongly parallel manner. Historically, attempts to capture the topological fitness landscape features which exemplify this intuitively straight-forward process, have been mostly unsuccessful. Population-based recombinative methods had been repeatedly outperformed on the special designed abstract test suites, by different variants of mutation-based algorithms. Departing from the BBH, in this paper we seek to exemplify the utility of crossover from a different point of view, emphasizing the creative potential of the crossover operator. We design a special class of abstract test suites, called Trident functions, which exploits the ability of modern GAs to mix good but significantly different solutions. This approach has been so far neglected as it is widely believed that disruption caused by mating individuals that are too dissimilar may be harmful. We anticipate that hybridizing different designs induces a complex neighborhood structure unattainable by trajectory-based methods which can conceal novel solutions. Empirical results confirm that the proposed class of problems can be solved efficiently only by population-based panmictic recombinative methods, employing diversity maintaining mechanisms.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sastry, K., Goldberg, D.E.: Let’s get ready to rumble: Crossover versus mutation head to head. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 126–137. Springer, Heidelberg (2004)

    Google Scholar 

  2. Holland, J.H.: Adaptation in natural artificial systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

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

    MATH  Google Scholar 

  4. Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of Third International Conference on Genetic Algorithms (1989)

    Google Scholar 

  5. Chen, S.: Is the Common Good? A New Perspective Developed in Genetic Algorithms. PhD thesis, Robotics Institute, Carnegie Mellon University (1999)

    Google Scholar 

  6. Starkweather, T., Mathias, K., Whitley, D.: Optimization using distributed genetic algorithms. In: Proceedings of the First International Conference on Parallel Problem Solving from Nature, pp. 176–186. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  7. Forrest, S., Mitchell, M.: What makes a problem hard for a genetic algorithm? some anomalous results and their explanation. MACHLEARN: Machine Learning 13 (1993)

    Google Scholar 

  8. Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, NM (1995)

    Google Scholar 

  9. Jansen, T., Wegener, I.: The analysis of evolutionary algorithms – A proof that crossover really can help. Algorithmica 34, 47–66 (2002)

    Article  MATH  Google Scholar 

  10. Watson, R.A., Hornby, G., Pollack, J.B.: Modeling building-block interdependency. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN V. LNCS, vol. 1498, pp. 97–108. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Spector, L., et al. (eds.) GECCO ’01: pp. 511–518. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  12. Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Norwell (2001)

    Google Scholar 

  13. Iclanzan, D., Dumitrescu, D.: Overcoming Hierarchical Difficulty by Hill-Climbing the Building Block Structure. In: GECCO ’07: Proc. of the Genetic and Evolutionary Computation Conference, July (accepted, 2007)

    Google Scholar 

  14. Pelikan, M.: Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  15. Watson, J.-P., Beck, J.C., Howe, A.E., Whitley, L.D.: Problem difficulty for tabu search in job-shop scheduling. AIJ: Artificial Intelligence 143 (2003)

    Google Scholar 

  16. Mahfoud, S.W.: Niching methods for genetic algorithms. PhD thesis, Dept. General Engineering, University of Illinois, Urbana, Illinois (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Fernando Almeida e Costa Luis Mateus Rocha Ernesto Costa Inman Harvey António Coutinho

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iclănzan, D. (2007). The Creativity Potential Within Evolutionary Algorithms. In: Almeida e Costa, F., Rocha, L.M., Costa, E., Harvey, I., Coutinho, A. (eds) Advances in Artificial Life. ECAL 2007. Lecture Notes in Computer Science(), vol 4648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74913-4_85

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74913-4_85

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74912-7

  • Online ISBN: 978-3-540-74913-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics