crowddeliver: Planning City-Wide Package Delivery Paths Leveraging the Crowd of Taxis
Despite the great demand on and attempts at package express shipping services, online retailers have not yet had a practical solution to make such services profitable. In this paper, we propose an economical approach to express package delivery, i.e., exploiting relays of taxis with passengers to he...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on intelligent transportation systems 2017-06, Vol.18 (6), p.1478-1496 |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Despite the great demand on and attempts at package express shipping services, online retailers have not yet had a practical solution to make such services profitable. In this paper, we propose an economical approach to express package delivery, i.e., exploiting relays of taxis with passengers to help transport package collectively, without degrading the quality of passenger services. Specifically, we propose a two-phase framework called crowddeliver for the package delivery path planning. In the first phase, we mine the historical taxi trajectory data offline to identify the shortest package delivery paths with estimated travel time given any Origin-Destination pairs. Using the paths and travel time as the reference, in the second phase we develop an online adaptive taxi scheduling algorithm to find the near-optimal delivery paths iteratively upon real-time requests and direct the package routing accordingly. Finally, we evaluate the two-phase framework using the real-world data sets, which consist of a point of interest, a road network, and the large-scale trajectory data, respectively, that are generated by 7614 taxis in a month in the city of Hangzhou, China. Results show that over 85% of packages can be delivered within 8 hours, with around 4.2 relays of taxis on average. |
---|---|
ISSN: | 1524-9050 1558-0016 |
DOI: | 10.1109/TITS.2016.2607458 |