Skip to main content
SpringerLink
Log in

Foundations of Evolutionary Algorithms

  • Chapter
  • First Online:
Stable Mutations for Evolutionary Algorithms

Part of the book series: Studies in Computational Intelligence ((SCI,volume 797))

  • 366 Accesses

Abstract

Evolutionary algorithms are a broad class of stochastic adaptation algorithms inspired by biological evolution—the process that allows populations of organisms to adapt to their surrounding environment. The concept of evolution was introduced in the 19th century by Charles Darwin and Johann Gregor Mendel and, complemented with further details, is still widely acknowledged as valid.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Angeline, P., & Kinnear, K. E. (1996). Advances in genetic programming. Cambridge: MIT Press.

    Google Scholar 

  • Arabas, J. (2001). Lectures on evolutionary algorithms. Warsaw: WNT. (in Polish).

    Google Scholar 

  • Atmar, W. (1992). On the rules and nature of simulated evolutionary programming. In D. B. Fogel & W. Atmar (Eds.), 1st Annual Conference on Evolutionary Programming (pp. 17–26). Jolla: Evolutionary Programming Society.

    Google Scholar 

  • Bäck, T. (1995). Evolutionary algorithms in theory and practice. Oxford: Oxford University Press.

    MATH  Google Scholar 

  • Bäck, T., & Schwefel, H.-P. (1993). An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1), 1–23.

    Article  Google Scholar 

  • Bäck, T., Fogel, D. B., & Michalewicz, Z. (Eds.). (1997). Handbook of evolutionary computation. New York: Institute of Physics Publishing and Oxford University Press.

    MATH  Google Scholar 

  • Bäck, T., Hoffmeister, F., & Schwefel, H.-P. (1991). A survey of evolution strategies. In R. Belew & L. Booker (Eds.), 4th International Conference on Genetic Algorithms (pp. 2–9). Los Altos: Morgan Kauffmann Publishers.

    Google Scholar 

  • Beasley, D., Bull, D. R., & Martin, R. R. (1993a). An overview of genetic algorithms. Part 1: Fundamentals. University. Computing, 15(2), 58–69.

    Google Scholar 

  • Beasley, D., Bull, D. R., & Martin, R. R. (1993b). An overview of genetic algorithms. Part 2: Research topics. University. Computing, 15(4), 170–181.

    Google Scholar 

  • Dasgupta, D., & Michalewicz, Z. (Eds.). (1997). Evolutionary algorithms for engineering applications. Heidelberg: Springer.

    MATH  Google Scholar 

  • Davis, L. (Ed.). (1987). Genetic algorithms and simulated annealing. San Francisco: Morgan Kaufmann.

    MATH  Google Scholar 

  • De Jong, K. (1975). An analysis of the behaviour of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Ann Arbor.

    Google Scholar 

  • Fogel, D. B. (1992). An analysis of evolutionary programming. In1st annual conference on genetic programming (pp. 43–51). Jolla: Evolutionary Programming Society.

    Google Scholar 

  • Fogel, D. B. (1995). Evolutionary computation: toward a new philosophy of machine intelligence. New York: IEEE Press.

    MATH  Google Scholar 

  • Fogel, D. B. (1998). Evolutionary computation: the fossil record. NY: IEEE Press.

    Book  Google Scholar 

  • Fogel, D. B. (1999). An overview of evolutionary programming. In L. D. Davis, K. De Jong, M. D. Vose, & L. D. Whitley (Eds.), Evolutionary algorithms (pp. 89–109). Heidelberg: Springer.

    Chapter  Google Scholar 

  • Fogel, D. B., Fogel, L. J., & Atmar, J. W. (1991). Meta-evolutionary programming. 25th Asilomar Conference on Signals, Systems, and Computers (pp. 540–545). San Jose: Maple Press.

    Google Scholar 

  • Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966). Artificial intelligence through simulated evolution. New York: Wiley.

    MATH  Google Scholar 

  • Galar, R. (1985). Handicapped individua in evolutionary processes. Biological Cybernetics (vol. 51, pp. 1–9).

    Article  Google Scholar 

  • Galar, R. (1989). Evolutionary search with soft selection. Biological cybernetics (vol. 60, pp. 357–364).

    Google Scholar 

  • Galar, R. (1990). Soft Selection in Random Global Adaptation in  \(R^n\). Wrocław (in Polish): A Biocybernetic Model of Development. - Technical University of Wrocław Press.

    Google Scholar 

  • Galar, R., & Karcz-Dulęba, I. (1994). The evolution of two: An example of space of states approach. 3rd Annual Conference on Evolutionary Programming (pp. 261–268). San Diego: World Scientific.

    Google Scholar 

  • Goldberg, D.E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley.

    Google Scholar 

  • Grefenstette, J. J. (1986). Optimization od control parameters for genetic algorithms. IEEE Transactions on System, Man and Cybernetics, 16(1), 122–128.

    Article  Google Scholar 

  • Grefenstette, J. J. (1990). Genetic algorithms and their applications. In A. Kent & J. G. Williams (Eds.), Encyclopedia of computer Science and Technology (pp. 139–152). New York: Marcel Dekker.

    Google Scholar 

  • Grefenstette, J. J. (1993). Deception considerable harmful. Foundations of Genetic Algorithms, 2, 75–91.

    Google Scholar 

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

    Google Scholar 

  • Holland, J. H. (1992). Adaptation in natural and artificial systems. Cambridge: MIT Press.

    Google Scholar 

  • Karcz-Dulęba, I. (1997). Some convergence aspects of evolutionary search with soft selection method. 2nd Conference on Evolutionary Algorithms and Global Optimization (pp. 113–120). Warsaw: Warsaw University of Technology Press.

    Google Scholar 

  • Karcz-Dulęba, I. (2001a). Dynamics of infinite populations envolving in a landscape of uni- and bimodal fitness functions. IEEE Transactions on Evolutionary Computation, 5(4), 398–409.

    Article  Google Scholar 

  • Karcz-Dulęba, I. (2001). Evolution of two-element population in the space of population states: Equilibrium states for assymetrical fitness functions. 5th Conference on Evolutionary Algorithms and Global Optimization (pp. 106–113). Warsaw: Warsaw University of Technology Press.

    Google Scholar 

  • Karcz-Dulęba, I. (2004). Time to convergence of evolution in the space of population states. International Journal Applied Mathematics and Computer Science, 14(3), 279–287.

    MathSciNet  MATH  Google Scholar 

  • Kinnear, J. R. (Ed.). (1994). Advances in genetic programming. Cambridge: The MIT Press.

    Google Scholar 

  • Koza, J. R. (1992). Genetic programming: On the programming of computers by means of natural selection. Cambridge: The MIT Press.

    MATH  Google Scholar 

  • Michalewicz, Z. (1996). Genetic algorithms + data structures = evolution programs. Heidelberg: Springer.

    Book  Google Scholar 

  • Michalewicz, Z. (1999). The significance of the evaluation function in evolutionary algorithms. In L. D. Davis, K. De Jong, M. D. Vose, & L. D. Whitley (Eds.), Evolutionary algorithms (pp. 151–166). Heidelberg: Springer.

    Chapter  Google Scholar 

  • Mitchel, M. (1996). An introduction to genetic algorithms. Cambridge: MIT Press.

    Google Scholar 

  • Obuchowicz, A. (2003c). Population in an ecological niche: Simulation of natural exploration. Bulletin of the Polish Academy of Sciences: Technical Sciences, 51(1), 59–104.

    Google Scholar 

  • Rechenberg, I. (1965). Cybernetic solution path of an experimental problem. Royal aircraft establishment, library translate 1122. Hants: Farnborough.

    Google Scholar 

  • Schaefer, R. (2007). Foundation of global genetic optimization. Heidelberg: Springer.

    Book  Google Scholar 

  • Schwefel, H.-P. (1981). Numerical optimization of computer models. Chichester: Wiley.

    MATH  Google Scholar 

  • Schwefel, H.-P. (1995). Evolution and optimum seeking. New York: Wiley.

    MATH  Google Scholar 

  • Vose, M. D. (1999). The simple genetic algorithm. Cambridge: MIT Press.

    MATH  Google Scholar 

  • Whitley, D. (1994). A genetic algorithm tutorial. Statistics and computing (vol. 4, pp. 65–85).

    Google Scholar 

  • Yao, X., & Liu, Y. (1999). Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2), 82–102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Electrical and Control Engineering, Institute of Control and Computation Engineering, University of Zielona Góra, Zielona Góra, Poland

    Andrzej Obuchowicz

Authors
  1. Andrzej Obuchowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Obuchowicz .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Obuchowicz, A. (2019). Foundations of Evolutionary Algorithms. In: Stable Mutations for Evolutionary Algorithms. Studies in Computational Intelligence, vol 797. Springer, Cham. https://doi.org/10.1007/978-3-030-01548-0_2

Download citation

Publish with us

Policies and ethics

Search

Navigation