Memetic Algorithms

Jin-Kao Hao () and Xiangjing Lai
Additional contact information
Jin-Kao Hao: Université d’Angers
Xiangjing Lai: Nanjing University of Posts and Telecommunications

Chapter Chapter 12 in Discrete Diversity and Dispersion Maximization, 2023, pp 271-298 from Springer

Abstract: Abstract This chapter is dedicated to memetic algorithms for diversity and dispersion problems. It is organized in two parts. The first part discusses the general design issues of memetic algorithms concerning crossover, local search, population management, evaluation function, and constraint handling. The second part presents a survey of memetic algorithms applied to three diversity and dispersion problems: maximum diversity, the max-mean dispersion, and generalized max-mean dispersion.

Date: 2023
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:spochp:978-3-031-38310-6_12

Ordering information: This item can be ordered from
http://www.springer.com/9783031383106

DOI: 10.1007/978-3-031-38310-6_12

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().