Glop: Learning global partition and local construction for solving large-scale routing problems in real-time

H Ye, J Wang, H Liang, Z Cao, Y Li, F Li - Proceedings of the AAAI …, 2024 - ojs.aaai.org
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 …

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

X Wu, D Wang, L Wen, Y Xiao, C Wu, Y Wu… - arXiv preprint arXiv …, 2024 - arxiv.org
Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically
designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing …

Reevo: Large language models as hyper-heuristics with reflective evolution

H Ye, J Wang, Z Cao, G Song - arXiv preprint arXiv:2402.01145, 2024 - arxiv.org
The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain
experts to engage in trial-and-error heuristic design process. The long-standing endeavor of …

MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts

J Zhou, Z Cao, Y Wu, W Song, Y Ma, J Zhang… - arXiv preprint arXiv …, 2024 - arxiv.org
Learning to solve vehicle routing problems (VRPs) has garnered much attention. However,
most neural solvers are only structured and trained independently on a specific problem …

Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problems

Y Wang, YH Jia, WN Chen, Y Mei - arXiv preprint arXiv:2401.06979, 2024 - arxiv.org
Neural solvers based on attention mechanism have demonstrated remarkable effectiveness
in solving vehicle routing problems. However, in the generalization process from small scale …

Symmetric Replay Training: Enhancing Sample Efficiency in Deep Reinforcement Learning for Combinatorial Optimization

H Kim, M Kim, S Ahn, J Park - arXiv preprint arXiv:2306.01276, 2023 - arxiv.org
Deep reinforcement learning (DRL) has significantly advanced the field of combinatorial
optimization (CO). However, its practicality is hindered by the necessity for a large number of …