Discrepancy-based evolutionary diversity optimization

Abstract : Diversity plays a crucial role in evolutionary computation. While diversity has been mainly used to prevent the population of an evolutionary algorithm from premature convergence, the use of evolutionary algorithms to obtain a diverse set of solutions has gained increasing attention in recent years. Diversity optimization in terms of features on the underlying problem allows to obtain a better understanding of possible solutions to the problem at hand and can be used for algorithm selection when dealing with combinatorial optimization problems such as the Traveling Salesperson Problem. We consider discrepancy-based diversity optimization approaches for evolving diverse sets of images as well as instances of the Traveling Salesperson problem where a local search is not able to find near optimal solutions. Our experimental investigations comparing three diversity optimization approaches show that a discrepancy-based diversity optimization approach using a tie-breaking rule based on weighted differences to surrounding feature points provides the best results in terms of the star discrepancy measure.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01921073
Contributor : Carola Doerr <>
Submitted on : Tuesday, November 13, 2018 - 3:54:05 PM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Links full text

Identifiers

Citation

Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, Markus Wagner. Discrepancy-based evolutionary diversity optimization. GECCO '18 - Genetic and Evolutionary Computation Conference, Jul 2018, Kyoto, France. pp.991-998, ⟨10.1145/3205455.3205532⟩. ⟨hal-01921073⟩

Share

Metrics

Record views

200