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

Vision-Assisted Foundation Model for Solving Multi-Task Vehicle Routing Problems

About

Multi-task vehicle routing problems play a critical role in enhancing efficiency across various industries and service sectors. These problems consist of multiple variants that optimize routing costs while meeting diverse customer constraints. Existing multi-task VRP solvers solely utilize a graph-based modality, limiting their ability to address variants with multiple constraints. As a format to represent complex semantics, vision modality shows great potential for encoding diverse VRP constraints. This motivates us to learn patch-level semantics from the vision images, and then integrate them into a graph-based model to solve various VRP variants simultaneously. However, directly applying this approach to multi-task VRPs presents three challenges: 1) existing VRP images lack constraint representations, which are essential for multi-task VRPs, 2) the fixed receptive field of individual patches cannot effectively accommodate varying requirements across tasks, and 3) imbalanced pixel distribution among constraints may cause the model to overlook constraints with fewer pixels. In this paper, we propose a vision-assisted foundation model (VaFM) to address these challenges. In the vision modality, input images tailored to all constraints are encoded by a convolutional neural network. The obtained patch embeddings are fused with graph-based nodes to generate solutions, with an auxiliary task designed to address the pixel-imbalanced issue. The performance of VaFM is evaluated across 16 different VRP variants. The experimental results demonstrate the superiority of VaFM over state-of-the-art methods, especially for variants with complex constraints.

Shuangchun Gui, Zhiguang Cao, Wen Song, Yew-Soon Ong• 2026

Related benchmarks

TaskDatasetResultRank
Vehicle Routing ProblemSynthetic VRP Instances N=200 (test)
Objective Value15.552
68
Capacitated Vehicle Routing ProblemCVRPLib (test)
Average Gap2.832
45
Vehicle Routing Problem8 Unseen VRP Variants 1.0 (test)
Objective Value6.947
36
Capacitated Vehicle Routing ProblemCVRP N=50
Objective Value10.421
26
Capacitated Vehicle Routing ProblemCVRP N = 100 v1
Objective Value15.802
9
Vehicle Routing Problem with LIFO and Time WindowsVRPLTW N = 50 v1
Objective Value16.249
6
Open Vehicle Routing Problem with Backhauls (OVRPB)RouteFinder Newly generated v2 (test)
Gap2.355
4
Open Vehicle Routing Problem with Backhauls and LIFO (OVRPBL)RouteFinder Newly generated v2 (test)
Gap2.42
4
Open Vehicle Routing Problem with Backhauls and Time Windows (OVRPBTW)RouteFinder Newly generated 2 (test)
Gap1.092
4
Open Vehicle Routing Problem with Backhauls, LIFO, and Time Windows (OVRPBLTW)RouteFinder Newly generated instances v2 (test)
Gap1.102
4
Showing 10 of 23 rows

Other info

Follow for update