REDE: Exploring Relay Transportation for Efficient Last-mile Delivery
Authors:
- 1 April 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3003-3016
Abstract
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.Keywords
Funding Information
- National Natural Science Foundation of China
This publication has 45 references indexed in Scilit:
- Towards Station-Level Demand Prediction for Effective Rebalancing in Bike-Sharing Systems2018
- A Survey on Task and Participant Matching in Mobile Crowd SensingJournal of Computer Science and Technology, 2018
- Dynamic operations and pricing of electric unmanned aerial vehicle systems and power networksTransportation Research Part C: Emerging Technologies, 2018
- BRAVOProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 2018
- Task Allocation in Spatial Crowdsourcing: Current State and Future DirectionsIEEE Internet of Things Journal, 2018
- Task Assignment in Mobile Crowdsensing: Present and Future DirectionsIEEE Network, 2018
- crowddeliver: Planning City-Wide Package Delivery Paths Leveraging the Crowd of TaxisIEEE Transactions on Intelligent Transportation Systems, 2016
- Effective and Efficient: Large-Scale Dynamic City ExpressIEEE Transactions on Knowledge and Data Engineering, 2016
- XGBoost2016
- Reoptimizing the traveling salesman problemNetworks, 2003