Swipe to navigate through the chapters of this book
The preceding chapter presented all relevant elements of evolutionary algorithms, namely guidelines of how to choose an encoding for the solution candidates, procedures how to select individuals based on their fitness, and genetic operators with which modified solution candidates can be obtained.
Please log in to get access to this content
To get access to this content you need the following product:
Regression finds a function from a given class to given data by minimizing the sum of squared deviations and is also called the method of least squares , see Sect. 10.2.
Note that this is exactly opposite to evolution strategies (see Sect. 13.2), in which crossover is often abandoned and mutation is the only genetic operator.
All programs were written in the programming language Fortran.
All programs were written in the programming languages Fortran and Basic.
J. Antonisse, A new interpretation of schema notation that overturns the binary encoding constraint, in Proceedings of the 3rd International Conference on Genetic Algorithms (Morgan Kaufmann, San Francisco, 1989), pp. 86–97
K.J. Arrow, Social Choice and Individual Values (Wiley, New York, 1951) MATH
R. Axelrod, More effective choice in the prisoner’s dilemma, in Journal of Conflict Resolution, vol. 24 (SAGE Publications, New York, 1980), pp. 379–403
R. Axelrod, The Evolution of Cooperation (Basic Books, New York, 1984) MATH
R. Axelrod, The evolution of strategies in the iterated prisoner’s dilemma, in Genetic Algorithms and Simulated Annealing, ed. by L. Davis (Morgan Kaufmann, San Francisco, 1987), pp. 32–41
T. Bäck, H.-P. Schwefel, An overview of evolutionary algorithms for parameter optimization, in Evolutionary Computation, vol. 1(1) (MIT Press, Cambridge, 1993), pp. 1–23
K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6(2), 182–197 (2002) CrossRef
D.B. Fogel, Blondie24: Playing at the Edge of AI (Morgan Kaufmann, San Francisco, 2001)
D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning (Addison Wesley, Reading, 1989) MATH
D.E. Goldberg, The theory, of virtual alphabets, in Proceedings of the 1st Workshop on Parallel Problem Solving in Nature (PPSN, Dortmund, Germany). LNCS vol. 496 (Springer, Heidelberg, 1991), pp. 13–22
G.H. Golub, C.F. Van Loan, Matrix Computations, 3rd edn. (The Johns Hopkins University Press, Baltimore, 1996) MATH
N. Hansen, The CMA Evolution Strategy: A Comparing Review, ed. by J.A. Lozano et al. (Springer, Heidelberg, 2006), pp. 1769–1776
T. Hobbes, Leviathan. Or the matter, forme and power of a commonwealth ecclesiastical and civil. 1651, in Leviathan. Or The Matter, Forme, and Power of a Common-Wealth Ecclesiastical and Civil, ed. by I. Shapiro (Yale University Press, New Haven, 2010)
J.H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, 2nd edn. (University of Michigan Press, Ann Arbor, 1975; MIT Press, Cambridge, 1992)
J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Boston, 1992) MATH
J. Knowles, C. David, The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation, in Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1999, Washington, DC), vol. 1 (IEEE Press, Piscataway, 1999), pp. 98–105
P. Larrañaga, J.A. Lozano (eds.), Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (Kluwer Academic Publishers, Boston, 2002) MATH
J.A. Lozano, T. Larrañaga, O. Inza, E. Bengoetxea (eds.), Towards a New Evolutionary Computation. Advances on Estimation of Distribution Algorithms (Springer, Berlin, 2006)
M. Michell, An Introduction to Genetic Algorithms (MIT Press, Cambridge, 1998)
H. Mühlenbein, Parallel Genetic Algorithms, Population Genetics, Combinatorial Optimization, in Proceedings of the 3rd International Conference on Genetic Algorithms (CEC, 1989, Fairfax, VA) (Morgan Kaufmann, San Francisco, 1989), pp. 416–421
J.F. Nash, Non-cooperative games, in Annals of Mathematics, vol. 54(2) (Princeton University, Princeton, 1951), pp. 286–295
N.J. Nilsson, Artificial Intelligence: A New Synthesis (Morgan Kaufmann, San Francisco, 1998) MATH
V. Nissen, Einführung in evolutionäre Algorithmen: Optimierung nach dem Vorbild der Evolution (Vieweg, Braunschweig/Wiesbaden, 1997) CrossRef
W.H. Press, S.A. Teukolsky, W.T. Vetterling, B.P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, 2nd edn. (Cambridge University Press, Cambridge, 1992) MATH
I. Rechenberg, Evolutionstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution (Fromman-Holzboog, Stuttgart, 1973)
J.D. Schaffer, Multiple objective optimization with vector evaluated genetic algorithms, in Proceedings of the 1st International Conference on Genetic Algorithms (L. Erlbaum Associates, Hillsdale, 1985), pp. 93–100
E. Zitzler, M. Laumanns, L. Thiele, SPEA2: improving the strength pareto evolutionary algorithm. Technical Report TIK-Report vol. 103. Department Informationstechnologie und Elektrotechnik, Eidgenössische Technische Hochschule Zürich, Switzerland (2001)
- Fundamental Evolutionary Algorithms
- Springer London
- Sequence number
- Chapter number
- Chapter 13