Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

QA-Share: Toward an Efficient QoS-Aware Dispatching Approach for Urban Taxi-Sharing

Published: 30 January 2020 Publication History

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, it becomes more difficult to strike the balance between a driver’s profit and a passenger’s quality of service (QoS). In this article, we propose QA-Share, a QoS-aware taxi-sharing system, by addressing two important challenges. First, QA-Share maximizes driver profit and user experience at the same time. Second, QA-Share optimizes these two metrics by dynamically adapting its schedule as new requests arrive. To address these two challenges, we formulated the optimization problem using integer linear programming and derived the optimal solution under a small system scale. Moreover, we also designed a heuristic algorithm to deal with the situation where more passenger requests for taxi service come at the same time. We evaluate our approach with a real-world dataset in a Chinese city—Zhenjiang—that contains the GPS traces recorded by more than 3,000 taxis during a period of 3 months. The results show that both QoS and profit increase by 38% compared to the current schemes. Moreover, as the first study that has conducted simulations with real traces with a population of 3 million and 3,000 taxis, we prove that taxi-sharing is a viable approach in a medium-size city.

References

[1]
N. Taxi and L. Commission. 2011. Taxi of tomorrow survey results.
[2]
Chi-Chung Tao and Chun-Ying Chen. 2007. Heuristic algorithms for the dynamic taxipooling problem based on intelligent transportation system technologies. In Proceedings of IEEE FSKD.
[3]
Po-Yu Chen, Je-Wei Liu, and Wen-Tsuen Chen. 2010. A fuel-saving and pollution-reducing dynamic taxi-sharing protocol in VANETs. In Proceedings of IEEE VTC.
[4]
Desheng Zhang, Ye Li, Fan Zhang, Mingming Lu, Yunhuai Liu, and Tian He. 2013. coRide: Carpool service with a win-win fare model for large-scale taxicab networks. In Proceedings of ACM SenSys.
[5]
Shuo Ma, Yu Zheng, and Ouri Wolfson. 2013. T-Share: A large-scale dynamic taxi ridesharing service. In Proceedings of IEEE ICDE.
[6]
Desheng Zhang, Tian He, Fan Zhang, Mingming Lu, Yunhuai Liu, Haengju Lee, and Sang H. Son. 2016. Carpooling service for large-scale taxicab networks. ACM Transactions on Sensor Networks 12, 3 (2016), 18.
[7]
Chi-Chung Tao. 2007. Dynamic taxi-sharing service using intelligent transportation system technologies. In Proceedings of the 2007 International Conference on Wireless Communications, Networking, and Mobile Computing. 3209--3212.
[8]
Data 100 Company. 2012. Taxi-Sharing Survey. Retrieved July 30, 2014 from http://wenku.baidu.com/view/2f0fea1f964bcf84b9d57b4c.html.
[9]
Yilun Wang, Yu Zheng, and Yexiang Xue. 2014. Travel time estimation of a path using sparse trajectories. In Proceedings of ACM SIGKDD.
[10]
Xuemei Liu, James Biagioni, Jakob Eriksson, Yin Wang, George Forman, and Yanmin Zhu. 2012. Mining large-scale, sparse GPS traces for map inference: Comparison of approaches. In Proceedings of ACM SIGKDD.
[11]
Francesco Restuccia, Pierluca Ferraro, Timothy S. Sanders, Simone Silvestri, Sajal K. Das, and Giuseppe Lo Re. 2018. FIRST: A framework for optimizing information quality in mobile crowdsensing systems. ACM Transactions on Sensor Networks 15, 1 (2018), 5.
[12]
Jiangchuan Zheng and Lionel M. Ni. 2013. Time-dependent trajectory regression on road networks via multi-task learning. In Proceedings of AAAI.
[13]
Tsuyoshi Idé and Masashi Sugiyama. 2011. Trajectory regression on road networks. In Proceedings of AAAI.
[14]
Zongjian He, Jiannong Cao, and Tao Li. 2012. MICE: A real-time traffic estimation based vehicular path planning solution using VANETs. In Proceedings of IEEE ICCVE.
[15]
Jean-Francois Cordeau. 2006. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 54, 3 (2006), 573--586.
[16]
John E. Hopcroft and Richard M. Karp. 1973. An nˆ5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 4 (1973), 225--231.
[17]
Wei Wang, Baochun Li, and Ben Liang. 2014. Dominant resource fairness in cloud computing systems with heterogeneous servers. In Proceedings of IEEE INFOCOM.
[18]
Ethan Blanton, Sonia Fahmy, and Sujata Banerjee. 2008. Resource management in an active measurement service. In Proceedings of IEEE GIS.
[19]
Sam C. M. Lee, Joe W. J. Jiang, John C. S. Lui, and Dah-Ming Chiu. 2006. Interplay of ISPs: Distributed resource allocation and revenue maximization. In Proceedings of IEEE ICDCS.
[20]
Yan Huang, Favyen Bastani, Ruoming Jin, and Xiaoyang Sean Wang. 2014. Large scale real-time ridesharing with service guarantee on road networks. Proceedings of the VLDB Endowment 7, 14 (2014), 2017--2028. http://www.vldb.org/pvldb/vol7/p2017-huang.pdf.
[21]
Patrick Healy and Robert Moll. 1995. A new extension of local search applied to the Dial-A-Ride problem. European Journal of Operational Research 83, 1 (1995), 83--104.
[22]
Majid Aldaihani and Maged M. Dessouky. 2003. Hybrid scheduling methods for paratransit operations. Computers 8 Industrial Engineering 45, 1 (2003), 75--96.
[23]
Yeqian Lin, Wenquan Li, Feng Qiu, and He Xu. 2012. Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia—Social and Behavioral Sciences 43, 0 (2012), 494--502.
[24]
Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, and Gilbert Laporte. 2004. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30, 3 (2004), 377--387.
[25]
Jing Yuan, Yu Zheng, Liuhang Zhang, Xing Xie, and Guangzhong Sun. 2011. Where to find my next passenger. In Proceedings of ACM UbiComp. 109--118.
[26]
Xudong Zheng, Xiao Liang, and Ke Xu. 2012. Where to wait for a taxi? In Proceedings of ACM SIGKDD.
[27]
Jun-Li Lu, Mi-Yen Yeh, Yu-Ching Hsu, Shun-Neng Yang, C.-H. Gan, and Ming-Syan Chen. 2012. Operating electric taxi fleets: A new dispatching strategy with charging plans. In Proceedings of IEEE IEVC.

