TY - GEN
T1 - Real-time personalized taxi-sharing
AU - Duan, Xiaoyi
AU - Jin, Cheqing
AU - Wang, Xiaoling
AU - Zhou, Aoying
AU - Yue, Kun
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - Taxi-sharing is an efficient way to improve the utility of taxis by allowing multiple passengers to share a taxi. It also helps to relieve the traffic jams and air pollution. It is common that different users may have different attitudes towards the taxi-sharing scheduling plan, such as the fee to be paid and the additional time to the destination. However, this property has not been paid enough attention to in the traditional taxi-sharing systems-the traditional focus is how to decrease the travel distance.We study the problem of personalized taxi-sharing in this paper, with the consideration of each passenger’s preference in payment, travel time and waiting time. We first define the satisfaction degree of each party involved in the scheduling plan, based on which two goals are defined to evaluate the overall plan, including MaxMin and MaxSum. Subsequently, we devise a two-phase framework to deal with this problem. The statistical information gathered during the offline phase will be used to hasten query processing during the online phase. Experimental reports upon the real dataset illustrate the effectiveness and efficiency of the proposed method.
AB - Taxi-sharing is an efficient way to improve the utility of taxis by allowing multiple passengers to share a taxi. It also helps to relieve the traffic jams and air pollution. It is common that different users may have different attitudes towards the taxi-sharing scheduling plan, such as the fee to be paid and the additional time to the destination. However, this property has not been paid enough attention to in the traditional taxi-sharing systems-the traditional focus is how to decrease the travel distance.We study the problem of personalized taxi-sharing in this paper, with the consideration of each passenger’s preference in payment, travel time and waiting time. We first define the satisfaction degree of each party involved in the scheduling plan, based on which two goals are defined to evaluate the overall plan, including MaxMin and MaxSum. Subsequently, we devise a two-phase framework to deal with this problem. The statistical information gathered during the offline phase will be used to hasten query processing during the online phase. Experimental reports upon the real dataset illustrate the effectiveness and efficiency of the proposed method.
UR - https://www.scopus.com/pages/publications/84962450054
U2 - 10.1007/978-3-319-32049-6_28
DO - 10.1007/978-3-319-32049-6_28
M3 - 会议稿件
AN - SCOPUS:84962450054
SN - 9783319320489
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 451
EP - 465
BT - Database Systems for Advanced Applications - 21st International Conference, DASFAA 2016, Proceedings
A2 - Navathe, Shamkant B.
A2 - Shekhar, Shashi
A2 - Wang, X. Sean
A2 - Wu, Weili
A2 - Du, Xiaoyong
A2 - Xiong, Hui
PB - Springer Verlag
T2 - 21st International Conference on Database Systems for Advanced Applications, DASFAA 2016
Y2 - 16 April 2016 through 19 April 2016
ER -