Memetic self-adaptive evolution strategies applied to the maximum diversity problem.

Abstract

The maximum diversity problem consists in finding a subset of elements which have maximum diversity between each other. It is a very important problem due to its general aspect, that implies many practical applications such as facility location, genetics, and product design. We propose a method based on evolution strategies with local search and self-adaptation of the parameters. For all time limits from 1 to 300 s as well as for time to converge to the best solutions known, this method leads to better results when compared to other state-of-the-art algorithms.