Name
Title | ||
|---|---|---|
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 real-world 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. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s11704-021-0568-5 | FRONTIERS OF COMPUTER SCIENCE |
Keywords | DocType | Volume |
crowdshipping, hitchhiking rides, dynamic elivery optimization, package delivery, taxi scheduling | Journal | 16 |
Issue | ISSN | Citations |
5 | 2095-2228 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sijing Cheng | 1 | 0 | 0.34 |
| Chao Chen | 2 | 1 | 2.71 |
| Shenle Pan | 3 | 0 | 0.34 |
| Hongyu Huang | 4 | 0 | 0.34 |
| Wei Zhang | 5 | 0 | 0.34 |
| Yuming Feng | 6 | 0 | 0.34 |