An Analysis of the Taxi-Sharing Organizing and Pricing

Conference paper
First Online:
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 419)

Abstract

At present, the supply of taxi service is larger than the demand in many cities, particularly in mage cities. Increasing the quantity of taxi is an unsustainable method, which will aggravate the congestion and damage the environment. Therefore, in order to solve this tricky problem, we encourage passengers who have the taxi trip demand to share taxi with others. Taxi sharing has the broad prospect, but it has not been paid enough attention. Studies show that the researches of the taxi-sharing organizing (including the taxi-sharing matching and the route choice) and the pricing method are not mature and deeply. Hence, in terms of their important functions to promote the taxi sharing, this paper focuses on two aspects: the taxi-sharing organizing model and the pricing method. Firstly, we establish a based taxi-sharing organizing (the matching and route choice) model. Its objective function is to minimize the number of service vehicles and minimize the total travel distance. Furthermore, in order to overcome the limitations of the based model, we establish an improved taxi-sharing organizing (the matching and route choice) model. Its objective functions are to minimize the number of service vehicles and maximize the overlapped travel distance. This improved model can fulfill the system optimization further. Secondly, the fair fare allocation is raised. The order to pay, the number of sharing passengers, the travel distance, and the waiting time are considered, respectively. Furthermore, based on the fair fare allocation, we proposed a generalized taxi-sharing pricing method. Finally, in the viewpoint of companies/agents, drivers, and passengers, we make some suggestions to put the above two models/methods into practice and promote the taxi sharing.

Keywords

Taxi sharing The taxi-sharing matching and route choice model The fair fare allocation The pricing method 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgments

This study is supported by the Fundamental Research Funds for the Central Universities (No. 2242015R30036), National Natural Science Foundation of China (NO. 71501038, NO. 51408253), Natural Science Foundation of Jiangsu Province in China (NO. BK20150603), Graduate Innovative Projects of Jiangsu Province in 2014 (NO. KYLX_1059), and Open Fund for the Key Laboratory for Traffic and Transportation Security of Jiangsu Province (NO. TTS2016-06).

