Abstract
In recent years, ride-hailing has played an important role in daily transportation. In the ride-hailing system, how to set the prices for orders is a crucial issue. Considering the variations in vehicle supply and order demand in different regions of the same city, it is necessary to divide regions according to the supply and demand in each region and develop differentiate pricing strategy. However, the traditional fixed region-division strategy is difficult to adapt to the dynamically changed supply and demand over the time. To address this issue, we propose a dynamic region-division based pricing strategy to set prices according to the demand and supply of different regions to maximize the long-term profit of the platform. Specifically, we first design a dynamic region-clustering algorithm based on Deep Q Network and K-Means algorithm to dynamically cluster small zones with similar demand and supply status and nearby locations into the same region. We then propose an adaptive multi-region dynamic pricing algorithm to set unit price for each clustered region to maximize the long-term profit of the ride-hailing platform. We further run extensive experiments based on a real-world dataset to demonstrate the effectiveness of our proposed algorithm. The experimental results show that the platform’s profit is increased under different pricing algorithms combined with dynamic region-clustering algorithm. Furthermore, we find that the combination of adaptive multi-region dynamic pricing algorithm with dynamic region-clustering algorithm can bring higher profits, serve more orders and have a higher service rate than benchmark approaches.
Graphical abstract















Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Availability of Data and Materials
During our research, we were able to access to the Chengdu Didi ride-hailing dataset. However, due to its current unavailability, we are unable to provide a direct link to it. Nonetheless, we have uploaded the dataset to a cloud storage platform for the convenience of the reviewers to access: https://github.com/luyan1234/dataset.
Code Availability
We have uploaded the code to github to enhance the transferability and replicability of our work, also with the link: https://github.com/luyan1234/dataset.
References
Angrist JD, Caldwell S, Hall JV (2021) Uber versus taxi: a driver’s eye view. Am Econ J Appl Econ 13(3):272–308
Zhang S, Lee D, Singh P, Mukhopadhyay T (2022) Demand interactions in sharing economies: evidence from a natural experiment involving airbnb and uber/lyft. J Mark Res 59(2):374–391
Yan C, Zhu H, Korolko N, Woodard D (2020) Dynamic pricing and matching in ride-hailing platforms. Naval Res Log 67(8):705–724
Sun Z, Xu Q, Shi B (2020) Dynamic pricing of ride-hailing platforms considering service quality and supply capacity under demand fluctuation. Math Probl Eng 2020:1–26
Tong Y, Wang L, Zhou Z, Chen L, Du B, Ye J (2018) Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: Proceedings of the 2018 international conference on management of data. pp 773–788
Besbes O, Castro F, Lobel I (2021) Surge pricing and its spatial supply response. Manage Sci 67(3):1350–1367
Chen C, Yao F, Mo D, Zhu J, Chen XM (2021) Spatial-temporal pricing for ride-sourcing platform with reinforcement learning. Transp Res Part C Emerg Technol 130:103272
Shi B, Cao Z, Luo Y (2022) A deep reinforcement learning based dynamic pricing algorithm in ride-hailing. In: International conference on database systems for advanced applications. Springer, p 489–505
Ou X, Chang Q, Chakraborty N (2020) A method integrating q-learning with approximate dynamic programming for gantry work cell scheduling. IEEE Trans Autom Sci Eng 18(1):85–93
Hu X, Zhou S, Luo X, Li J, Zhang C (2024) Optimal pricing strategy of an on-demand platform with cross-regional passengers. Omega 122:102947
Chen Q, Lei Y, Jasin S (2023) Real-time spatial-intertemporal pricing and relocation in a ride-hailing network: near-optimal policies and the value of dynamic pricing. Oper Res
Schröder M, Storch D-M, Marszal P, Timme M (2020) Anomalous supply shortages from dynamic pricing in on-demand mobility. Nat Commun 11(1):1–8
Meskar M, Aslani S, Modarres M (2023) Spatio-temporal pricing algorithm for ride-hailing platforms where drivers can decline ride requests. Transp Res Part C Emerg Technol 153:104200
Huang J, Huang L, Liu M, Li H, Tan Q, Ma X, Cui J, Huang D-S (2022) Deep reinforcement learning-based trajectory pricing on ride-hailing platforms. ACM Trans Intell Syst Technol 13(3):1–19
Baranzini A, Carattini S, Tesauro L (2021) Designing effective and acceptable road pricing schemes: evidence from the geneva congestion charge. Environ Resource Econ 79(3):417–482
Chen L, Shang S, Yao B, Li J (2020) Pay your trip for traffic congestion: dynamic pricing in traffic-aware road networks. Proc AAAI Conf Artif Intell 34(1):582–589
Li S, Yang H, Poolla K, Varaiya P (2021) Spatial pricing in ride-sourcing markets under a congestion charge. Transport Res B Meth 152:18–45
Zheng Y, Meredith-Karam P, Stewart A, Kong H, Zhao J (2023) Impacts of congestion pricing on ride-hailing ridership: evidence from Chicago. Transport Res A Policy Pract 170:103639
Li J, Huang H, Li L, Wu J (2023) Bilateral pricing of ride-hailing platforms considering cross-group network effect and congestion effect. J Theor Appl Electron Commer Res 18(4):1721–1740
Liu J, Ma W, Qian S (2023) Optimal curbside pricing for managing ride-hailing pick-ups and drop-offs. Transp Res Part C Emerg Technol 146:103960
Castagna A, Guériau M, Vizzari G, Dusparic I (2020) Demand-responsive zone generation for real-time vehicle rebalancing in ride-sharing fleets. In: ATT@ ECAI. p 47–54
Liu Z, Li J, Wu K (2020) Context-aware taxi dispatching at city-scale using deep reinforcement learning. IEEE trans Intell Transp Syst
Qian Y, Xing W, Guan X, Yang T, Wu H (2020) Coupling cellular automata with area partitioning and spatiotemporal convolution for dynamic land use change simulation. Sci Total Environ 722:137738
Wang X, Zhou Z, Zhao Y, Zhang X, Xing K, Xiao F, Yang Z, Liu Y (2019) Improving urban crowd flow prediction on flexible region partition. IEEE Trans Mob Comput 19(12):2804–2817
Yan F, Zhang M, Shi Z (2021) Dynamic partitioning of urban traffic network sub-regions with spatiotemporal evolution of traffic flow. Nonlinear Dyn 105(1):911–929
Li F, Feng J, Yan H, Jin D, Li Y (2022) Crowd flow prediction for irregular regions with semantic graph attention network. ACM Trans Intell Syst Technol 13(5):1–14
Zhao Q, Yang S, Qin L, Frnti P (2015) A grid-growing clustering algorithm for geo-spatial data. Pattern Recogn Lett 53(53):77–84
Liu Y, Wu F, Lyu C, Li S, Ye J, Qu X (2022) Deep dispatching: a deep reinforcement learning approach for vehicle dispatching on online ride-hailing platform. Transp Res E Logist Transp Rev 161:102694
Du X, Niu D, Chen Y, Wang X, Bi Z (2022) City classification for municipal solid waste prediction in Mainland China based on k-means clustering. Waste Manage 144:445–453
Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529–533
Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32–38
Wang D, Wang Q, Yin Y, Cheng T (2023) Optimization of ride-sharing with passenger transfer via deep reinforcement learning. Transport Res E Logist Transport Rev 172:103080
Xi J, Zhu F, Ye P, Lv Y, Tang H, Wang F-Y (2022) Hmdrl: hierarchical mixed deep reinforcement learning to balance vehicle supply and demand. IEEE Trans Intell Transp Syst 23(11):21861–21872
Xu M, Yue P, Yu F, Yang C, Zhang M, Li S, Li H (2023) Multi-agent reinforcement learning to unify order-matching and vehicle-repositioning in ride-hailing services. Int J Geogr Inf Sci 37(2):380–402
Tong Y, She J, Ding B, Chen L, Wo T, Xu K (2016) Online minimum matching in real-time spatial data: experiments and analysis. Proc VLDB Endow 9(12):1053–1064
Chen M, Shen W, Tang P, Zuo S (2019) Dispatching through pricing: modeling ride-sharing and designing dynamic prices
Acknowledgements
This paper was funded by the Humanity and Social Science Youth Research Foundation of Ministry of Education of China (Grant No. 19YJC790111) and the Philosophy and Social Science Post-Foundation of Ministry of Education of China (Grant No. 18JHQ060). We are grateful to Kachule Paul Ernest for providing proof reading of the paper.
Funding
This paper was funded by the Humanity and Social Science Youth Research Foundation of Ministry of Education of China (Grant No. 19YJC790111) and the Philosophy and Social Science Post-Foundation of Ministry of Education of China (Grant No. 18JHQ060).
Author information
Authors and Affiliations
Contributions
Bing Shi provided editing, supervision and validation of this paper. Yan Lu contributed to the conceptualization, methodology, and original draft writing of this study. Zhi Cao was involved in the investigation, data curation, and software development.
Corresponding author
Ethics declarations
Competing Interests
We declare that we have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Ethics Approval
Not applicable.
Consent to Participate
Not applicable.
Consent for Publication
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Shi, B., Lu, Y. & Cao, Z. A dynamic region-division based pricing strategy in ride-hailing. Appl Intell 54, 11267–11280 (2024). https://doi.org/10.1007/s10489-024-05711-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-024-05711-8