The chance constrained travelling thief problem: Problem formulations and algorithms
The travelling thief problem (TTP) is a multi-component combinatorial optimization problem
that has gained significant attention in the evolutionary computation and heuristic search …
that has gained significant attention in the evolutionary computation and heuristic search …
Quality-diversity algorithms can provably be helpful for optimization
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 …
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
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 …
has become an important topic. The goal of computing diverse sets of high quality solutions …
Evolutionary diversity optimisation for sparse directed communication networks
This study proposes Evolutionary Diversity Optimisation (EDO) to Lower the Probability of
Detection (LPD) in directed wireless networks. LPD communication aims to communicate …
Detection (LPD) in directed wireless networks. LPD communication aims to communicate …
Evolutionary diversity optimisation for the traveling thief problem
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 …
diverse set of high-quality solutions for a given optimisation problem. This can provide the …
Map-elites with cosine-similarity for evolutionary ensemble learning
Evolutionary ensemble learning methods with Genetic Programming have achieved
remarkable results on regression and classification tasks by employing quality-diversity …
remarkable results on regression and classification tasks by employing quality-diversity …
Exploring the feature space of TSP instances using quality diversity
Generating instances of different properties is key to algorithm selection methods that
differentiate between the performance of different solvers for a given combinatorial …
differentiate between the performance of different solvers for a given combinatorial …
Solving travelling thief problems using coordination based methods
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 …
comprises an entanglement of a travelling salesman problem (TSP) and a knapsack …
Analysis of quality diversity algorithms for the knapsack problem
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 …
problems in areas such as robotics, games and combinatorial optimization. They aim to …
Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes
A Nikfarjam, T Stanford, A Neumann… - Proceedings of the …, 2024 - dl.acm.org
How people spend their finite time budget of 24 hours on daily activities is linked to their
wellbeing. Yet, how to best allocate time to optimise multi-dimensional wellbeing (physical …
wellbeing. Yet, how to best allocate time to optimise multi-dimensional wellbeing (physical …