| 1 |
Zhao J Y, Su Y H, Xiao M Y. Improved approximation algorithms for the multiple-depot split delivery vehicle routing problem [PP/OL]. V1. arXiv (2026-01-05)[2026-07-12]. https://doi.org/10.48550/arXiv.2601.01841.
|
| 2 |
Wang Y S, Tong Y X, Long C, et al. Adaptive dynamic bipartite graph matching: a reinforcement learning approach [C]//Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE). IEEE, 2019: 1478-1489.
|
| 3 |
Liang Y L, Luo H C, Duan H N, et al.. Meituan’s real-time intelligent dispatching algorithms build the world’s largest minute-level delivery network. INFORMS Journal on Applied Analytics, 2024, 54 (1): 84- 101.
|
| 4 |
Bester C J, James S D, Konidaris G D. Multi-pass Q-networks for deep reinforcement learning with parameterised action spaces [PP/OL]. V1. arXiv (2019-05-10)[2026-07-12]. https://doi.org/10.48550/arXiv.1905.04388.
|
| 5 |
Ombuki B, Ross B J, Hanshar F.. Multi-objective genetic algorithms for vehicle routing problem with time windows. Applied Intelligence, 2006, 24 (1): 17- 30.
|
| 6 |
Jiang X, Wu Y, Zhang C, et al. DRoC: elevating large language models for complex vehicle routing via decomposed retrieval of constraints [C]//Proceedings of the 13th International Conference on Learning Representations (ICLR). 2025: 76603-76625.
|
| 7 |
Naqvi S M R, Ghufran M, Varnier C, et al. Unlocking maintenance insights in industrial text through semantic search [J]. Computers in Industry, 2024, 157/158: 104083-104099.
|
| 8 |
Lekhtman E, Ziser Y, Reichart R. DILBERT: customized pre-training for domain adaptation with category shift, with an application to aspect extraction [C]//Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing (EMNLP). Association for Computational Linguistics, 2021: 219-230.
|
| 9 |
Hrabec D, Hvattum L M, Hoff A.. The value of integrated planning for production, inventory, and routing decisions: a systematic review and meta-analysis. International Journal of Production Economics, 2022, 248, 108468- 108480.
|
| 10 |
Li W L, Gao G J.. Research on multi-product order splitting and distribution route optimization of “multi-warehouse in one place”. Frontiers in Business, Economics and Management, 2023, 8 (3): 1- 8.
|
| 11 |
Prins C, Lacomme P, Prodhon C.. Order-first split-second methods for vehicle routing problems: a review. Transportation Research Part C: Emerging Technologies, 2014, 40, 179- 200.
|
| 12 |
Chen Z Y, Yang M K, Guo Y J, et al.. The split delivery vehicle routing problem with three-dimensional loading and time windows constraints. Sustainability, 2020, 12 (17): 545- 558.
|
| 13 |
Bortfeldt A, Yi J M.. The split delivery vehicle routing problem with three-dimensional loading constraints. European Journal of Operational Research, 2020, 282 (2): 545- 558.
|
| 14 |
Jiang X, Wu Y X, Li M S, et al. Large language models as end-to-end combinatorial optimization solvers [C]//Proceedings of the Thirty-Ninth Annual Conference on Neural Information Processing Systems (NeurIPS). 2025: 164787-164826.
|
| 15 |
Kuhn H, Schubert D, Holzapfel A.. Integrated order batching and vehicle routing operations in grocery retail—a general adaptive large neighborhood search algorithm. European Journal of Operational Research, 2021, 294 (3): 1003- 1021.
|
| 16 |
Hu Y L, Feng S Y, Li S.. BMG-Q: localized bipartite match graph attention Q-learning for ride-pooling order dispatch. IEEE Transactions on Intelligent Transportation Systems, 2025, 26 (10): 15407- 15421.
|
| 17 |
Solomon M M.. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 1987, 35 (2): 254- 265.
|