Corpus ID: 235790288

Learning to Delegate for Large-scale Vehicle Routing

  title={Learning to Delegate for Large-scale Vehicle Routing},
  author={Sirui Li and Zhongxia Yan and Cathy Wu},
Vehicle routing problems (VRPs) are a class of combinatorial problems with wide practical applications. While previous heuristic or learning-based works achieve decent solutions on small problem instances of up to 100 customers, their performance does not scale to large problems. This article presents a novel learningaugmented local search algorithm to solve large-scale VRP. The method iteratively improves the solution by identifying appropriate subproblems and delegating their improvement to a… Expand


Reinforcement Learning for Solving the Vehicle Routing Problem
This work presents an end-to-end framework for solving the Vehicle Routing Problem (VRP) using reinforcement learning, and demonstrates how this approach can handle problems with split delivery and explore the effect of such deliveries on the solution quality. Expand
A Learning-based Iterative Method for Solving Vehicle Routing Problems
This paper presents the first learning based approach for CVRP that is efficient in solving speed and at the same time outperforms OR methods, and achieves the new state-of-the-art results on CVRp. Expand
Efficiently solving very large-scale routing problems
This paper explores how to design a local search heuristic that computes good solutions for very large-scale instances of the capacitated vehicle routing problem in a reasonable computational time and introduces a new set of benchmark instances that contain up to 30,000 customers and use the heuristic to solve them. Expand
Attention, Learn to Solve Routing Problems!
A model based on attention layers with benefits over the Pointer Network is proposed and it is shown how to train this model using REINFORCE with a simple baseline based on a deterministic greedy rollout, which is more efficient than using a value function. Expand
POPMUSIC for the world location-routing problem
This article presents a method for generating an appropriate initial solution to the location-routing problem by producing in O (n3/2) an approximate solutions to the capacitated p-median problem. Expand
Learning to Perform Local Rewriting for Combinatorial Optimization
This paper proposes NeuRewriter, a policy to pick heuristics and rewrite the local components of the current solution to iteratively improve it until convergence, which captures the general structure of combinatorial problems and shows strong performance in three versatile tasks. Expand
New benchmark instances for the Capacitated Vehicle Routing Problem
This work proposes a new set of 100 instances ranging from 100 to 1000 customers, designed in order to provide a more comprehensive and balanced experimental setting, and reports an analysis on state-of-the-art exact and heuristic methods. Expand
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
This work uses a local search method that is analogous to the shuffling technique of job-shop scheduling, and so meshes well with constraint programming technology, to solve vehicle routing problems. Expand
2-Path Cuts for the Vehicle Routing Problem with Time Windows
A strong valid inequality, the 2-path cut, is introduced to produce better lower bounds for the vehicle routing problem with time windows and an effective separation algorithm to find such inequalities is developed. Expand
A sweep-based algorithm for the fleet size and mix vehicle routing problem
Results on a set of benchmark test problems show that the proposed heuristic produces excellent solutions in short computing times, and produced new best-known solutions for three of the test problems. Expand