References

  1. 1.
    Anderson, D. 2014. Not just a taxi?—For-profit ridesharing, driver strategies, and VMT. Transportation 41 (5): 1099–1117.CrossRefGoogle Scholar
  2. 2.
    Aarhauga, J., and K. Skolleruda. 2014. Taxi: Different solutions in different segments. Transportation Research Procedia 1: 276–283.CrossRefGoogle Scholar
  3. 3.
    Aoun, A., M. Abou-Zeid, I. Kaysi, and C. Myntti. 2013. Reducing parking demand and traffic congestion at the American University of Beirut. Transport Policy 25 (1): 52–60.CrossRefGoogle Scholar
  4. 4.
    Cai, D. 2011. A system of taxi pricing. CN 202058211U.Google Scholar
  5. 5.
    Chen, L. 2013. Pricing system of taxi sharing and order method. CN 103150762A.Google Scholar
  6. 6.
    Chen, J., Z. Liu, S. Zhu, and W. Wang. 2015. Design of limited-stop bus service with capacity constraint and stochastic travel time. Transportation Research Part E 83: 1–15.CrossRefGoogle Scholar
  7. 7.
    Cui, J. 2011. Pricing system of taxi sharing. CN 202257689U.Google Scholar
  8. 8.
    Dembele, J., and C. Cambier. 2012. An Agent-particle model for taxis-based aggregation; Emergence and detection of structures. Procedia Computer Science 9 (9): 1484–1493.CrossRefGoogle Scholar
  9. 9.
    Desaulniers, Guy, Jacques Desrosiers, Andreas Erdmann, Marius M. Solomon, and François Soumis. 2002. VRP with pickup and delivery. The Vehicle Routing Problem 9: 225–242.MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Desrosiers, Jacques, Yvan Dumas, Marius M. Solomon, and François Soumis. 1995. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science 8: 35–139.MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Fagin, R., and J.H. Williams. 1983. A fair carpool scheduling algorithm. Journal of Research & Development 27 (2): 133–139.Google Scholar
  12. 12.
    Grau, J., and M. Romeu. 2015. Agent based modelling for simulating taxi services. Procedia Computer Science 52: 902–907.CrossRefGoogle Scholar
  13. 13.
    Guézéré, A. 2014. The reconstruction of shared taxis as rural transport due to the competition of motor bike taxis in Togo secondary cities. Case Studies on Transport Policy 3: 253–263.CrossRefGoogle Scholar
  14. 14.
    He, F., and Z. Shen. 2015. Modeling taxi services with smartphone-based e-hailing applications. Transportation Research Part C 58: 93–106.CrossRefGoogle Scholar
  15. 15.
    Hong, Qilin. (2012). Research on taxi pricing based on ride-sharing. Ph.D. Thesis at Harbin Institute of Technology. Google Scholar
  16. 16.
    Hosni, H., J. Naoum-Sawaya, and H. Artail. 2014. The shared-taxi problem: Formulation and solution methods. Transportation Research Part B 70: 303–318.CrossRefGoogle Scholar
  17. 17.
    Jorge, D., G. Molnar, and G. Correia. 2015. Trip pricing of one-way station-based carsharing networks with zone and time of day price variations. Transportation Research Part B 81: 461–482.CrossRefGoogle Scholar
  18. 18.
    Lin, Y., W. Li, F. Qiu, and H. Xu. 2012. Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia—Social and Behavioral Sciences 43: 494–502.CrossRefGoogle Scholar
  19. 19.
    Liu, S., Z. Zhou, and C. Zhang. 2013. Research on optimization of “Taxi-pooling” in Hefei City. Journal of Chongqing Technology and Business University. 11 (30): 70–75.Google Scholar
  20. 20.
    Liu, Z., and Q. Meng. 2014. Bus-based park-and-ride system: A stochastic model on multimodal network with congestion pricing schemes. International Journal of Systems Science 45 (5): 994–1006.MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Liu, Z., Q. Meng, and S. Wang. 2013b. Speed-based toll design for cordon-based congestion pricing scheme. Transportation Research Part C 31: 83–98.Google Scholar
  22. 22.
    Liu, Z., Q. Meng, and S. Wang. 2014. Variational inequality model for cordon-based congestion pricing under side constrained stochastic user equilibrium conditions. Transportmetrica A 10 (8): 693–704.CrossRefGoogle Scholar
  23. 23.
    Liu, Z., S. Wang, and Q. Meng. 2014. Optimal joint distance and time toll for cordon-based congestion pricing. Transportation Research Part B 69: 81–97.CrossRefGoogle Scholar
  24. 24.
    Liu, Z., S. Wang, and Q. Meng. 2014. Toll pricing framework under logit-based stochastic user equilibrium constraints. Journal of Advanced Transportation 48: 1121–1137.CrossRefGoogle Scholar
  25. 25.
    Naor, M. 2005. On fairness in the carpool problem. Journal of Algorithms 55 (1): 93–98.MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Rayle, L., D. Dai, N. Chan, and S. Shaheen. 2016. Just a better taxi?—A survey-based comparison of taxis, transit, and ride sourcing services in San Francisco. Transport Policy 45: 168–178.CrossRefGoogle Scholar
  27. 27.
    Santos, D., & E. Xavier. 2013. Dynamic taxi and ridesharing: A framework and heuristics for the optimization problem. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence IJCAI 2013, 2885–2891.Google Scholar
  28. 28.
    Santos, D., and E. Xavier. 2015. Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems with Applications 42 (19): 6728–6737.CrossRefGoogle Scholar
  29. 29.
    Seow, K., and D. Lee. 2007. Towards an automated multiagent taxi-dispatch system. In IEEE Conference on Automation Science and Engineering, 31–36.Google Scholar
  30. 30.
    Seow, K., and D. Lee. 2010. Performance of multiagent taxi dispatch on extended-runtime taxi availability: A simulation study. IEEE Transactions on Intelligent Transportation Systems 11 (1): 231–236.CrossRefGoogle Scholar
  31. 31.
    Song, F., R. Li, and H. Zhou. 2015. Feasibility and issues for establishing network-based carpooling scheme. Pervasive & Mobile Computing 24: 4–15.CrossRefGoogle Scholar
  32. 32.
    Wu, F., Z. Li, and C. Xu. 2009. Study of the mode of combined-taxi optimal scheduling. Journal of Lanzhou Jiaotong University 88 (1): 104–107.Google Scholar
  33. 33.
    Zhang, W., R. He, and Q. Xiao. 2015. Research on taxi carpooling pricing multi-objective optimization. Journal of Wuhan University of Technology (Transportation Science Engineering) 39 (6): 1105–1109.Google Scholar
  34. 34.
    Zhou, H., B. Zhong, X. Peng, and X. Xia. 2011. The route choice and rate optimization model of taxi-pooling. Journal of Changsha University of Science and Technology (Natural Science) 8 (4): 20–24.Google Scholar
  35. 35.
    Zikeš, J. 2012. Auction-based taxi allocation with dynamic pricing. Bachelor Thesis of Czech Technical University in Prague.Google Scholar

Copyright information

© Springer Science+Business Media Singapore 2018

Authors and Affiliations

  1. 1.Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic TechnologiesSoutheast UniversityNanjingChina
  2. 2.Rongcheng CampusHarbin University of Science and TechnologyRongchengChina

Personalised recommendations