Evolutionary Algorithms

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Evolutionary algorithms (EAs) are population-based metaheuristics, originally inspired by aspects of natural evolution. Modern varieties incorporate a broad mixture of search mechanisms, and tend to blend inspiration from nature with pragmatic engineering concerns; however, all EAs essentially operate by maintaining a population of potential solutions and in some way artificially ‘evolving’ that population over time. Particularly well-known categories of EAs include genetic algorithms (GAs), Genetic Programming (GP), and Evolution Strategies (ES). EAs have proven very successful in practical applications, particularly those requiring solutions to combinatorial problems. EAs are highly flexible and can be configured to address any optimization task, without the requirements for reformulation and/or simplification that would be needed for other techniques. However, this flexibility goes hand in hand with a cost: the tailoring of an EA’s configuration and parameters, so as to provide robust performance for a given class of tasks, is often a complex and time-consuming process. This tailoring process is one of the many ongoing research areas associated with EAs.
LanguageEnglish
Title of host publicationHandbook of Heuristics
EditorsR. Martí, P. Panos, M. Resende
PublisherSpringer
ISBN (Electronic)978-3-319-07153-4
DOIs
Publication statusE-pub ahead of print - 22 Feb 2018

Fingerprint

Evolutionary algorithms
Genetic programming
Genetic algorithms
Costs

Cite this

Corne, D., & Lones, M. A. (2018). Evolutionary Algorithms. In R. Martí, P. Panos, & M. Resende (Eds.), Handbook of Heuristics Springer. https://doi.org/10.1007/978-3-319-07153-4_27-1
Corne, David ; Lones, Michael Adam. / Evolutionary Algorithms. Handbook of Heuristics. editor / R. Martí ; P. Panos ; M. Resende. Springer, 2018.
@inbook{70910b8459474e7f94971100cf2a6e83,
title = "Evolutionary Algorithms",
abstract = "Evolutionary algorithms (EAs) are population-based metaheuristics, originally inspired by aspects of natural evolution. Modern varieties incorporate a broad mixture of search mechanisms, and tend to blend inspiration from nature with pragmatic engineering concerns; however, all EAs essentially operate by maintaining a population of potential solutions and in some way artificially ‘evolving’ that population over time. Particularly well-known categories of EAs include genetic algorithms (GAs), Genetic Programming (GP), and Evolution Strategies (ES). EAs have proven very successful in practical applications, particularly those requiring solutions to combinatorial problems. EAs are highly flexible and can be configured to address any optimization task, without the requirements for reformulation and/or simplification that would be needed for other techniques. However, this flexibility goes hand in hand with a cost: the tailoring of an EA’s configuration and parameters, so as to provide robust performance for a given class of tasks, is often a complex and time-consuming process. This tailoring process is one of the many ongoing research areas associated with EAs.",
author = "David Corne and Lones, {Michael Adam}",
year = "2018",
month = "2",
day = "22",
doi = "10.1007/978-3-319-07153-4_27-1",
language = "English",
editor = "R. Mart{\'i} and P. Panos and M. Resende",
booktitle = "Handbook of Heuristics",
publisher = "Springer",

}

Corne, D & Lones, MA 2018, Evolutionary Algorithms. in R Martí, P Panos & M Resende (eds), Handbook of Heuristics. Springer. https://doi.org/10.1007/978-3-319-07153-4_27-1

Evolutionary Algorithms. / Corne, David; Lones, Michael Adam.

Handbook of Heuristics. ed. / R. Martí; P. Panos; M. Resende. Springer, 2018.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Evolutionary Algorithms

AU - Corne, David

AU - Lones, Michael Adam

PY - 2018/2/22

Y1 - 2018/2/22

N2 - Evolutionary algorithms (EAs) are population-based metaheuristics, originally inspired by aspects of natural evolution. Modern varieties incorporate a broad mixture of search mechanisms, and tend to blend inspiration from nature with pragmatic engineering concerns; however, all EAs essentially operate by maintaining a population of potential solutions and in some way artificially ‘evolving’ that population over time. Particularly well-known categories of EAs include genetic algorithms (GAs), Genetic Programming (GP), and Evolution Strategies (ES). EAs have proven very successful in practical applications, particularly those requiring solutions to combinatorial problems. EAs are highly flexible and can be configured to address any optimization task, without the requirements for reformulation and/or simplification that would be needed for other techniques. However, this flexibility goes hand in hand with a cost: the tailoring of an EA’s configuration and parameters, so as to provide robust performance for a given class of tasks, is often a complex and time-consuming process. This tailoring process is one of the many ongoing research areas associated with EAs.

AB - Evolutionary algorithms (EAs) are population-based metaheuristics, originally inspired by aspects of natural evolution. Modern varieties incorporate a broad mixture of search mechanisms, and tend to blend inspiration from nature with pragmatic engineering concerns; however, all EAs essentially operate by maintaining a population of potential solutions and in some way artificially ‘evolving’ that population over time. Particularly well-known categories of EAs include genetic algorithms (GAs), Genetic Programming (GP), and Evolution Strategies (ES). EAs have proven very successful in practical applications, particularly those requiring solutions to combinatorial problems. EAs are highly flexible and can be configured to address any optimization task, without the requirements for reformulation and/or simplification that would be needed for other techniques. However, this flexibility goes hand in hand with a cost: the tailoring of an EA’s configuration and parameters, so as to provide robust performance for a given class of tasks, is often a complex and time-consuming process. This tailoring process is one of the many ongoing research areas associated with EAs.

U2 - 10.1007/978-3-319-07153-4_27-1

DO - 10.1007/978-3-319-07153-4_27-1

M3 - Chapter

BT - Handbook of Heuristics

A2 - Martí, R.

A2 - Panos, P.

A2 - Resende, M.

PB - Springer

ER -

Corne D, Lones MA. Evolutionary Algorithms. In Martí R, Panos P, Resende M, editors, Handbook of Heuristics. Springer. 2018 https://doi.org/10.1007/978-3-319-07153-4_27-1