174 citations · 389 across the 26 of their papers we have counts for
5 papers · 1 filter
Dancing to the State of the Art? How Candidate Lists Influence LKH for Solving the Traveling Salesperson Problem
Jonathan Heins, Lennart Schäpermeier, Pascal Kerschke +1
Solving the Traveling Salesperson Problem (TSP) remains a persistent challenge, despite its fundamental role in numerous generalized applications in modern contexts. Heuristic solv…
Tools for Landscape Analysis of Optimisation Problems in Procedural Content Generation for Games
Vanessa Volz, Boris Naujoks, Pascal Kerschke +1
The term Procedural Content Generation (PCG) refers to the (semi-)automatic generation of game content by algorithmic means, and its methods are becoming increasingly popular in ga…
Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection
Jakob Bossek, Pascal Kerschke, Heike Trautmann
The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respe…
ASlib: A Benchmark Library for Algorithm Selection
Bernd Bischl, Pascal Kerschke, Lars Kotthoff +8
The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set…
Averaged Hausdorff Approximations of Pareto Fronts based on Multiobjective Estimation of Distribution Algorithms
Luis Marti, Christian Grimme, Pascal Kerschke +2
In the a posteriori approach of multiobjective optimization the Pareto front is approximated by a finite set of solutions in the objective space. The quality of the approximation c…