2 papers
cs.NE2024
Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem
Kokila Kasuni Perera, Aneta Neumann
Evolutionary algorithms are particularly effective for optimisation problems with dynamic and stochastic components. We propose multi-objective evolutionary approaches for the knap…
cs.NE2022
Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem
Adel Nikfarjam, Aneta Neumann, Jakob Bossek +1
Recently different evolutionary computation approaches have been developed that generate sets of high quality diverse solutions for a given optimisation problem. Many studies have…