Abstract
Every aspect of our daily life implies a search for the best possible action and the optimal choice for that act. Most standard optimization methods require the fulfilment of certain constraints, imply convergence issues or use single point movement. Among them, EAs represent a flexible and adaptable alternative, with classes of methods based on principles of evolution and heredity, with populations of potential solutions and only some basic knowledge of mathematics.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
- Evolutionary Algorithm
- Candidate Solution
- Selection Operator
- Binary Representation
- Proportional Selection
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Stoean, C., Stoean, R. (2014). Overview of Evolutionary Algorithms. In: Support Vector Machines and Evolutionary Algorithms for Classification. Intelligent Systems Reference Library, vol 69. Springer, Cham. https://doi.org/10.1007/978-3-319-06941-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-06941-8_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06940-1
Online ISBN: 978-3-319-06941-8
eBook Packages: EngineeringEngineering (R0)