Abstract
In Chap. 1, we drew a graph for EAs with the statement that EAs are interesting, useful, easy-to-understand, and hot research topics. Starting with Chap. 2, we will demonstrate EAs in a pedagogical way so that you can enjoy the journey around EAs with active reading. We strongly encourage readers to implement their basic EAs in this chapter in one programming environment and improve its search ability through other chapters. Footnotes, exercises, and possible research projects are of great value for an in-depth understanding of the essence of the algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Papoulis A, Pillai S (2002) Probability, random variables and stochastic processes, 4th edn. McGraw Hill Higher Education
Ross S (2009) A first course in probability, 8th edn. Prentice Hall
Nelder J, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308–313
Dennis JE, Jr, Torczon V (1991) Direct search methods on parallel machines. SIAM J Optim 1:448–474
MathWorks T (2009) Genetic algorithm and direct search toolbox 2 user’s guide. Tech. rep., The MathWorks, Natick, MA
Glover F, Laguna M, Marti R (2003) Advances in evolutionary computation: theory and applications, chap. Scatter search, 519–537. Springer, Berlin Heidelberg New York
Laguna M, Marti R (2003) Scatter search: methodology and implementations in C. Springer, Berlin Heidelberg New York
Storn R, Price K (1997) Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359
Price KV, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin Heidelberg New York
Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, Berlin Heidelberg New York
Bäck T, Fogel D, Michalewicz Z (2000) Evolutionary computation 1: basic algorithms and operators. Taylor & Francis, London, UK
Haupt RL, Haupt SE (2004) Practical genetic algorithms, 2nd edn. Wiley, New York
Feoktistov V (2006) Differential evolution: in search of solutions. Springer, Berlin Heidelberg New York
Calégari P, Coray G, Hertz A et al (1999) A taxonomy of evolutionary algorithms in combinatorial optimization. J Heurist 5(2):145–158
Rights and permissions
Copyright information
© 2010 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2010). Simple Evolutionary Algorithms. In: Introduction to Evolutionary Algorithms. Decision Engineering, vol 0. Springer, London. https://doi.org/10.1007/978-1-84996-129-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-84996-129-5_2
Publisher Name: Springer, London
Print ISBN: 978-1-84996-128-8
Online ISBN: 978-1-84996-129-5
eBook Packages: EngineeringEngineering (R0)