TY - JOUR
T1 - CROWDDELIVER
T2 - Planning city-wide package delivery paths leveraging the crowd of taxis
AU - Chen, Chao
AU - Zhang, Daqing
AU - Ma, Xiaojuan
AU - Guo, Bin
AU - Wang, Leye
AU - Wang, Yasha
AU - Sha, Edwin
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/6
Y1 - 2017/6
N2 - 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.
AB - 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.
KW - Hitchhiking rides
KW - Package delivery
KW - Route planning
KW - Taxi scheduling
KW - Trajectory data mining
UR - http://www.scopus.com/inward/record.url?scp=85020471900&partnerID=8YFLogxK
U2 - 10.1109/TITS.2016.2607458
DO - 10.1109/TITS.2016.2607458
M3 - 文章
AN - SCOPUS:85020471900
SN - 1524-9050
VL - 18
SP - 1478
EP - 1496
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 6
M1 - 2607458
ER -