Abstract
Online ride-hailing has become one of the most important transportation ways in the modern city. In the ride-hailing system, how to efficiently match passengers (orders) with vehicles and how to dispatch idle vehicles are key issues. In the online ride-hailing system, the ride-hailing platform needs to match riding orders with vehicles and dispatches the idle vehicles efficiently to maximize the social welfare. However, the matching and dispatching decisions at the current round may affect the supply and demand of ride-hailing in the future rounds since they will affect the future vehicle distributions in different geographical zones. In fact, vehicles in different zones at different times may have different values for the matching and dispatching results. In this paper, we use the vehicle value function to characterize the spatio-temporal value of vehicles in each zone and then use it to design the order matching and idle vehicle dispatching algorithm to improve the long-term social welfare. We further run experiments to evaluate the proposed algorithm. The experimental results show that our algorithm can outperform benchmark approaches in terms of the social welfare, and can also achieve effective utilization of idle vehicles and thus improve the service ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
In this paper, we assume that vehicles belong to the ride-hailing platform, and thus the social welfare consists of the profits of the ride-hailing platform and passengers.
- 3.
- 4.
- 5.
The basic fare of New York taxi is 2.5$ per mile, the average fuel consumption is 6.8Â L per one-hundred kilometres according to the above fuel consumption data, and 1.6 is the converting factor between mile and kilometre.
References
Cao, B., Hong, F., Wang, K., Xu, J., Zhao, L., Fan, J.: Uroad: an efficient method for large-scale many to many ride sharing matching. J. Comput. Res. Dev. 56(4), 866 (2019)
Cheng, P., Feng, C., Chen, L., Wang, Z.: A queueing-theoretic framework for vehicle dispatching in dynamic car-hailing. In: 35th International Conference on Data Engineering, pp. 1622–1625 (2019)
Garaix, T., Artigues, C., Feillet, D., Josselin, D.: Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Comput. Oper. Res. 38(10), 1435–1442 (2011)
Haliem, M., Mani, G., Aggarwal, V., Bhargava, B.: A distributed model-free ride-sharing approach for joint matching, pricing, and dispatching using deep reinforcement learning. IEEE Trans. Intell. Transp. Syst. 22, 1–12 (2021)
Holler, J., et al.: Deep reinforcement learning for multi-driver vehicle dispatching and repositioning problem. In: 2019 IEEE International Conference on Data Mining, pp. 1090–1095 (2019)
Liang, E., Wen, K., Lam, W.H., Sumalee, A., Zhong, R.: An integrated reinforcement learning and centralized programming approach for online taxi dispatching. IEEE Trans. Neural Netw. Learn. Syst. 1 (2021)
Liu, Z., Gong, Z., Li, J., Wu, K.: Mobility-aware dynamic taxi ridesharing. In: 36th International Conference on Data Engineering, pp. 961–972 (2020)
Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)
Sharma, S.K., Routroy, S., Yadav, U.: Vehicle routing problem: recent literature review of its variants. Int. J. Oper. Res. 33(1), 1–31 (2018)
Shou, Z., Di, X., Ye, J., Zhu, H., Zhang, H., Hampshire, R.: Optimal passenger-seeking policies on e-hailing platforms using Markov decision process and imitation learning. Transp. Res. Part C Emerg. Technol. 111, 91–113 (2020)
Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)
Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053–1064 (2016)
Xu, Z., et al.: Large-scale order dispatch in on-demand ride-hailing platforms: a learning and planning approach. In: 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 905–913 (2018)
Yi, X., Yongxin, T., Wei, L.: Recent progress in large-scale ridesharing algorithms. J. Comput. Res. Dev. 57(1), 32 (2020)
Zhao, H., Xiao, M., Wu, J., Liu, A., An, B.: Reverse-auction-based competitive order assignment for mobile taxi-hailing systems. In: 2019 Database Systems for Advanced Applications, pp. 660–677 (2019)
Zheng, L., Cheng, P., Chen, L.: Auction-based order dispatch and pricing in ridesharing. In: 35th International Conference on Data Engineering, pp. 1034–1045 (2019)
Acknowledgement
This paper was funded by the Shenzhen Fundamental Research Program (Grant No. JCYJ20190809175613332), the Humanity and Social Science Youth Research Foundation of Ministry of Education (Grant No. 19YJC790111), the Philosophy and Social Science Post-Foundation of Ministry of Education (Grant No. 18JHQ060) and the Fundamental Research Funds for the Central Universities (WUT:2022IVB004).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, S., Zhong, Z., Luo, Y., Shi, B. (2022). A Vehicle Value Based Ride-Hailing Order Matching and Dispatching Algorithm. In: Memmi, G., Yang, B., Kong, L., Zhang, T., Qiu, M. (eds) Knowledge Science, Engineering and Management. KSEM 2022. Lecture Notes in Computer Science(), vol 13370. Springer, Cham. https://doi.org/10.1007/978-3-031-10989-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-031-10989-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-10988-1
Online ISBN: 978-3-031-10989-8
eBook Packages: Computer ScienceComputer Science (R0)