In the current section, several metaheuristics involving the evolutionary of a population in order to create new generations of genetically superior individuals are presented. These algorithms are usually significantly influenced by the most prominent (and earliest) among them, the Genetic Algorithm (GA). Details about their basic characteristics and function, as well as some important variants, are described and applications in the field of industrial engineering are highlighted. A detailed description of the basic features of the genetic algorithm is presented at the beginning of this chapter and afterwards, other Evolutionary Algorithms (EA) are summarized. In specific, both relatively older and well established, as well as newer but promising methods are included, namely Differential Evolutionary, Memetic Algorithm, Imperialist Competitive Algorithm, Biogeography-Based Optimization algorithm, Teaching-Learning-Based optimization, Sheep Flock Heredity algorithm, Shuffled Frog-Leaping algorithm, and Bacteria Foraging Optimization algorithm.
CITATION STYLE
Karkalos, N. E., Markopoulos, A. P., & Davim, J. P. (2019). Evolutionary-based methods. In SpringerBriefs in Applied Sciences and Technology (pp. 11–31). Springer Verlag. https://doi.org/10.1007/978-3-319-92393-2_2
Mendeley helps you to discover research relevant for your work.