What is an Evolutionary Algorithm?

  • Eiben A
  • Smith J
N/ACitations
Citations of this article
160Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The most important aim of this chapter is to describe what an evolutionary algorithm is. This description is deliberately based on a unifying view presenting a general scheme that forms the common basis of all evolutionary algorithm (EA) variants. The main components of EAs are discussed, explaining their role and related issues of terminology. This is immediately followed by two example applications (unlike other chapters, where example applications are typically given at the end) to make things more concrete. Further on we discuss general issues of the working of EAs. Finally, we put EAs into a broader context and explain their relation with other global optimisation techniques.

Cite

CITATION STYLE

APA

Eiben, A. E., & Smith, J. E. (2003). What is an Evolutionary Algorithm? (pp. 15–35). https://doi.org/10.1007/978-3-662-05094-1_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free