Machine Learning-Enhanced Last-Mile Delivery Optimization: Integrating Deep Reinforcement Learning with Queueing Theory for Dynamic Vehicle Routing
Source abstract
Abstract
We present the ML-CALMO framework, which integrates machine learning with queueing theory for last-mile delivery optimization under dynamic conditions. The system combines Long Short-Term Memory (LSTM) demand forecasting, Convolutional Neural Network (CNN) traffic prediction, and Deep Q-Network (DQN)-based routing with theoretical stability guarantees. Evaluation on modern benchmarks, including the 2022 Multi-Depot Dynamic VRP with Stochastic Road Capacity (MDDVRPSRC) dataset and real-world compatible data from OSMnx-based spatial extraction, demonstrates measurable improvements: 18.5% reduction in delivery time and +8.9 pp (≈12.2% relative) gain in service efficiency compared to current state-of-the-art methods, with statistical significance (p < 0.01). Critical limitations include (1) computational requirements that necessitate mid-range GPU hardware, (2) performance degradation under rapid parameter changes (drift rate > 0.5/min), and (3) validation limited to simulation environments. The framework provides a foundation for integrating predictive machine learning with operational guarantees, though field deployment requires addressing identified scalability and robustness constraints. All code, data, and experimental configurations are publicly available for reproducibility.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Manufacturing and Logistics Optimization · Advanced Queuing Theory Analysis · Transportation and Mobility Innovations
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Industrial Engineering and Management, National Yang Ming Chiao Tung University, Hsinchu 300, Taiwan
Funding
National Science and Technology Council
References (22)
Show source-provided references
1. How to choose “last mile” delivery modes for e-fulfillment10.1155/2014/417129 ↗
2. Queueing network controls via deep reinforcement learning10.1287/stsy.2021.0081 ↗
3. Innovative solutions to increase last-mile delivery efficiency in B2C e-commerce: A literature review10.1108/IJPDLM-02-2019-0048 ↗
4. Networks of waiting lines10.1287/opre.5.4.518 ↗
5. Heavy traffic limits for queues with time-varying parameters
6. Jaiswal, N.K. (1968). Priority Queues, Academic Press.
7. Kleinrock, L. (1976). Queueing Systems, Volume II: Computer Applications, John Wiley & Sons.
8. Benchmark dataset for multi depot vehicle routing problem with road capacity and damage road consideration for humanitarian operation in critical supply delivery10.1016/j.dib.2022.107901 ↗
9. OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks10.1016/j.compenvurbsys.2017.05.004 ↗
10. Priority assignment in waiting line problems
11. Computation of steady-state probabilities for M/M/1 priority queues10.1287/opre.29.5.945 ↗
12. Takagi, H. (1991). Queueing Analysis: A Foundation of Performance Evaluation, North-Holland.
13. Learning-augmented queue control for multi-server systems
14. Simaiya, S., Lilhore, U.K., Sharma, Y.K., Rao, K.B.V.B., Maheswara Rao, V.V.R., Baliyan, A., Bijalwan, A., and Alroobaea, R. (2024). A hybrid cloud load balancing and host utilization prediction method using deep learning and optimization techniques. Sci. Rep., 14.10.1038/s41598-024-51466-0 ↗
15. Nazari, M., Oroojlooy, A., Snyder, L.V., and Takác, M. (2018, January 3–8). Reinforcement learning for solving the vehicle routing problem. Proceedings of the 32nd International Conference on Neural Information Processing Systems, Montréal, QC, Canada.
16. A stochastic and dynamic vehicle routing problem in the Euclidean plane10.1287/opre.39.4.601 ↗
17. Konovalenko, A., and Hvattum, L.M. (2024). Optimizing a dynamic vehicle routing problem with deep reinforcement learning. Logistics, 8.10.3390/logistics8040096 ↗
18. Reinforcement learning for logistics and supply chain management: Methodologies, state of the art, and future opportunities10.1016/j.tre.2022.102712 ↗
19. Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths10.1016/j.dib.2020.105142 ↗
20. Kool, W., van Hoof, H., and Welling, M. Attention, learn to solve routing problems! In Proceedings of the 7th International Conference on Learning Representations, New Orleans, LA, USA, 6–9 May 2019.
21. Reinforcement learning-based approach for dynamic vehicle routing problem with stochastic demand10.1016/j.cie.2023.109443 ↗
22. A reinforcement learning-Variable neighborhood search method for the capacitated Vehicle Routing Problem10.1016/j.eswa.2022.118812 ↗