Memetic Algorithms

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.