Memetic Algorithms
Carlos Cotta (),
Luke Mathieson () and
Pablo Moscato ()
Additional contact information
Carlos Cotta: Universidad de Málaga, Departamento Lenguajes y Ciencias de la Computación
Luke Mathieson: University of Newcastle, Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine
Pablo Moscato: The University of Newcastle, School of Electrical Engineering and Computing, Faculty of Engineering and Built Environment
Chapter 20 in Handbook of Heuristics, 2018, pp 607-638 from Springer
Abstract:
Abstract Memetic algorithms provide one of the most effective and flexible metaheuristic approaches for tackling hard optimization problems. Memetic algorithms address the difficulty of developing high-performance universal heuristics by encouraging the exploitation of multiple heuristics acting in concert, making use of all available sources of information for a problem. This approach has resulted in a rich arsenal of heuristic algorithms and metaheuristic frameworks for many problems. This chapter discusses the philosophy of the memetic paradigm, lays out the structure of a memetic algorithm, develops several example algorithms, surveys recent work in the field, and discusses the possible future directions of memetic algorithms.
Keywords: Evolutionary algorithms; Hybridization; Local search; Memetic computing; Metaheuristics (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-07124-4_29
Ordering information: This item can be ordered from
http://www.springer.com/9783319071244
DOI: 10.1007/978-3-319-07124-4_29
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().