Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

RouteFinder: Towards Foundation Models for Vehicle Routing Problems

About

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 different attributes. We propose a unified VRP environment capable of efficiently handling any combination of these attributes. The RouteFinder model leverages a modern transformer-based encoder and global attribute embeddings to improve task representation. Additionally, we introduce two reinforcement learning techniques to enhance multi-task performance: mixed batch training, which enables training on different variants at once, and multi-variant reward normalization to balance different reward scales. Finally, we propose efficient adapter layers that enable fine-tuning for new variants with unseen attributes. Extensive experiments on 48 VRP variants show RouteFinder outperforms recent state-of-the-art learning methods. Our code is publicly available at https://github.com/ai4co/routefinder.

Federico Berto, Chuanbo Hua, Nayeli Gast Zepeda, Andr\'e Hottung, Niels Wouda, Leon Lan, Junyoung Park, Kevin Tierney, Jinkyoo Park• 2024

Related benchmarks

TaskDatasetResultRank
Capacitated Vehicle Routing ProblemCVRP N=100
Objective Value15.86
73
Vehicle Routing Problem with Time WindowsVRPTW 100 customers
Objective Value26.228
24
Asymmetric Capacitated Vehicle Routing ProblemReal-world ACVRP Out-of-distribution cluster
Cost34.273
22
Asymmetric Capacitated Vehicle Routing ProblemReal-world ACVRP In-distribution
Cost86.289
22
Asymmetric Capacitated Vehicle Routing ProblemReal-world ACVRP Out-of-distribution city
Cost86.261
22
Heterogeneous Fleet Open Vehicle Routing ProblemHFOVRP N=50, K=20 (test)
Objective Value2.79
20
Heterogeneous Fleet Capacitated Vehicle Routing ProblemHFCVRP (N=50, K=20) (test)
Objective Value3.78
20
Heterogeneous Fleet Vehicle Routing ProblemHFCVRP (N=80, K=30)
Objective Value5.29
20
Vehicle Routing ProblemOCVRP 48 standard 100-node benchmark instances
Objective Value10.18
18
Vehicle Routing ProblemOVRP n=100
Time (m)0.15
17
Showing 10 of 117 rows
...

Other info

Follow for update