mlsanityData to 7 Oct 2026

Location-routing Optimisation for Urban Logistics Using Mobile Parcel Locker Based on Hybrid Q-Learning Algorithm

arXiv 2110.15485 ↗First posted 29 Oct 2021cs.LG cs.NEcited by 0

Not on the map. Why?

Abstract (arXiv)

Mobile parcel lockers (MPLs) have been recently introduced by urban logistics operators as a means to reduce traffic congestion and operational cost. Their capability to relocate their position during the day has the potential to improve customer accessibility and convenience (if deployed and planned accordingly), allowing customers to collect parcels at their preferred time among one of the multiple locations. This paper proposes an integer programming model to solve the Location Routing Problem for MPLs to determine the optimal configuration and locker routes. In solving this model, a Hybrid Q-Learning algorithm-based Method (HQM) integrated with global and local search mechanisms is developed, the performance of which is examined for different problem sizes and benchmarked with genetic algorithms. Furthermore, we introduced two route adjustment strategies to resolve stochastic events that may cause delays. The results show that HQM achieves 443.41% improvement on average in solution improvement, compared with the 94.91% improvement of heuristic counterparts, suggesting HQM enables a more efficient search for better solutions. Finally, we identify critical factors that contribute to service delays and investigate their effects.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 67 references that are in the map. First posted on arXiv 29 Oct 2021.

Builds on

12 of 67 references.

References · 12

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018Attention, Learn to Solve Routing Problems!cited by 646
  3. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  4. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  5. 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 235
  6. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 183
  7. 2017Safe Policy Improvement with Baseline Bootstrappingcited by 141
  8. 2021Learning to Delegate for Large-scale Vehicle Routingcited by 108
  9. 2019Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learningcited by 78
  10. 2020Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimizationcited by 63
  11. 2020Learn to Design the Heuristics for Vehicle Routing Problemcited by 24
  12. 2015Negatively Correlated Searchcited by 5

Built on by

Not cited yet.