Optimizing routing for autonomous delivery and pickup vehicles in three-dimensional space
Qi Hong , Hongyi Zhao , Shiyu Chen , Aya Selmoune , Kai Huang
Electronic Research Archive ›› 2025, Vol. 33 ›› Issue (4) : 2668 -2697.
The last-mile delivery challenge in three-dimensional (3D) multi-floor building environments has a significant impact on logistics efficiency. Although autonomous delivery robots (ADRs) have been widely adopted to address last-mile logistics, most existing studies focus on optimizing ADR routing in simplified two-dimensional environments. Moreover, optimal layout of goods within the robot’s physical containers brings another challenge. Hence, this paper formalizes the Discrete Capacity Vehicle Routing Problem with Simultaneous Delivery-Pickup and Soft Time Windows (DCVRP-SDP-STW) in a 3D environment. To achieve high-quality solutions, we propose an improved ant colony optimization algorithm that considers spatiotemporal multi-stage clustering characteristics, leading to a significant reduction in computation time. A data preprocessing framework is also developed to convert real-world architectural topologies into navigable 3D routing networks. To validate the proposed model and algorithm, we conducted a case study in Nanjing. The results show that the algorithm can improve optimization outcomes by 23% to 94% compared to pre-optimization results based on the proximity principle, which can contribute to the advancement of efficient and intelligent autonomous delivery systems.
last-mile delivery / urban logistics / spatiotemporal clustering / hybrid algorithm / vehicle routing problem
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
/
| 〈 |
|
〉 |