2000 character limit reached
Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problems (2401.06979v1)
Published 13 Jan 2024 in cs.AI and cs.LG
Abstract: Neural solvers based on attention mechanism have demonstrated remarkable effectiveness in solving vehicle routing problems. However, in the generalization process from small scale to large scale, we find a phenomenon of the dispersion of attention scores in existing neural solvers, which leads to poor performance. To address this issue, this paper proposes a distance-aware attention reshaping method, assisting neural solvers in solving large-scale vehicle routing problems. Specifically, without the need for additional training, we utilize the Euclidean distance information between current nodes to adjust attention scores. This enables a neural solver trained on small-scale instances to make rational choices when solving a large-scale problem. Experimental results show that the proposed method significantly outperforms existing state-of-the-art neural solvers on the large-scale CVRPLib dataset.
- A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems. Transportation Science, 55(4):832–856, 2021.
- Efficiently solving very large-scale routing problems. Computers & operations research, 107:32–42, 2019.
- Exploratory combinatorial optimization with reinforcement learning. In Proceedings of the AAAI conference on artificial intelligence, volume 34, pages 3243–3250, 2020.
- Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940, 2016.
- Machine learning for combinatorial optimization: a methodological tour d’horizon. European Journal of Operational Research, 290(2):405–421, 2021.
- Rl4co: an extensive reinforcement learning for combinatorial optimization benchmark. arXiv preprint arXiv:2306.17100, 2023.
- Learning generalizable models for vehicle routing problems via knowledge distillation. Advances in Neural Information Processing Systems, 35:31226–31238, 2022.
- The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012, 2021.
- Learning to perform local rewriting for combinatorial optimization. Advances in Neural Information Processing Systems, 32:6281–6292, 2019.
- Simulation-guided beam search for neural combinatorial optimization. Advances in Neural Information Processing Systems, 35:8760–8772, 2022.
- Bq-nco: Bisimulation quotienting for generalizable neural combinatorial optimization. arXiv preprint arXiv:2301.03313, 2023.
- Generalize a small pre-trained model to arbitrarily large tsp instances. In Proceedings of the AAAI conference on artificial intelligence, volume 35, pages 7474–7482, 2021.
- Towards generalizable neural solvers for vehicle routing problems via ensemble with transferrable local policy. arXiv preprint arXiv:2308.14104, 2023.
- Keld Helsgaun. An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University, 12, 2017.
- Efficient active search for combinatorial optimization problems. arXiv preprint arXiv:2106.05126, 2021.
- Generalize learned heuristics to solve large-scale vehicle routing problems in real-time. In The Eleventh International Conference on Learning Representations, 2022.
- Ensemble-based deep reinforcement learning for vehicle routing problems under distribution shift. In Thirty-seventh Conference on Neural Information Processing Systems, 2023.
- Multi-view graph contrastive learning for solving vehicle routing problems. In Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, volume 216, pages 984–994, 2023.
- Pointerformer: deep reinforced multi-pointer transformer for the traveling salesman problem. arXiv preprint arXiv:2304.09407, 2023.
- Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems, 30:6351–6361, 2017.
- Learning collaborative policies to solve np-hard routing problems. Advances in Neural Information Processing Systems, 34:10418–10430, 2021.
- Sym-nco: Leveraging symmetricity for neural combinatorial optimization. Advances in Neural Information Processing Systems, 35:1936–1949, 2022.
- Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. Operational research, pages 1–30, 2020.
- Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475, 2018.
- Pomo: Policy optimization with multiple optima for reinforcement learning. Advances in Neural Information Processing Systems, 33:21188–21198, 2020.
- Learning to delegate for large-scale vehicle routing. Advances in Neural Information Processing Systems, 34:26198–26211, 2021.
- From distribution learning in training to gradient search in testing for combinatorial optimization. In Advances in Neural Information Processing Systems, 2023.
- How good is neural combinatorial optimization? a systematic evaluation on the traveling salesman problem. IEEE Computational Intelligence Magazine, 18(3):14–28, 2023.
- Neural combinatorial optimization with heavy decoder: Toward large scale generalization. arXiv preprint arXiv:2310.07985, 2023.
- A prediction-and-scheduling framework for efficient order transfer in logistics. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, pages 6130–6137, 2023.
- Learning to iteratively solve routing problems with dual-aspect collaborative transformer. Advances in Neural Information Processing Systems, 34:11096–11107, 2021.
- Vehicle routing problems over time: a survey. Annals of Operations Research, 314(1):255–275, 2022.
- H-tsp: Hierarchically solving the large-scale travelling salesman problem. arXiv preprint arXiv:2304.09395, 2023.
- New benchmark instances for the capacitated vehicle routing problem. European Journal of Operational Research, 257(3):845–858, 2017.
- Attention is all you need. Advances in neural information processing systems, 30:6000–6010, 2017.
- Thibaut Vidal. Hybrid genetic search for the cvrp: Open-source implementation and swap* neighborhood. Computers & Operations Research, 140:105643, 2022.
- Pointer networks. Advances in neural information processing systems, 28:2692–2700, 2015.
- Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 8:229–256, 1992.
- Learning improvement heuristics for solving routing problems. IEEE transactions on neural networks and learning systems, 33(9):5057–5069, 2021.
- Glop: Learning global partition and local construction for solving large-scale routing problems in real-time. arXiv preprint arXiv:2312.08224, 2023.
- Neural tsp solver with progressive distillation. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 12147–12154, 2023.
- Towards omni-generalizable neural methods for vehicle routing problems. arXiv preprint arXiv:2305.19587, 2023.
- Rbg: Hierarchically solving large-scale routing problems in logistic systems via reinforcement learning. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 4648–4658, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.