← Search

Kevin Tierney

7 accepted papers

2026

RouteFinder: Towards Foundation Models for Vehicle Routing Problems

ICML 2026poster

This paper introduces RouteFinder, a comprehensive foundation model framework to tackle different Vehicle Routing Problem (VRP) variants. Our core idea is that a foundation model for VRPs should be able to represent variants by treating each as a subset of a generalized problem equipped with differe…

Cited by 0SourcecodeScholar
2025

PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimization

ICLR 2025poster

Reinforcement learning-based methods for constructing solutions to combinatorial optimization problems are rapidly approaching the performance of human-designed algorithms. To further narrow the gap, learning-based approaches must efficiently explore the solution space during the search process. Rec…

Cited by 17SourcePDFScholar
2023

A Survey of Methods for Automated Algorithm Configuration (Extended Abstract)

IJCAI 2023poster

Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There are currently a wide variety of AC problem variants and methods proposed in the literature. Existing reviews do not take into account all derivatives of…

Cited by 0SourcePDFScholar
2023

AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration

AAAI 2023technical

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. Although this field of research has experienced much progress recently regarding approaches satisfying strong theoretical guarantees, ther…

2022

Efficient Active Search for Combinatorial Optimization Problems

ICLR 2022poster

Recently numerous machine learning based methods for combinatorial optimization problems have been proposed that learn to construct solutions in a sequential decision process via reinforcement learning. While these methods can be easily combined with search strategies like sampling and beam search,…

2022

Simulation-guided Beam Search for Neural Combinatorial Optimization

NeurIPS 2022accept

Neural approaches for combinatorial optimization (CO) equip a learning mechanism to discover powerful heuristics for solving complex real-world problems. While neural approaches capable of high-quality solutions in a single shot are emerging, state-of-the-art approaches are often unable to take full…

2021

Learning a Latent Search Space for Routing Problems using Variational Autoencoders

ICLR 2021poster

Methods for automatically learning to solve routing problems are rapidly improving in performance. While most of these methods excel at generating solutions quickly, they are unable to effectively utilize longer run times because they lack a sophisticated search component. We present a learning-base…

Cited by 90SourcePDFScholar