mlsanityData to 7 Oct 2026

GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time

arXiv 2312.08224 ↗First posted 13 Dec 2023cs.AI cs.LGcited by 82

Not on the map. Why?

Abstract (arXiv)

The recent end-to-end neural solvers have shown promise for small-scale routing problems but suffered from limited real-time scaling-up performance. This paper proposes GLOP (Global and Local Optimization Policies), a unified hierarchical framework that efficiently scales toward large-scale routing problems. GLOP partitions large routing problems into Travelling Salesman Problems (TSPs) and TSPs into Shortest Hamiltonian Path Problems. For the first time, we hybridize non-autoregressive neural heuristics for coarse-grained problem partitions and autoregressive neural heuristics for fine-grained route constructions, leveraging the scalability of the former and the meticulousness of the latter. Experimental results show that GLOP achieves competitive and state-of-the-art real-time performance on large-scale routing problems, including TSP, ATSP, CVRP, and PCTSP.

Key facts. Cited by 82 papers in the map (data through 7 Oct 2026). Builds on 33 of its 58 references that are in the map. First posted on arXiv 13 Dec 2023.

Builds on

33 of 58 references.

References · 33

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  3. 2015Pointer Networkscited by 882
  4. 2018Attention, Learn to Solve Routing Problems!cited by 646
  5. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  6. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 341
  7. 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 265
  8. 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 235
  9. 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
  10. 2018Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Searchcited by 182
  11. 2019Learning Improvement Heuristics for Solving Routing Problemscited by 162
  12. 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 161
21 more
  1. 2022Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimizationcited by 118
  2. 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
  3. 2021Learning to Delegate for Large-scale Vehicle Routingcited by 108
  4. 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
  5. 2020Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learningcited by 100
  6. 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
  7. 2020Learning the Travelling Salesperson Problem Requires Rethinking Generalizationcited by 96
  8. 2021Matrix Encoding Networks for Neural Combinatorial Optimizationcited by 89
  9. 2021Learning Collaborative Policies to Solve NP-hard Routing Problemscited by 86
  10. 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
  11. 2023Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Optcited by 81
  12. 2019Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learningcited by 78
  13. 2023RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmarkcited by 70
  14. 2022Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillationcited by 61
  15. 2021The Transformer Network for the Traveling Salesman Problemcited by 59
  16. 2021Learning Large Neighborhood Search Policy for Integer Programmingcited by 35
  17. 2022Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculumcited by 27
  18. 2022Learning to Solve Vehicle Routing Problems: A Surveycited by 16
  19. 2023Reinforcement Graph Clustering with Unknown Cluster Numbercited by 16
  20. 2021A Game-Theoretic Approach for Improving Generalization Ability of TSP Solverscited by 14
  21. 2021Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problemscited by 13

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 21; 2025: 31; 2026: 30.

82 papers.

Sort:

By area:

  1. 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 266
  2. 2024RouteFinder: Towards Foundation Models for Vehicle Routing Problemscited by 54
  3. 2024Ant Colony Sampling with GFlowNets for Combinatorial Optimizationcited by 53
  4. 2024INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformercited by 43
  5. 2025Rethinking Light Decoder-based Solvers for Vehicle Routing Problemscited by 36
  6. 2024Self-Improved Learning for Scalable Neural Combinatorial Optimizationcited by 29
  7. 2024Learning to Handle Complex Constraints for Vehicle Routing Problemscited by 29
  8. 2024Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problemscited by 24
  9. 2024Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectivescited by 23
  10. 2024Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problemscited by 15
  11. 2025Neural Deconstruction Search for Vehicle Routing Problemscited by 15
  12. 2025Destroy and Repair Using Hyper Graphs for Routingcited by 14
38 more
  1. 2025Learning to Reduce Search Space for Generalizable Neural Routing Solvercited by 14
  2. 2025MTL-KD: Multi-Task Learning Via Knowledge Distillation for Generalizable Neural Vehicle Routing Solvercited by 13
  3. 2025Improving Generalization of Neural Combinatorial Optimization for Vehicle Routing Problems via Test-Time Projection Learningcited by 12
  4. 2024DISCO: Efficient Diffusion Solver for Large-Scale Combinatorial Optimization Problemscited by 10
  5. 2025RRNCO: Towards Real-World Routing with Neural Combinatorial Optimizationcited by 10
  6. 2025Learning to Insert for Constructive Neural Vehicle Routing Solvercited by 10
  7. 2024Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solvercited by 9
  8. 2024Hierarchical Neural Constructive Solver for Real-world TSP Scenarioscited by 9
  9. 2024Collaboration! Towards Robust Neural Methods for Routing Problemscited by 9
  10. 2024Ensembling Prioritized Hybrid Policies for Multi-agent Pathfindingcited by 7
  11. 2024A GREAT Architecture for Edge-Based Graph Problems Like TSPcited by 7
  12. 2024PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimizationcited by 7
  13. 2025Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Schedulingcited by 7
  14. 2025URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalizationcited by 7
  15. 2025Hybrid-Balance GFlowNet for Solving Vehicle Routing Problemscited by 7
  16. 2025Multi-Task Vehicle Routing Solver via Mixture of Specialized Experts under State-Decomposable MDPcited by 7
  17. 2026RADAR: Learning to Route with Asymmetry-aware DistAnce Representationscited by 7
  18. 2024Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and Morecited by 6
  19. 2025Learning for routing: A guided review of recent developments and future directionscited by 6
  20. 2025VRPAgent: LLM-Driven Discovery of Heuristic Operators for Vehicle Routing Problemscited by 6
  21. 2024Neural Solver Selection for Combinatorial Optimizationcited by 5
  22. 2025Learning to Segment for Vehicle Routing Problemscited by 5
  23. 2026Survey on Neural Routing Solverscited by 4
  24. 2024Beyond the Heatmap: A Rigorous Evaluation of Component Impact in MCTS-Based TSP Solverscited by 3
  25. 2025GELD: A Unified Neural Model for Efficiently Solving Traveling Salesman Problems Across Different Scalescited by 3
  26. 2025Efficient Neural Combinatorial Optimization Solver for the Min-max Heterogeneous Capacitated Vehicle Routing Problemcited by 3
  27. 2025Probing Neural Combinatorial Optimization Modelscited by 3
  28. 2025LocalEscaper: A Weakly-supervised Framework with Regional Reconstruction for Scalable Neural TSP Solverscited by 2
  29. 2025DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matchingcited by 2
  30. 2025Beyond Simple Graphs: Neural Multi-Objective Routing on Multigraphscited by 2
  31. 2026Towards Efficient Constraint Handling in Neural Solvers for Routing Problemscited by 2
  32. 2026Chain-of-Context Learning: Dynamic Constraint Understanding for Multi-Task VRPscited by 2
  33. 2024DeepMDV: Global Spatial Matching for Multi-depot Vehicle Routing Problemscited by 1
  34. 2024IDEQ -- Improving Diffusion Models for the Traveling Salesman Problem (TSP) by Leveraging the Structure of the Solution Spacecited by 1
  35. 2025ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimizationcited by 1
  36. 2025Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problemscited by 1
  37. 2025Recurrent State Encoders for Efficient Neural Combinatorial Optimizationcited by 1
  38. 2025ViTSP: A Vision Language Models Guided Framework for Solving Large-Scale Traveling Salesman Problemscited by 1

50 most cited of 82 All 82 (JSON)