Abstract
A lot of typical problems that have to be commonly solved in engineering or business can be formulated as optimization problems. The performance of an activity or the value of a decision are characterized by a certain cost function, and here, possible alternatives are considered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The best-fitted individual is not typically detected in the last generation.
- 2.
A fraction coefficient between zero and one is randomly chosen from the uniform distribution.
- 3.
In genetic programming, bloat can be described as excessive code growth within the individuals of the evolving population without a proportional improvement in fitness, whereas introns are (redundant or unproductive) the parts of the code that do not contribute to the calculation that is being made.
- 4.
A crowding distance can be estimated by the perimeter of a cuboid formed by using the nearest neighbors in the objective space as the vertices.
References
Boussaid I, Lepagnot J, Siarry P (2013) Inf Sci 237:82–117
Eiben A, Smith J (2015) Introduction to evolutionary computing, 2nd edn. Springer, Berlin
Back T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford
Michalewicz Z (1996) Genetic algorithms \(+\) data structures \(=\) evolution programs, 3rd edn. Springer, Berlin
Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
Schwefel H (1981) Numerical optimization of computer models. Wiley, Hoboken
Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge
Fogel L, Owens A, Walsh M (1966) Artificial intelligence through simulated evolution. John Wiley, Hoboken
Holland J (1980) Int J Policy Anal Inf Syst 4(3):245–268
Storn R, Price K (1997) J Glob Optim 11(4):341–359
De Jong K (2006) Evolutionary computation: a unified approach. MIT Press, Cambridge
Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms. Caltech concurrent computation program, 790
Krasnogor N, Smith J (2005) IEEE Trans Evol Comput 9(5):474–488
Blickle T, Thiele L (1996) Evol Comput 4(4):361–394
Sipper M, Fu W, Ahuja K, Moore J (2018) BioData Min 11:2
Eiben A, Hinterding R, Michalewicz Z (1999) IEEE Trans Evol Comput 3(2):124–141
Kretowski M (2008) Obliczenia ewolucyjne w eksploracji danych. Globalna indukcja drzew decyzyjnych, Wydawnictwo Politechniki Bialostockiej
Golberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Boston
Larranaga P, Kuijpers C, Murga R, Inza I, Dizdarevic S (1999) Artif Intell Rev 13(2):129–170
Schwefel H (1995) Evolution and optimum seeking. Wiley, Hoboken
Doerr B, Happ E, Klein C (2012) Theoretical Computer Science 425:17–33
Freitas A (2002) Data mining and knowledge discovery with evolutionary algorithms. Springer, Berlin Heidelberg
Michalewicz Z, Fogel D (2004) How to Solve It: Modern Heuristics, 2nd edn. Springer
Deb K (2001) Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons
Zhou A, Qu B, Li H, Zhao S, Suganthan P, Zhang Q (2011) Swarm and Evolutionary Computation 1(1):32–49
Zitzler E, Thiele L (1999) IEEE Trans Evol Comput 3(4):257–271
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) IEEE Trans Evol Comput 6(2):182–197
Zhang X, Tian Y, Cheng R, Jin Y (2015) IEEE Trans Evol Comput 19(2):201–213
Fortin F, Parizeau M (2013) Revisiting the NSGA-II crowding-distance computation. In: Proc. of GECCO’13, ACM pp 623–630
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kretowski, M. (2019). Evolutionary Computation. In: Evolutionary Decision Trees in Large-Scale Data Mining. Studies in Big Data, vol 59. Springer, Cham. https://doi.org/10.1007/978-3-030-21851-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-21851-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21850-8
Online ISBN: 978-3-030-21851-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)