Cited By

View all
  • (2022) mT-Share : A Mobility-Aware Dynamic Taxi Ridesharing System IEEE Internet of Things Journal10.1109/JIOT.2021.31026389:1(182-198)Online publication date: 1-Jan-2022
  • (2022)Challenges in creating egalitarian logistic ecosystem: cases of app-based cab aggregators (ABCAs)International Journal of Emerging Markets10.1108/IJOEM-02-2021-019318:11(4987-5008)Online publication date: 17-Feb-2022
  • (2022)The taxi sharing practices: Matching, routing and pricing methodsMultimodal Transportation10.1016/j.multra.2022.1000031:1(100003)Online publication date: Mar-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks
ACM Transactions on Sensor Networks  Volume 16, Issue 2
May 2020
225 pages
ISSN:1550-4859
EISSN:1550-4867
DOI:10.1145/3381515
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

Publication History

Published: 30 January 2020
Accepted: 01 December 2019
Revised: 01 October 2019
Received: 01 October 2018
Published in TOSN Volume 16, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Location-based service
  2. quality of service
  3. taxi-sharing

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • NSF China Key Project
  • NSF China Program
  • National Key R8D Program of China

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)3
Reflects downloads up to 13 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2022) mT-Share : A Mobility-Aware Dynamic Taxi Ridesharing System IEEE Internet of Things Journal10.1109/JIOT.2021.31026389:1(182-198)Online publication date: 1-Jan-2022
  • (2022)Challenges in creating egalitarian logistic ecosystem: cases of app-based cab aggregators (ABCAs)International Journal of Emerging Markets10.1108/IJOEM-02-2021-019318:11(4987-5008)Online publication date: 17-Feb-2022
  • (2022)The taxi sharing practices: Matching, routing and pricing methodsMultimodal Transportation10.1016/j.multra.2022.1000031:1(100003)Online publication date: Mar-2022
  • (2020)Is Reinforcement Learning the Choice of Human Learners?Proceedings of the 28th International Conference on Advances in Geographic Information Systems10.1145/3397536.3422246(357-366)Online publication date: 3-Nov-2020
  • (2020)An Order Dispatch System Based on Reinforcement Learning for Ride Sharing Services2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)10.1109/HPCC-SmartCity-DSS50907.2020.00099(758-763)Online publication date: Dec-2020

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media