122 citations · 279 across the 10 of their papers we have counts for
5 papers · 1 filter
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration
Jasmin Brandt, Elias Schede, Viktor Bengs +3
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter configuration of a given target algorithm in an automated way. Recently, there ha…
Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
Jakob Pfrommer, Anne Meyer, Kevin Tierney
Block stacking storage systems are highly adaptable warehouse systems with low investment costs. With multiple, deep lanes they can achieve high storage densities, but accessing so…
Simulation-guided Beam Search for Neural Combinatorial Optimization
Jinho Choo, Yeong-Dae Kwon, Jihoon Kim +4
Neural approaches for combinatorial optimization (CO) equip a learning mechanism to discover powerful heuristics for solving complex real-world problems. While neural approaches ca…
A Survey of Methods for Automated Algorithm Configuration
Elias Schede, Jasmin Brandt, Alexander Tornede +4
Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There is currently a wide variety of A…
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar +19
This paper reports on the first international competition on AI for the traveling salesman problem (TSP) at the International Joint Conference on Artificial Intelligence 2021 (IJCA…