Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach

•The location-routing problem of mobile parcel lockers is investigated while considering customers' changing demand patterns.•Introduce a mixed integer programming model and design dynamic route adjustment strategies to resolve conflict scenarios.•Design a novel Q-Learning algorithm to solve th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation research. Part E, Logistics and transportation review Logistics and transportation review, 2023-09, Vol.177, p.103234, Article 103234
Hauptverfasser: Liu, Yubin, Ye, Qiming, Escribano-Macias, Jose, Feng, Yuxiang, Candela, Eduardo, Angeloudis, Panagiotis
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•The location-routing problem of mobile parcel lockers is investigated while considering customers' changing demand patterns.•Introduce a mixed integer programming model and design dynamic route adjustment strategies to resolve conflict scenarios.•Design a novel Q-Learning algorithm to solve the route planning model in large problem instances with performance guarantees.•Provide managerial implications for stakeholders of the market based on parametric analysis of key operational indicators. Mobile parcel lockers (MPLs) have been recently proposed by logistics operators as a technology that could help reduce traffic congestion and operational costs in urban freight distribution. Given their ability to relocate throughout their area of deployment, they hold the potential to improve customer accessibility and convenience. In this study, we formulate the Mobile Parcel Locker Problem (MPLP), a special case of the Location-Routing Problem (LRP) which determines the optimal stopover location for MPLs throughout the day and plans corresponding delivery routes. A Hybrid Q-Learning-Network-based Method (HQM) is developed to resolve the computational complexity of the resulting large problem instances while escaping local optima. In addition, the HQM is integrated with global and local search mechanisms to resolve the dilemma of exploration and exploitation faced by classic reinforcement learning (RL) methods. We examine the performance of HQM under different problem sizes (up to 200 nodes) and benchmarked it against the exact approach and Genetic Algorithm (GA). Our results indicate that HQM achieves better optimisation performance with shorter computation time than the exact approach solved by the Gurobi solver in large problem instances. Additionally, the average reward obtained by HQM is 1.96 times greater than GA’s, which demonstrates that HQM has a better optimisation ability. Further, we identify critical factors that contribute to fleet size requirements, travel distances, and service delays. Our findings outline that the efficiency of MPLs is mainly contingent on the length of time windows and the deployment of MPL stopovers. Finally, we highlight managerial implications based on parametric analysis to provide guidance for logistics operators in the context of efficient last-mile distribution operations.
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2023.103234