Return
Collaborative route optimization for efficient and constraint-aware express delivery using deep reinforcement learning
DOI:10.1016/j.neucom.2026.133451.png)
Abstract
En 中文
• Proposes a demand- and time-window-constrained K-means clustering algorithm to capture spatial–temporal order patterns in dynamic logistics systems. • Formulates collaborative courier scheduling as a multi-depot vehicle routing problem with simultaneous pickup–delivery and time windows (MDVRPSPDTW). • Develops a deep reinforcement learning-based encoder–decoder framework integrating graph neural networks, attention mechanisms, and REINFORCE optimization for adaptive, constraint-aware routing. • Achieves significant improvements over state-of-the-art routing strategies, demonstrating robust adaptability to real-world last-mile delivery dynamics.
Keywords:
demand-constrained clustering
time-window optimization
multi-depot vehicle routing
deep reinforcement learning
collaborative courier scheduling
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W

