Basic Concepts of Evolutionary Algorithms

  • Alex A. Freitas
Chapter
Part of the Natural Computing Series book series (NCS)

Abstract

This chapter discusses some basic concepts and principles of Evolutionary Algorithms (EAs), focusing mainly on Genetic Algorithms (GAs) and Genetic Programming (GP). The main goal of this chapter is to help the reader who is not familiar with these kinds of algorithm to better understand the next chapters of this book.

Keywords

Evolutionary Algorithm Genetic Programming Evolutionary Computation Crossover Operator Genetic Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Angeline 1997]
    P.J. Angeline. Subtree crossover: building block engine or macromutation? Genetic Programming 1997: Proceedings of the 2nd Annual Genetic Programming Conference, 9–17. Morgan Kaufmann, 1997.Google Scholar
  2. [Angeline 1998]
    P.J. Angeline. Subtree crossover causes bloat. Genetic Programming 1998: Proceedings of the 3rd Annual Genetic Programming Con-ference, 745–752. Morgan Kaufmann, 1998.Google Scholar
  3. [Back 2000a]
    T. Back. Introduction to Evolutionary Algorithms. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 59–63. Institute of Physics Publishing, 2000.CrossRefGoogle Scholar
  4. [Back 2000b]
    T. Back. Binary strings. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 132–135. Institute of Physics Publishing, 2000.CrossRefGoogle Scholar
  5. [Back et al. 2000]
    T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, 2000.Google Scholar
  6. [Banzhaf et al. 1998]
    W. Banzhaf, P. Nordin, R.E. Keller, and F.D. Francone. Genetic Programming — an Introduction: On the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann, 1998.Google Scholar
  7. [Buckle 2000]
    T. Blickle. Tournament selection. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 181–186. Institute of Physics Publishing, 2000.Google Scholar
  8. [Booker 1991]
    L.B. Booker. Recombination distributions for genetic algorithms. In: D. Whitley (Ed.) Foundations of Genetic Algorithms 2, 29–44. Morgan Kaufmann, 1993.Google Scholar
  9. [Cavaretta and Chellapilla 1999]
    M.J. Cavaretta and K. Chellapilla. Data mining using genetic programming: the implications of parsimony on generalization error. Proceedings of the 1999 Congress on Evolutionary Computation (CEC ‘99), 1330–1337. IEEE Press, 1999.Google Scholar
  10. [Chen and Smith 1999]
    S. Chen and S.F. Smith. Introducing a new advantage of crossover: commonality-based selection. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ‘99), 122–128. Morgan Kaufmann, 1999.Google Scholar
  11. [Date 2000]
    C.J. Date. An Introduction to Database Systems, 7th edn. Addison-Wesley, 2000.Google Scholar
  12. [Davis 1991]
    L. Davis (Ed.) Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.Google Scholar
  13. [Deb 2000]
    K. Deb. Introduction to selection. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 166–171. Institute of Physics Publishing, 2000.Google Scholar
  14. Deb and Goldberg 1989] K. Deb and D.E. Goldberg. An investigation of niche and species formation in genetic function optimization. Proceedings of the 2nd International Conference Genetic Algorithms (ICGA ‘89), 42–49.Google Scholar
  15. [De Jong 2000]
    K. De Jong. Evolutionary computation: an unified overview. 2000 Genetic and Evolutionary Computation Conference Tutorial Program, 471–479. Las Vegas, NV, USA, 2000.Google Scholar
  16. [De Jong et al. 2000]
    K. De Jong, D.B. Fogel and H.-P. Schwefel. A history of evolutionary computation. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 40–58. Institute of Physics Publishing, 2000.Google Scholar
  17. [D’haeseleer 1994]
    P. D’haeseleer. Context preserving crossover in genetic programming. Proceedings of the 1994 IEEE World Congress on Computational Intelligence, 256–261. IEEE Press, 1994.Google Scholar
  18. [Eshelman et al. 1989]
    L.J. Eshelman; R.A. Caruana and J.D. Schaffer. Biases in the crossover landscape. Proceedings of the 2nd International Conference Genetic Algorithms (ICGA ‘89), 10–19. 1989.Google Scholar
  19. [Eshelman et al. 1997]
    L.J. Eshelman, K.E. Mathias and J.D. Schaffer. Crossover operator biases: exploiting the population distribution. Proceedings of the 7th International Conference on Genetic Algorithms (ICGA ‘97), 354–361. Morgan Kaufmann, 1997.Google Scholar
  20. [Evett and Fernandez 1998]
    M. Evett and T. Fernandez. Numeric mutation improves the discovery of numeric constants in genetic programming. Genetic Programming 1998: Proceedings of the 3rd Annual Conference (GP ‘98), 66–71. Morgan Kaufmann, 1998.Google Scholar
  21. [Falkenauer 1999]
    E. Falkenauer. The worth of the uniform. Proceedings of the Congress on Evolutionary Computation (CEC ‘99), 776–782. IEEE, 1999.Google Scholar
  22. [Fogel 2000]
    D.B. Fogel. Real-valued vectors (in Mutation Operators chapter). In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 239–243. Institute of Physics Publishing, 2000.Google Scholar
  23. [Freitas 1997]
    A.A. Freitas. A genetic programming framework for two data mining tasks: classification and generalized rule induction. Genetic Programming 1997: Proceedings of the 2nd Annual Conference (GP ‘97), 96–101. Morgan Kaufmann, 1997.Google Scholar
  24. [Fuchs 1998]
    M. Fuchs. Crossover versus mutation: an empirical and theoretical case study. Genetic Programming 1998: Proceedings of the 3rd Annual Conference (GP ‘98), 78–85. Morgan Kaufmann, 1998.Google Scholar
  25. [Goldberg 1989]
    D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.Google Scholar
  26. [Goldberg and Richardson 1987]
    D.E. Goldberg and J. Richardson. Genetic algorithms with sharing for multimodal function optimization. Proceedings of the International Conference Genetic Algorithms (ICGA ‘87), 41–49. 1987.Google Scholar
  27. [Grefenstette 2000]
    J. Grefenstette. Rank-based selection. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 1: Basic Algorithms and Operators, 187–194. Institute of Physics Publishing, 2000.Google Scholar
  28. [Hinterding 2000]
    R. Hinterding. Representation, mutation and crossover issues in evolutionary computation. Proceedings of the 2000 Congress on Evolutionary Computation (CEC ‘2000), 916–923. IEEE, 2000.Google Scholar
  29. [Ho et al. 1999]
    S.-Y. Ho, L.-S. Shu and H.-M. Chen. Intelligent genetic algorithm with a new intelligent crossover using orthogonal arrays. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ‘99), 289–296. Morgan Kaufmann, 1999.Google Scholar
  30. [Juistrom 1999]
    B.A. Julstrom. It’s all the same to me: revisiting rank-based probabilities and tournaments. Proceedings of the Congress on Evolutionary Computation (CEC ‘1999), 1501–1505. IEEE, 1999.Google Scholar
  31. [Kishore et al. 2000]
    J.K. Kishore, L.M. Patnaik, V. Mani and V.K. Agrawal. Application of genetic programming for multicategory pattern classification. IEEE Transactions on Evolutionary Computation 4(3), 242–258, Sep. 2000.Google Scholar
  32. [Koza 1992]
    J.R. Koza. Genetic Programming: on the programming of computers by means of natural selection. MIT Press, 1992.Google Scholar
  33. [Langdon et al. 1999]
    W.B. Langdon, T. Soule, R. Poli and J.A. Foster. The evolution of size and shape. In: L. Spector, W.B. Langdon, U-M O’Reilly and P.J. Angeline (Eds.) Advances in Genetic Programming 3, 163–190. MIT Press, 1999.Google Scholar
  34. [Luke and Spector 1997]
    S. Luke and L. Spector. A comparison of crossover and mutation in genetic programming. Genetic Programming 1997: Proceedings of the 2nd Annual Conference, 240–248. Morgan Kaufmann, 1997.Google Scholar
  35. [Luke and Spector 1998]
    S. Luke and L. Spector. A revised comparison of crossover and mutation in genetic programming. Genetic Programming 1998: Proceedings of the 3rd Annual Conference, 208–213. Morgan Kaufmann, 1998.Google Scholar
  36. [Mahfoud 1995]
    S.W. Mahfoud. Niching methods for genetic algorithms. (Ph.D. thesis) Il1iGAL Report No. 95001. University of Illinois at Urbana-Champaign, May 1995.Google Scholar
  37. [Mahfoud 2000]
    S.W. Mahfoud. Niching methods. In: T. Back, D.B. Fogel and T. Michalewicz (Eds.) Evolutionary Computation 2: Advanced Algorithms and Operators, 87–92. Institute of Physics Publishing, 2000.Google Scholar
  38. [Michalewicz 1996]
    Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, 1996.Google Scholar
  39. [Mitchell 1996]
    M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, 1996.Google Scholar
  40. [Mohan 1999]
    C.K. Mohan. Crossover operators that improve offspring fitness. Proceedings of the Congress on Evolutionary Computation (CEC ‘99), 1542–1549. IEEE, 1999.Google Scholar
  41. [Montana 1995]
    D.J. Montana. Strongly Typed Genetic Programming. Evolutionary Computation 3(2), 199–230, 1995.Google Scholar
  42. [Muruzabal et al. 2000]
    J. Muruzabal, C. Cotta-Porras and A. Fernandez. Some probabilistic modelling ideas for boolean classification in genetic programming. Genetic Programming: Proceedings of the 3rd European Conference (EuroGP 2000). Lecture Notes in Computer Science 1802, 133–148. Springer, 2000.Google Scholar
  43. [Pinker 1997]
    S. Pinker. How the Mind Works. W.W. Norton & Company. 1997.Google Scholar
  44. [Poli and Langdon 1998]
    R. Poli and W.B. Langdon. On the search properties of different crossover operators in genetic programming. Genetic Programming 1998: Proceedings of the 3rd Annual Conference (GP ‘98), 293–301. Morgan Kaufmann, 1998.Google Scholar
  45. [Poli et al. 1999]
    R. Poli, J. Page and W.B. Langdon. Smooth uniform crossover, sub-machine code GP and demes: a recipe for solving high-order boolean parity problems. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ‘99), 1162–1169. Morgan Kaufmann, 1999.Google Scholar
  46. [Rana 1999]
    S. Rana. The distributional biases of crossover operators. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ‘99), 549–556. Morgan Kaufmann, 1999.Google Scholar
  47. [Rasheed 1999]
    K. Rasheed. Guided crossover: a new operator for genetic algorithm based optimization. Proceedings of the Congress on Evolutionary Computation (CEC ‘99), 1535–1541. IEEE, 1999.Google Scholar
  48. [Rosca 1996]
    J.P. Rosea. Generality versus size in genetic programming. Genetic Programming 1996: Proceedings of the 1st Annual Conference, 381–387. Morgan Kaufmann, 1996.Google Scholar
  49. [Schnier and Yao 2000]
    T. Schnier and X. Yao. Using multiple representations in evolutionary algorithms. Proceedings of the 2000 Congress on Evolutionary Computation (CEC ‘2000), 479–486. IEEE, 2000.Google Scholar
  50. [Soule et al. 1996]
    T. Soule, J.A. Foster and J. Dickinson. Code growth in genetic programming. Genetic Programming 1996: Proceedings of the 1st Annual Conference, 215–223. Morgan Kaufmann, 1996.Google Scholar
  51. [Syswerda 1989]
    G. Syswerda. Uniform crossover in genetic algorithms Proceedings of the 2nd International Conference Genetic Algorithms (ICGA ‘89), 2–9. 1989.Google Scholar
  52. [Vekaria and Clack 1999]
    K. Vekaria and C. Clack. Biases introduced by adaptive recombination operators. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ‘99), 670–677. Morgan Kaufmann, 1999.Google Scholar
  53. [Whitley 1989]
    D. Whitley. The GENITOR algorithm and selective pressure: why rank-based allocation of reproductive trials is best. Proceedings of the 2nd International Conference Genetic Algorithms (ICGA ‘89), 116–121. 1989.Google Scholar
  54. [Wineberg and Oppacher 1996]
    M. Wineberg and F. Oppacher. The benefits of computing with introns. Genetic Programming 1996: Proceedings of the 1st Annual Conference, 410–415. Morgan Kaufmann, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alex A. Freitas
    • 1
  1. 1.Computing LaboratoryUniversity of KentCanterburyUK

Personalised recommendations