arrow
Return

Collaborative route optimization for efficient and constraint-aware express delivery using deep reinforcement learning

delete2026-03-25
delete0
PRE
AI
H
Haoqiang Liu
H
Huiming Chen
Z
Zhaobin Wei
Q
Qi Shi
W
Wenzhen Huang *
W
Witold Pedrycz
DOI:10.1016/j.neucom.2026.133451delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

T
Tsinghua University
Scholars:
8.6K
Papers: 4.1K
Citations: 17.7W
U
university of alberta
Scholars:
5.1W
Papers: 4.9W
Citations: 65
S
Sichuan University
Scholars:
1.4W
Papers: 4.3K
Citations: 12.9W
U
university of science and technology beijing
Scholars:
1.2W
Papers: 4.4K
Citations: 2
researcher View more organizations