10,000 optimal CVRP solutions for testing machine learning based heuristics
We introduce a benchmark of 10,000 instances with heterogeneous characteristics for the capacitated vehicle routing problem. We also provide optimal solutions for almost all of them along with a generator to produce additional training and validation data. This benchmark aims to permit a more systematic comparison of machine learning based search algorithms on this important problem. We also emit recommendations regarding the correct use of this dataset.
Code (0)
등록된 구현이 없습니다.
Tasks
2D Object Detection3D Point Cloud Reinforcement LearningBIG-bench Machine LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning to Deliver: a Foundation Model for the Montreal Capacitated Vehicle Routing Problem
In this paper, we present the Foundation Model for the Montreal Capacitated Vehicle Routing Problem (FM-MCVRP), a novel Deep Learning (DL) model that approximates high-quality solutions to a variant of the Capacitated Ve…
Language ModellingLarge Language ModelNeural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
Learning how to automatically solve optimization problems has the potential to provide the next big leap in optimization technology. The performance of automatically learned heuristics on routing problems has been steadi…
BIG-bench Machine LearningClustering Heuristics for Robust Energy Capacitated Vehicle Routing Problem (ECVRP)
The paper presents an approach to solving the Robust Energy Capacitated Vehicle Routing Problem (RECVRP), focusing on electric vehicles and their limited battery capacity. A finite number of customers, each with their ow…
ClusteringLearning Improvement Heuristics for Solving Routing Problems
Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality. Improvement heuristics have great potential to narrow this gap by it…
Deep Reinforcement LearningReinforcement LearningEnhancing CVRP Solver through LLM-driven Automatic Heuristic Design
The Capacitated Vehicle Routing Problem (CVRP), a fundamental combinatorial optimization challenge, focuses on optimizing fleet operations under vehicle capacity constraints. While extensively studied in operational rese…
Computational Efficiency