Abstract
The recent enhancement of taxi dispatch services with information technology has enabled data-driven pricing and dispatch. However, existing studies failed to address differences in individual priorities as regards money savings and time savings, leading to non-optimal taxi pricing and dispatch. In this paper, we formulate a new optimization problem that yields optimized price and time proposals for each requester according to their priorities. To consider the requester’s priorities, we introduce an individual requester’s acceptance probability model for price and required time, which is widely used in transportation economics. The proposals of price and time combinations yielded by our method enhance both the requester’s satisfaction and the service provider’s profit. Since the optimization problem is difficult to solve because its objective values are hard to evaluate and discontinuous, we construct a fast approximation algorithm by utilizing the characteristics of the problem. Simulations using real-world datasets show that the proposed framework increases both the requester’s satisfaction and service provider’s profit.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
- 2.
- 3.
- 4.
- 5.
References
Abrantes, P.A.L., Wardman, M.R.: Meta-analysis of UK values of travel time: an update. Transp. Res. Part A: Policy Practice 45(1), 1–17 (2011)
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., Rus, D.: On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Natl. Acad. Sci. 114(3), 462–467 (2017)
Asghari, M., Deng, D., Shahabi, C., Demiryurek, U., Li, Y.: Price-aware real-time ride-sharing at scale: an auction-based approach. In: SIGSPATIAL, pp. 1–10 (2016)
Asghari, M., Shahabi, C.: Adapt-pricing: a dynamic and predictive technique for pricing to maximize revenue in ridesharing platforms. In: SIGSPATIAL, pp. 189–198 (2018)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Chen, H., et al.: Inbede: integrating contextual bandit with td learning for joint pricing and dispatch of ride-hailing platforms. In: ICDM, pp. 61–70 (2019)
Chen, L., Zhong, Q., Xiao, X., Gao, Y., Jin, P., Jensen, C.S.: Price-and-time-aware dynamic ridesharing. In: ICDE, pp. 1061–1072 (2018)
Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Xu, P.: Allocation problems in ride-sharing platforms: online matching with offline reusable resources. In: AAAI, pp. 1007–1014 (2018)
de Dios Ortúzar, J., Willumsen, L.G.: Modelling Transport. Wiley (2011)
Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv. 18(1), 23–38 (1986)
Gan, J., An, B., Wang, H., Sun, X., Shi, Z.: Optimal pricing for improving efficiency of taxi systems. In: IJCAI, pp. 2811–2818 (2013)
Jin, J., et al.: Coride: joint order dispatching and fleet management for multi-scale ride-hailing platforms. In: CIKM, pp. 1983–1992 (2019)
Kleiner, A., Nebel, B., Ziparo, V.A.: A mechanism for dynamic ride sharing based on parallel auctions. In: IJCAI, pp. 266–272 (2011)
Lee, D.H., Wang, H., Cheu, R.L., Teo, S.H.: Taxi dispatch system based on current demands and real-time traffic conditions. Transp. Res. Rec. 1882(1), 193–200 (2004)
Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: WWW, pp. 661–670 (2010)
Li, M., et al.: Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning. In: WWW, pp. 983–994 (2019)
Lowalekar, M., Varakantham, P., Jaillet, P.: Online spatio-temporal matching in stochastic and dynamic domains. Artif. Intell. 261, 71–112 (2018)
McFadden, D.: Economic choices. Am. Econ. Rev. 91(3), 351–378 (2001)
Seow, K.T., Dang, N.H., Lee, D.H.: A collaborative multiagent taxi-dispatch system. IEEE Trans. Autom. Sci. Eng. 7(3), 607–616 (2009)
Small, K.A., Verhoef, E.T., Lindsey, R.: The economics of urban transportation. Routledge (2007)
Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. VLDB Endowment 9(12), 1053–1064 (2016)
Tong, Y., Wang, L., Zhou, Z., Chen, L., Du, B., Ye, J.: Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: SIGMOD, pp. 773–788 (2018)
Wardman, M.: The value of travel time: a review of British evidence. JTEP 32(3), 285–316 (1998)
Xu, Z., et al.: Large-scale order dispatch in on-demand ride-hailing platforms: a learning and planning approach. In: KDD, pp. 905–913 (2018)
Zha, L., Yin, Y., Xu, Z.: Geometric matching and spatial pricing in ride-sourcing markets. Transp. Res. Part C Emerg. Technol. 92, 58–75 (2018)
Zhang, L., Ye, Z., Xiao, K., Jin, B.: A parallel simulated annealing enhancement of the optimal-matching heuristic for ridesharing. In: ICDM, pp. 906–915 (2019)
Zhang, L., et al.: A taxi order dispatch model based on combinatorial optimization. In: KDD, pp. 2151–2159 (2017)
Zhao, B., Xu, P., Shi, Y., Tong, Y., Zhou, Z., Zeng, Y.: Preference-aware task assignment in on-demand taxi dispatching: an online stable matching approach. In: AAAI, pp. 2245–2252 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Hikima, Y., Kohjima, M., Akagi, Y., Kurashima, T., Toda, H. (2021). Price and Time Optimization for Utility-Aware Taxi Dispatching. In: Pham, D.N., Theeramunkong, T., Governatori, G., Liu, F. (eds) PRICAI 2021: Trends in Artificial Intelligence. PRICAI 2021. Lecture Notes in Computer Science(), vol 13031. Springer, Cham. https://doi.org/10.1007/978-3-030-89188-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-89188-6_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-89187-9
Online ISBN: 978-3-030-89188-6
eBook Packages: Computer ScienceComputer Science (R0)