136 citations · 418 across the 27 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.NE2023
On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem
Jakob Bossek, Christian Grimme
We contribute to the efficient approximation of the Pareto-set for the classical -hard multi-objective minimum spanning tree problem (moMST) adopting evolutionary com…
cs.NE2023★ 1 cited
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem
Jakob Bossek, Aneta Neumann, Frank Neumann
Evolutionary algorithms have been shown to obtain good solutions for complex optimization problems in static and dynamic environments. It is important to understand the behaviour o…
cs.NE2023★ 4 cited
Runtime Analysis of Quality Diversity Algorithms
Jakob Bossek, Dirk Sudholt
Quality diversity~(QD) is a branch of evolutionary computation that gained increasing interest in recent years. The Map-Elites QD approach defines a feature space, i.e., a partitio…