Memetic algorithms

6Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Memetic algorithms (MA) has become one of the key methodologies behind solvers that are capable of tackling very large, real-world, optimization problems. They are being actively investigated in research institutions as well as broadly applied in industry. This chapter provides a pragmatic guide on the key design issues underpinningmemetic algorithms (MA) engineering. It begins with a brief contextual introduction to memetic algorithms and then moves on to define a pattern language for MAs. For each pattern, an associated design issue is tackled and illustrated with examples from the literature. The last section of this chapter "fast forwards" to the future and mentions what, in our mind, are the key challenges that scientists and practitioners will need to face if memetic algorithms are to remain a relevant technology in the next 20 years.

Cite

CITATION STYLE

APA

Krasnogor, N. (2012). Memetic algorithms. In Handbook of Natural Computing (Vol. 2–4, pp. 906–935). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_29

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