Effective 2-and 3-objective MOEA/D approaches for the chance constrained knapsack problem

I Hewa Pathiranage, F Neumann, D Antipov… - Proceedings of the …, 2024 - dl.acm.org
Optimizing real-world problems often involves decision-making under uncertainty due to the
presence of unknown or uncontrollable variables. Chance-constraints allow to model the …

Multi-objective evolutionary algorithms with sliding window selection for the dynamic chance-constrained knapsack problem

KK Perera, A Neumann - Proceedings of the Genetic and Evolutionary …, 2024 - dl.acm.org
Evolutionary algorithms are particularly effective for optimisation problems with dynamic and
stochastic components. We propose multi-objective evolutionary approaches for the …

Using 3-objective evolutionary algorithms for the dynamic chance constrained knapsack problem

I Hewa Pathiranage, F Neumann, D Antipov… - Proceedings of the …, 2024 - dl.acm.org
Real-world optimization problems often involve stochastic and dynamic components.
Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt …

Analysis of evolutionary diversity optimization for permutation problems

A Do, M Guo, A Neumann, F Neumann - ACM Transactions on …, 2022 - dl.acm.org
Generating diverse populations of high-quality solutions has gained interest as a promising
extension to the traditional optimization tasks. This work contributes to this line of research …

The chance constrained travelling thief problem: Problem formulations and algorithms

T Pathirage Don, A Neumann, F Neumann - Proceedings of the Genetic …, 2024 - dl.acm.org
The travelling thief problem (TTP) is a multi-component combinatorial optimization problem
that has gained significant attention in the evolutionary computation and heuristic search …

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 …

Evolving reliable differentiating constraints for the chance-constrained maximum coverage problem

S Sadeghi Ahouei, J De Nobel, A Neumann… - Proceedings of the …, 2024 - dl.acm.org
Chance-constrained problems involve stochastic components in the constraints which can
be violated with a small probability. We investigate the impact of different types of chance …

Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multiobjective Algorithms

A Neumann, F Neumann - Evolutionary Computation, 2024 - direct.mit.edu
Many real-world optimization problems can be stated in terms of submodular functions.
Furthermore, these real-world problems often involve uncertainties which may lead to the …

Sampling-based Pareto optimization for chance-constrained monotone submodular problems

X Yan, A Neumann, F Neumann - Proceedings of the Genetic and …, 2024 - dl.acm.org
Recently surrogate functions based on the tail inequalities were developed to evaluate the
chance constraints in the context of evolutionary computation and several Pareto …

On the use of quality diversity algorithms for the travelling thief problem

A Nikfarjam, A Neumann, F Neumann - ACM Transactions on …, 2024 - dl.acm.org
In real-world optimisation, it is common to face several sub-problems interacting and forming
the main problem. There is an inter-dependency between the sub-problems, making it …