QA-share: Towards efficient QoS-aware dispatching approach for urban taxi-sharing
Authors: 
Shanfeng Zhang, Qiang Ma, Yanyong Zhang, Kebin Liu, Tong Zhu, Yunhao LiuAuthors Info & Claims
Shanfeng Zhang, Qiang Ma, Yanyong Zhang, Kebin Liu, Tong Zhu, Yunhao LiuAuthors Info & ClaimsPages 533 - 541
Abstract
Taxi-sharing allows occupied taxis to pick up new passengers on the fly, promising to reduce waiting time for taxi riders and increase productivity for drivers. However, if not carefully designed, taxi-sharing may cause more harm than benefit — it becomes harder to strike the balance between driver's profit and passenger's quality of service (e.g. travel time, number of strangers that share a taxi, etc.). In this paper, we propose a QoS-aware taxi-sharing system design — QA-Share — by addressing two important challenges. First, QA-Share aims to maximize driver profit and user experience at the same time. Second, QA-Share continuously optimizes these two metrics by dynamically adapting its schedule as new requests arrive, without entering an oscillation state. To address these two challenges, we have formulated the optimization problem using integer linear programming, and derived the optimal solution under a small system scale. When the number of requests and taxis becomes large, we have devised a heuristic algorithm that has a much faster execution time. We have also studied how to minimize oscillations caused by schedule re-calculations by dynamically tuning the update threshold. We have evaluated our approach with real-world dataset in a Chinese city — ZhenJiang — which contains the GPS traces recorded by over 3,000 taxis during a period of three months in 2013. Our results show that the QoS and profit is increased by 38% compared to earlier schemes.
References
[1]
N. Taxi and L. Commission, “Taxi of tomorrow survey,” 2011.
[2]
S. Daily. (2014) Taxi shift change a headache for locals. http://www.china.org.cn/english/travel/158628.htm. [Online; accessed 2014 Dec 13].
[3]
C.-C. Tao and C.-Y. Chen, “Heuristic algorithms for the dynamic taxipooling problem based on intelligent transportation system technologies,” in Proceedings of IEEE FSKD, 2007.
[4]
P.-Y. Chen, J.-W. Liu, and W.-T. Chen, “A fuel-saving and pollution-reducing dynamic taxi-sharing protocol in vanets,” in Proceedings of IEEE VTC, 2010.
[5]
D. Zhang, Y. Li, F. Zhang, M. Lu, Y. Liu, and T. He, “coride: carpool service with a win-win fare model for large-scale taxicab networks,” in Proceedings of ACM SenSys, 2013.
[6]
S. Ma, Y. Zheng, and O. Wolfson, “T-share: A large-scale dynamic taxi ridesharing service,” in Proceedings of IEEE ICDE, 2013.
[7]
Y. Wang, Y. Zheng, and Y. Xue, “Travel time estimation of a path using sparse trajectories,” in Proceedings of ACM SIGKDD, 2014.
[8]
CNTV-English, “Beijing promotes taxi sharing to ease traffic jams,” http://www.nihao-salam.com/news-detail.php?id=MTUxMQ==, 2012, [Online; accessed 2014 July 30].
[9]
X. Liu, J. Biagioni, J. Eriksson, Y. Wang, G. Forman, and Y. Zhu, “Mining large-scale, sparse gps traces for map inference: comparison of approaches,” in Proceedings of ACM SIGKDD, 2012.
[10]
J. Zheng and L. M. Ni, “Time-dependent trajectory regression on road networks via multi-task learning,” in Proceedings of AAAI, 2013.
[11]
T. Idé and M. Sugiyama, “Trajectory regression on road networks,” in Proceedings of AAAI, 2011.
[12]
Z. He, J. Cao, and T. Li, “Mice: A real-time traffic estimation based vehicular path planning solution using vanets,” in Proceedings of IEEE ICCVE, 2012.
[13]
J.-F. Cordeau, “A branch-and-cut algorithm for the dial-a-ride problem,” Operations Research, vol. 54, no. 3, pp. 573–586, 2006.
[14]
J. E. Hopcroft and R. M. Karp, “An n∧5/2 algorithm for maximum matchings in bipartite graphs,” SIAM Journal on computing, vol. 2, no. 4, pp. 225–231, 1973.
[15]
W. Wang, B. Li, and B. Liang, “Dominant resource fairness in cloud computing systems with heterogeneous servers,” in Proceedings of IEEE INFOCOM, 2014.
[16]
E. Blanton, S. Fahmy, and S. Banerjee, “Resource management in an active measurement service,” in Proceedings of the IEEE GIS, 2008.
[17]
S. C. Lee, J. W. Jiang, J. C. Lui, and D.-M. Chiu, “Interplay of isps: Distributed resource allocation and revenue maximization,” in Proceedings of IEEE ICDCS, 2006.
[18]
P. Healy and R. Moll, “A new extension of local search applied to the dial-a-ride problem,” European Journal of Operational Research, vol. 83, no. 1, pp. 83–104, 1995.
[19]
M. Aldaihani and M. M. Dessouky, “Hybrid scheduling methods for paratransit operations,” Computers & Industrial Engineering, vol. 45, no. 1, pp. 75–96, 2003.
[20]
Y. Lin, W. Li, F. Qiu, and H. Xu, “Research on optimization of vehicle routing problem for ride-sharing taxi,” Procedia-Social and Behavioral Sciences, vol. 43, no. 0, pp. 494–502, 2012.
[21]
A. Attanasio, J.-F. Cordeau, G. Ghiani, and G. Laporte, “Parallel tabu search heuristics for the dynamic multivehicle dial-a-ride problem,” Parallel Computing, vol. 30, no. 3, pp. 377–387, 2004.
[22]
J. Yuan, Y. Zheng, L. Zhang, X. Xie, and G. Sun, “Where to find my next passenger,” in Proceedings of ACM UbiComp, 2011, pp. 109–118.
[23]
X. Zheng, X. Liang, and K. Xu, “Where to wait for a taxi?” in Proceedings of ACM SIGKDD, 2012.
[24]
J.-L. Lu, M.-Y. Yeh, Y.-C. Hsu, S.-N. Yang, C.-H. Gan, and M.-S. Chen, “Operating electric taxi fleets: A new dispatching strategy with charging plans,” in Proceedings of IEEE IEVC, 2012.
Index Terms
- QA-share: Towards efficient QoS-aware dispatching approach for urban taxi-sharing
Index terms have been assigned to the content through auto-classification.
Recommendations
QA-Share: Toward an Efficient QoS-Aware Dispatching Approach for Urban Taxi-Sharing
Taxi-sharing allows occupied taxis to pick up new passengers on the fly, promising to reduce waiting time for taxi riders and increase productivity for drivers. However, it becomes more difficult to strike the balance between a driver’s profit and a ...
Developing a large-scale taxi dispatching system for urban networks
2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)Taxis are increasingly becoming a prominent mobility mode in many major cities due to their accessibility and convenience. The growing number of taxi trips is cause for concern when vacant taxis are not distributed optimally within the city and are unable ...
The Automation of the Taxi Industry – Taxi Drivers’ Expectations and Attitudes Towards the Future of their Work
AbstractAdvoc ates of autonomous driving predict that the occupation of taxi driver could be made obsolete by shared autonomous vehicles (SAV) in the long term. Conducting interviews with German taxi drivers, we investigate how they perceive the changes ...
Comments
Information & Contributors
Information
Published In
541 pages
Copyright © 2015.
Publisher
IEEE Press
Publication History
Published: 01 June 2015
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025