mlsanityData to 14 Oct 2026

Neuro CROSS exchange: Learning to CROSS exchange to solve realistic vehicle routing problems

arXiv 2206.02771 ↗First posted 6 Jun 2022cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

CROSS exchange (CE), a meta-heuristic that solves various vehicle routing problems (VRPs), improves the solutions of VRPs by swapping the sub-tours of the vehicles. Inspired by CE, we propose Neuro CE (NCE), a fundamental operator of learned meta-heuristic, to solve various VRPs while overcoming the limitations of CE (i.e., the expensive O(n4) search cost). NCE employs a graph neural network to predict the cost-decrements (i.e., results of CE searches) and utilizes the predicted cost-decrements as guidance for search to decrease the search cost to O(n2). As the learning objective of NCE is to predict the cost-decrement, the training can be simply done in a supervised fashion, whose training samples can be prepared effortlessly. Despite the simplicity of NCE, numerical results show that the NCE trained with flexible multi-depot VRP (FMDVRP) outperforms the meta-heuristic baselines. More importantly, it significantly outperforms the neural baselines when solving distinctive special cases of FMDVRP (e.g., MDVRP, mTSP, CVRP) without additional training.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 18 of its 33 references that are in the map. First posted on arXiv 6 Jun 2022.

Builds on

18 of 33 references.

References · 18

  1. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  2. 2015Pointer Networkscited by 895
  3. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
  4. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
  5. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
  6. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
  7. 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 269
  8. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
  9. 2018Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Searchcited by 183
  10. 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
  11. 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
  12. 2021Learning to Delegate for Large-scale Vehicle Routingcited by 109
6 more
  1. 2021NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problemcited by 103
  2. 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
  3. 2021Deep Policy Dynamic Programming for Vehicle Routing Problemscited by 94
  4. 2021Learning Collaborative Policies to Solve NP-hard Routing Problemscited by 86
  5. 2021ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learningcited by 31
  6. 2020Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attentioncited by 29

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1.

2 papers.