11 citations · 32 across the 17 of their papers we have counts for
13 papers · 1 filter
Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems
Aneta Neumann, Jakob Bossek, Frank Neumann
Submodular functions allow to model many real-world optimisation problems. This paper introduces approaches for computing diverse sets of high quality solutions for submodular opti…
Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
Jakob Bossek, Frank Neumann
In the area of evolutionary computation the calculation of diverse sets of high-quality solutions to a given optimization problem has gained momentum in recent years under the term…
Benchmarking in Optimization: Best Practice and Open Issues
Thomas Bartz-Beielstein, Carola Doerr, Daan van den Berg +14
This survey compiles ideas and recommendations from more than a dozen researchers with different backgrounds and from different institutes around the world. Promoting best practice…
Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem
Moritz Seiler, Janina Pohl, Jakob Bossek +2
In this work we focus on the well-known Euclidean Traveling Salesperson Problem (TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in the context of per-i…
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions
Jakob Bossek, Aneta Neumann, Frank Neumann
The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting componen…
Dynamic Bi-Objective Routing of Multiple Vehicles
Jakob Bossek, Christian Grimme, Heike Trautmann
In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours…