Search Results for author: Jonas K. Falkner

Found 9 papers, 6 papers with code

Too Big, so Fail? -- Enabling Neural Construction Methods to Solve Large-Scale Routing Problems

1 code implementation29 Sep 2023 Jonas K. Falkner, Lars Schmidt-Thieme

In recent years new deep learning approaches to solve combinatorial optimization problems, in particular NP-hard Vehicle Routing Problems (VRP), have been proposed.

Combinatorial Optimization

Neural Capacitated Clustering

1 code implementation10 Feb 2023 Jonas K. Falkner, Lars Schmidt-Thieme

Recent work on deep clustering has found new promising methods also for constrained clustering problems.

Constrained Clustering Deep Clustering

Attention, Filling in The Gaps for Generalization in Routing Problems

no code implementations14 Jul 2022 Ahmad Bdeir, Jonas K. Falkner, Lars Schmidt-Thieme

Machine Learning (ML) methods have become a useful tool for tackling vehicle routing problems, either in combination with popular heuristics or as standalone models.

Data Augmentation

Learning to Control Local Search for Combinatorial Optimization

1 code implementation27 Jun 2022 Jonas K. Falkner, Daniela Thyssens, Ahmad Bdeir, Lars Schmidt-Thieme

Combinatorial optimization problems are encountered in many practical contexts such as logistics and production, but exact solutions are particularly difficult to find and usually NP-hard for considerable problem sizes.

Combinatorial Optimization

Large Neighborhood Search based on Neural Construction Heuristics

1 code implementation2 May 2022 Jonas K. Falkner, Daniela Thyssens, Lars Schmidt-Thieme

The neural repair operator is combined with a local search routine, heuristic destruction operators and a selection procedure applied to a small population to arrive at a sophisticated solution approach.

reinforcement-learning Reinforcement Learning (RL)

RP-DQN: An application of Q-Learning to Vehicle Routing Problems

no code implementations25 Apr 2021 Ahmad Bdeir, Simon Boeder, Tim Dernedde, Kirill Tkachuk, Jonas K. Falkner, Lars Schmidt-Thieme

In this paper we present a new approach to tackle complex routing problems with an improved state representation that utilizes the model complexity better than previous methods.

BIG-bench Machine Learning Q-Learning

Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention

1 code implementation16 Jun 2020 Jonas K. Falkner, Lars Schmidt-Thieme

Many real-world vehicle routing problems involve rich sets of constraints with respect to the capacities of the vehicles, time windows for customers etc.

Cannot find the paper you are looking for? You can Submit a new open access paper.