Skip to Main content Skip to Navigation
Journal articles

Citywide package deliveries via crowdshipping: minimizing the efforts from crowdsourcers

Abstract : Most current crowdsourced logistics aim to minimize systems cost and maximize delivery capacity, but the efforts of crowdsourcers such as drivers are almost ignored. In the delivery process, drivers usually need to take long-distance detours in hitchhiking rides based package deliveries. In this paper, we propose an approach that integrates offline trajectory data mining and online route-and-schedule optimization in the hitchhiking ride scenario to find optimal delivery routes for packages and drivers. Specifically, we propose a two-phase framework for the delivery route planning and scheduling. In the first phase, the historical trajectory data are mined offline to build the package transport network. In the second phase, we model the delivery route planning and package-taxi matching as an integer linear programming problem and solve it with the Gurobi optimizer. After that, taxis are scheduled to deliver packages with optimal delivery paths via a newly designed scheduling strategy. We evaluate our approach with the realworld datasets; the results show that our proposed approach can complete citywide package deliveries with a high success rate and low extra efforts of taxi drivers.
Complete list of metadata
Contributor : Shenle Pan Connect in order to contact the contributor
Submitted on : Wednesday, January 12, 2022 - 5:30:03 PM
Last modification on : Tuesday, February 22, 2022 - 5:33:16 PM



Sijing Cheng, Chao Chen, Shenle Pan, Hongyu Huang, Wei Zhang, et al.. Citywide package deliveries via crowdshipping: minimizing the efforts from crowdsourcers. Frontiers of Computer Science, Springer Verlag, 2022, 16 (6), pp.165327. ⟨10.1007/s11704-021-0568-5⟩. ⟨hal-03508265⟩



Record views