Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax

DOI10.1145/3594805.3607135MaRDI QIDQ6202146zbMATH OpenOpenAlexFDO

Authors Denis Antipov, Aneta Neumann, F. Neumann

Publication date 23 February 2024

Published in Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2307.07248

zbMATH Keywords

diversity optimizationmulti-objective optimizationruntime analysistheory

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
• Population size matters: rigorous runtime results for maximizing the hypervolume indicator
• Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
• Comparison of simple diversity mechanisms on plateau functions
• Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization

Cites work

• Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation

This page was built for publication: Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202146)