1 citations · 1 across the 3 of their papers we have counts for
3 papers
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.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…