Quality-diversity algorithms can provably be helpful for optimization

C Qian, K Xue, RJ Wang - arXiv preprint arXiv:2401.10539, 2024 - arxiv.org
Quality-Diversity (QD) algorithms are a new type of Evolutionary Algorithms (EAs), aiming to
find a set of high-performing, yet diverse solutions. They have found many successful …

Diversity optimization for the detection and concealment of spatially defined communication networks

A Neumann, S Gounder, X Yan, G Sherman… - Proceedings of the …, 2023 - dl.acm.org
In recent years, computing diverse sets of high quality solutions for an optimization problem
has become an important topic. The goal of computing diverse sets of high quality solutions …

Evolutionary diversity optimisation for the traveling thief problem

A Nikfarjam, A Neumann, F Neumann - Proceedings of the Genetic and …, 2022 - dl.acm.org
There has been a growing interest in the evolutionary computation community to compute a
diverse set of high-quality solutions for a given optimisation problem. This can provide the …

Map-elites with cosine-similarity for evolutionary ensemble learning

H Zhang, Q Chen, A Tonda, B Xue, W Banzhaf… - … Conference on Genetic …, 2023 - Springer
Evolutionary ensemble learning methods with Genetic Programming have achieved
remarkable results on regression and classification tasks by employing quality-diversity …

Exploring the feature space of TSP instances using quality diversity

J Bossek, F Neumann - Proceedings of the Genetic and Evolutionary …, 2022 - dl.acm.org
Generating instances of different properties is key to algorithm selection methods that
differentiate between the performance of different solvers for a given combinatorial …

[HTML][HTML] Solving travelling thief problems using coordination based methods

M Namazi, MAH Newton, C Sanderson, A Sattar - Journal of Heuristics, 2023 - Springer
A travelling thief problem (TTP) is a proxy to real-life problems such as postal collection. TTP
comprises an entanglement of a travelling salesman problem (TSP) and a knapsack …

Analysis of quality diversity algorithms for the knapsack problem

A Nikfarjam, A Viet Do, F Neumann - International Conference on Parallel …, 2022 - Springer
Quality diversity (QD) algorithms have been shown to be very successful when dealing with
problems in areas such as robotics, games and combinatorial optimization. They aim to …

Evolutionary Diversity Optimisation for Sparse Directed Communication Networks

S Gounder, F Neumann, A Neumann - Proceedings of the Genetic and …, 2024 - dl.acm.org
This study proposes Evolutionary Diversity Optimisation (EDO) to Lower the Probability of
Detection (LPD) in directed wireless networks. LPD communication aims to communicate …

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments

A Nikfarjam, R Rothenberger, F Neumann… - Proceedings of the …, 2023 - dl.acm.org
Computing diverse solutions for a given problem, in particular evolutionary diversity
optimisation (EDO), is a hot research topic in the evolutionary computation community. This …

[HTML][HTML] A Sequence-Based Hyper-Heuristic for Traveling Thieves

D Rodríguez, JM Cruz-Duarte, JC Ortiz-Bayliss… - Applied Sciences, 2022 - mdpi.com
A plethora of combinatorial optimization problems can be linked to real-life decision
scenarios. Even nowadays, more diverse and complex problems are popping up. One of …