Abstract
This chapter presents the field of evolutionary algoithms, that is, Darwin-inspired algorithms used to find approximate optimal solutions to some problems, that are not easily, or not all, likely to be reached by traditionnal optimisation methods. After a presentation of the basics of evolutionary algorithms, their conceptual tools and their vocabulary, current trends in the field are surveyed. Many examples are given to provide an idea of the specificity and the fruitfulness of these Darwinian methods, as well as the diversity of their application.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Auger, A., & Hansen, N. (2005). A restart CMA evolution strategy with increasing population size. In Proc. CEC’05 (pp. 1769–1776). IEEE Press .
Auger, A., Hansen, N., Perez Zerpa, J. M., Ros, R., & Schoenauer, M. (2009). Empirical comparisons of derivative free optimization algorithms. In J. Vahrenhold (Ed.), 8th international symposium on experimental algorithms, vol. 5526 of LNCS (pp. 3–15). Springer .
Bäck, T., & Schütz, M. (1995). Evolution strategies for mixed-integer optimization of optical multilayer systems. In J. R. McDonnell, R. G. Reynolds, & D. B. Fogel (Eds.), Proceedings of the 4th annual conference on evolutionary programming. MIT Press.
Bäck, T., Fogel, D., & Michalewicz, Z. (Eds.). (1997). Handbook of evolutionary computation. Oxford: Oxford University Press.
Bentley, P. J. (Ed.). (1999). Evolutionary design by computers. San Francisco: Morgan Kaufman Publishers Inc.
Bentley, P. (2000). Exploring component-based representations. In I. Parmee (Ed.), Adaptive Computing in Design and Manufacture, ACDM’2000 (pp. 161–172).
Bonnans, F., Gilbert, J., Lemarechal, C., & Sagastizábal, C. (1997). Optimisation numérique, aspects théoriques et pratiques. Mathématiques & Applications, 23, Springer.
Coello, C. A. C., Veldhuizen, D. A. V., & Lamont, G. B. (2002). Evolutionary algorithms for solving multi-objective problems. New York: Kluwer Academic Publishers.
Costa, L. D., & Schoenauer, M. (2009). Bringing evolutionary computation to industrial applications with. In G. Raidl et al. (Ed.), Proc. GECCO’09. ACM Press.
Cramer, N. (1985). A representation for the adaptive generation of simple sequential programs. In J. J. Grefenstette (Ed.), Proceedings of the 1st international conference on genetic algorithms (pp. 183–187). Laurence Erlbaum Associates.
Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostram Reinhold.
Dawkins, R. (1976). The selfish gene. Oxford: Oxford University Press.
De Jong, K. (2007). Parameter setting in evolutionary algorithms, Chapter parameter setting in EAs : A 30 year perspective (pp. 1–18).
Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. Chichester: Wiley.
DeJong, K. A. (1992). Are genetic algorithms function optimizers ? In R. Manner, & B. Manderick (Eds.), Proceedings of the 2nd conference on parallel problems solving from nature (pp. 3–13). North Holland.
Fogel, D. B. (1995). Evolutionary computation. Toward a new philosophy of machine intelligence. New York: IEEE Press.
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966). Artificial intelligence through simulated evolution. New York: Wiley.
Gero, J. (1998). Adaptive systems in designing : New analogies from genetics and developmental biology. In I. Parmee (Ed.), Adaptive computing in design and manufacture (pp. 3–12). London: Springer.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison Wesley.
Goldberg, D. E., & Richardson, J. (1987). Genetic algorithms with sharing for multi-modal function optimization. In J. J. Grefenstette (Ed.), Proceedings of the 2nd international conference on genetic algorithms (pp. 41–49). Lawrence Erlbaum Associates.
Gruau, F. (1994). Synthèse de réseaux de neurones par codage cellulaire et algorithmes génétiques, thèse de doctorat, Ecole normale superieure de Lyon.
Hamda, H., & Schoenauer, M. (2002). Topological optimum design with evolutionary algorithms. Journal of Convex Analysis, 9, 503–517.
Hansen, N., & Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2), 159–195.
Hansen, N., Müller, S., & Koumoutsakos, P. (2003). Reducing the time complexity of the derandomized evolution strategy with Covariance Matrix Adaptation (CMA-ES). Evolution Computation, 11(1), 1–18.
Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.
Koza, J. R. (1992). Genetic programming: On the programming of computers by means of natural evolution. Cambridge, MA: MIT Press.
Koza, J. R. (1994). Genetic programming II: Automatic discovery of reusable programs. Cambridge, MA: MIT Press.
Koza, J. R., et al. (1999). Genetic programming III: Automatic synthesis of analog circuits. Cambridge, MA: MIT Press.
Lutton, E., Cayla, E., & Chapuis, J. (2003). Artiefract : The artist’s viewpoint. Applications of evolutionary computing, Nr 2611 in LNCS (pp. 125–130). Springer.
Martin, S., Rivory, J., & Schoenauer, M. (1995). Synthesis of optical multi-layer systems using genetic algorithms. Applied Optics, 34, 2267.
Merz, P., & Freisleben, B. (1999). Fitness landscapes and memetic algorithm design. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 245–260). London: McGraw-Hill.
Merz, P., & Huhse, J. (2009). An iterated local search approach for finding provably good solutions for very large tsp instances. In G. Rudolph et al. (Ed.), Proc. PPSN X, Nr 5199 in LNCS (pp. 929–939). Springer.
Michalewicz, Z. (1992–1996). Genetic algorithms + data structures = evolution programs (1st–3rd ed.). Berlin: Springer.
Paechter, B., Rankin, R., Cumming, A., & Fogarty, T.C. (1998). Timetabling the classes of an entire university with an evolutionary algorithm. In T. Bäck, A. Eiben, M. Schoenauer, & H.-P. Schwefel (Eds.), Proceedings of the 5th conference on parallel problems solving from nature. Springer.
Powell, M. J. D. (2006). The NEWUOA software for unconstrained optimization without derivatives. In Large-scale nonlinear optimization (pp. 255–297). Springer .
Radcliffe, N. J. (1991). Forma analysis and random respectful recombination. In R.K. Belew, & L.B. Booker (Eds.), Proceedings of the 4th international conference on genetic algorithms (pp. 222–229). Morgan Kaufmann.
Rechenberg, I. (1972). Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution. Stuttgart: Fromman-Hozlboog Verlag.
Rosenman, M. (1999). Evolutionary case-based design. Artificial Evolution’99 (pp. 53–72). Springer.
Sareni, B., & Krähenbühl, L. (1998). Fitness sharing and niching methods revisited. Transactions on Evolutionary Computation, 2(3), 97–106.
Schnier, T. (2008). Evolving out of the box. In Studying design creativity – Design science, computer science, cognitive science and neuroscience approaches : The state of the art international NSF workshop.
Schwefel, H.-P. (1981). Numerical optimization of computer models. Chichester: Wiley.
Semet, Y., & Schoenauer, M. (2006). On the benefits of inoculation, an example in train scheduling. In GECCO’06 (pp. 1761–1768). ACM Press.
Standish, R. K. (2002). Open-ended artificial evolution. International Journal of Computational Intelligence and Applications, 3, 167.
Stanley, K. O. (2007). Compositional pattern producing networks : A novel abstraction of development, Special issue on developmental systems, Genetic Programming and Evolvable Machines, 8(2) : 131–162.
Surry, P., & Radcliffe, N. (1996). Formal algorithms + formal representations = search strategies. In H.-M. Voigt, W. Ebeling, I. Rechenberg, & H.-P. Schwefel (Eds.), Proceedings of the 4th conference on parallel problems solving from nature, Nr 1141 in LNCS (pp. 366–375). Springer.
Yu, T., Davis, L., Baydar, C., & Roy, R. (Eds.). (2008). Evolutionary computation in practice. Studies in Computational Intelligence, Nr 88. Springer.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Schoenauer, M. (2015). Evolutionary Algorithms. In: Heams, T., Huneman, P., Lecointre, G., Silberstein, M. (eds) Handbook of Evolutionary Thinking in the Sciences. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9014-7_28
Download citation
DOI: https://doi.org/10.1007/978-94-017-9014-7_28
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-9013-0
Online ISBN: 978-94-017-9014-7
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)