TY - GEN
T1 - REDE
T2 - 39th IEEE International Conference on Data Engineering, ICDE 2023
AU - Lyu, Wenjun
AU - Wang, Haotian
AU - Hong, Zhiqing
AU - Wang, Guang
AU - Yang, Yu
AU - Liu, Yunhuai
AU - Zhang, Desheng
N1 - Publisher Copyright: © 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Last-mile delivery from delivery stations to customers' places is now mainly finished by dedicated couriers. In practice, each courier generally collects orders destined for one delivery area at the delivery station and delivers orders to customers. However, the long distance between the delivery station and the delivery area due to practical reasons, e.g., expensive delivery station rental fee in the downtown area, increases the delivery courier's travel time and decreases the efficiency of the state-of-the-practice last-mile delivery scheme. In this paper, we solve the problem with relay transportation, where a relay courier collects orders at the delivery station and sends them to delivery couriers, and delivery couriers focus on the order delivery at corresponding delivery areas. We design a real-time relay courier scheduling system called REDE to minimize the average relay order delivery time (ARODT) considering the relay and delivery couriers' mobility and the order destination distribution. First, a heterogeneous task aware route prediction algorithm is proposed to characterize the delivery courier's mobility. Then a distance-aware greedy algorithm and an ARODT-constrained exchange algorithm are designed to generate the relay route, which is updated with real-time order pickup requests. Extensive evaluation results with real-world logistics data from 100 delivery stations in 38 cities show that REDE reduces ARODT by up to 8.4% compared to baseline methods. The online A/B tests show that compared to the state-of-the-practice method, REDE improves the delivery courier's working efficiency and the daily number of pickup orders by 20.13% and 4.51%, respectively.
AB - Last-mile delivery from delivery stations to customers' places is now mainly finished by dedicated couriers. In practice, each courier generally collects orders destined for one delivery area at the delivery station and delivers orders to customers. However, the long distance between the delivery station and the delivery area due to practical reasons, e.g., expensive delivery station rental fee in the downtown area, increases the delivery courier's travel time and decreases the efficiency of the state-of-the-practice last-mile delivery scheme. In this paper, we solve the problem with relay transportation, where a relay courier collects orders at the delivery station and sends them to delivery couriers, and delivery couriers focus on the order delivery at corresponding delivery areas. We design a real-time relay courier scheduling system called REDE to minimize the average relay order delivery time (ARODT) considering the relay and delivery couriers' mobility and the order destination distribution. First, a heterogeneous task aware route prediction algorithm is proposed to characterize the delivery courier's mobility. Then a distance-aware greedy algorithm and an ARODT-constrained exchange algorithm are designed to generate the relay route, which is updated with real-time order pickup requests. Extensive evaluation results with real-world logistics data from 100 delivery stations in 38 cities show that REDE reduces ARODT by up to 8.4% compared to baseline methods. The online A/B tests show that compared to the state-of-the-practice method, REDE improves the delivery courier's working efficiency and the daily number of pickup orders by 20.13% and 4.51%, respectively.
KW - Courier mobility
KW - Last-mile delivery
KW - Relay courier scheduling
UR - https://www.scopus.com/pages/publications/85167651700
UR - https://www.scopus.com/pages/publications/85167651700#tab=citedBy
U2 - 10.1109/ICDE55515.2023.00230
DO - 10.1109/ICDE55515.2023.00230
M3 - Conference contribution
T3 - Proceedings - International Conference on Data Engineering
SP - 3003
EP - 3016
BT - Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023
PB - IEEE Computer Society
Y2 - 3 April 2023 through 7 April 2023
ER -