Skip to main content

2019 | OriginalPaper | Buchkapitel

Reverse-Auction-Based Competitive Order Assignment for Mobile Taxi-Hailing Systems

verfasst von : Hui Zhao, Mingjun Xiao, Jie Wu, An Liu, Baoyi An

Erschienen in: Database Systems for Advanced Applications

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Mobile Taxi-Hailing (MTH) is one of the most attractive smartphone applications, through which passengers can reserve taxis ahead for their travels so that the taxi service’s efficiency can improve significantly. The taxi-hailing order assignment is an important component of MTH systems. Current MTH order assignment mechanisms fall short in flexibility and personalized pricing, resulting in an unsatisfactory service experience. To address this problem, we introduce a Competitive Order Assignment (COA) framework for the MTH systems. The COA framework mainly consists of the Multi-armed-bandit Automatic Valuation (MAV) mechanism and the Reverse-auction-based Order Assignment (ROA) mechanism. The taxis apply the MAV mechanism to automatically generate the transport service valuations for orders. The platform applies the ROA mechanism to complete each round of order assignment. Then, we analyze the online performance of MAV, and prove that ROA satisfies the properties of truthfulness and individual rationality. Finally, we also demonstrate the significant performances of MAV and ROA through extensive simulations on a real trace.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
3.
Zurück zum Zitat Agrawal, R.: Sample mean based index policies by \(o(\log n)\) regret for the multi-armed bandit problem. Adv. Appl. Probab. 27(4), 1054–1078 (1995)MathSciNetCrossRef Agrawal, R.: Sample mean based index policies by \(o(\log n)\) regret for the multi-armed bandit problem. Adv. Appl. Probab. 27(4), 1054–1078 (1995)MathSciNetCrossRef
4.
Zurück zum Zitat Asghari, M., Deng, D., Shahabi, C., Demiryurek, U., Li, Y.: Price-aware real-time ride-sharing at scale: an auction-based approach. In: ACM SIGSPATIAL (2016) Asghari, M., Deng, D., Shahabi, C., Demiryurek, U., Li, Y.: Price-aware real-time ride-sharing at scale: an auction-based approach. In: ACM SIGSPATIAL (2016)
5.
Zurück zum Zitat Asghari, M., Shahabi, C.: An on-line truthful and individually rational pricing mechanism for ride-sharing. In: ACM SIGSPATIAL (2017) Asghari, M., Shahabi, C.: An on-line truthful and individually rational pricing mechanism for ride-sharing. In: ACM SIGSPATIAL (2017)
6.
Zurück zum Zitat Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002)CrossRef Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002)CrossRef
7.
Zurück zum Zitat Chen, L., Zhong, Q., Xiao, X., Gao, Y., Jin, P., Jensen, C.S.: Price-and-time-aware dynamic ridesharing. In: IEEE ICDE (2018) Chen, L., Zhong, Q., Xiao, X., Gao, Y., Jin, P., Jensen, C.S.: Price-and-time-aware dynamic ridesharing. In: IEEE ICDE (2018)
8.
Zurück zum Zitat Chen, L., Gao, Y., Liu, Z., Xiao, X., Jensen, C.S., Zhu, Y.: PTrider: a price-and-time-aware ridesharing system. Proc. VLDB Endow. 11(12), 1938–1941 (2018)CrossRef Chen, L., Gao, Y., Liu, Z., Xiao, X., Jensen, C.S., Zhu, Y.: PTrider: a price-and-time-aware ridesharing system. Proc. VLDB Endow. 11(12), 1938–1941 (2018)CrossRef
9.
Zurück zum Zitat Gao, G., Xiao, M., Zhao, Z.: Optimal multi-taxi dispatch for mobile taxi-hailing systems. In: ICPP (2016) Gao, G., Xiao, M., Zhao, Z.: Optimal multi-taxi dispatch for mobile taxi-hailing systems. In: ICPP (2016)
10.
Zurück zum Zitat Garg, N., Ranu, S.: Route recommendations for idle taxi drivers: find me the shortest route to a customer! In: ACM SIGKDD (2018) Garg, N., Ranu, S.: Route recommendations for idle taxi drivers: find me the shortest route to a customer! In: ACM SIGKDD (2018)
11.
Zurück zum Zitat Kang, S., Joo, C.: Low-complexity learning for dynamic spectrum access in multi-user multi-channel networks. In: IEEE INFOCOM (2018) Kang, S., Joo, C.: Low-complexity learning for dynamic spectrum access in multi-user multi-channel networks. In: IEEE INFOCOM (2018)
12.
Zurück zum Zitat Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics (NRL) 2(1–2), 83–97 (1955)MathSciNetCrossRef Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics (NRL) 2(1–2), 83–97 (1955)MathSciNetCrossRef
13.
Zurück zum Zitat Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4–22 (1985)MathSciNetCrossRef Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4–22 (1985)MathSciNetCrossRef
14.
Zurück zum Zitat Liu, A., et al.: Privacy-preserving task assignment in spatial crowdsourcing. J. Comput. Sci. Technol. 32(5), 905–918 (2017)MathSciNetCrossRef Liu, A., et al.: Privacy-preserving task assignment in spatial crowdsourcing. J. Comput. Sci. Technol. 32(5), 905–918 (2017)MathSciNetCrossRef
15.
Zurück zum Zitat Liu, A., Wang, W., Shang, S., Li, Q., Zhang, X.: Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22(2), 335–362 (2018)CrossRef Liu, A., Wang, W., Shang, S., Li, Q., Zhang, X.: Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22(2), 335–362 (2018)CrossRef
16.
Zurück zum Zitat Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)MathSciNetCrossRef Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)MathSciNetCrossRef
17.
Zurück zum Zitat Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)CrossRef Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)CrossRef
18.
Zurück zum Zitat Tong, Y., Wang, L., Zhou, Z., Chen, L., Du, B., Ye, J.: Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: ACM SIGMOD (2018) Tong, Y., Wang, L., Zhou, Z., Chen, L., Du, B., Ye, J.: Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: ACM SIGMOD (2018)
19.
Zurück zum Zitat Tran-Thanh, L., Stein, S., Rogers, A., Jennings, N.R.: Efficient crowdsourcing of unknown experts using bounded multi-armed bandits. AI 214, 89–111 (2014)MathSciNetMATH Tran-Thanh, L., Stein, S., Rogers, A., Jennings, N.R.: Efficient crowdsourcing of unknown experts using bounded multi-armed bandits. AI 214, 89–111 (2014)MathSciNetMATH
21.
Zurück zum Zitat Xiao, M., et al.: SRA: secure reverse auction for task assignment in spatial crowdsourcing. In: IEEE TKDE, p. 1 (2019) Xiao, M., et al.: SRA: secure reverse auction for task assignment in spatial crowdsourcing. In: IEEE TKDE, p. 1 (2019)
22.
Zurück zum Zitat Xiao, M., Wu, J., Huang, L., Cheng, R., Wang, Y.: Online task assignment for crowdsensing in predictable mobile social networks. IEEE Trans. Mob. Comput. 16(8), 2306–2320 (2017)CrossRef Xiao, M., Wu, J., Huang, L., Cheng, R., Wang, Y.: Online task assignment for crowdsensing in predictable mobile social networks. IEEE Trans. Mob. Comput. 16(8), 2306–2320 (2017)CrossRef
23.
Zurück zum Zitat Zheng, H., Wu, J.: Online to offline business: urban taxi dispatching with passenger-driver matching stability. In: IEEE ICDCS (2017) Zheng, H., Wu, J.: Online to offline business: urban taxi dispatching with passenger-driver matching stability. In: IEEE ICDCS (2017)
Metadaten
Titel
Reverse-Auction-Based Competitive Order Assignment for Mobile Taxi-Hailing Systems
verfasst von
Hui Zhao
Mingjun Xiao
Jie Wu
An Liu
Baoyi An
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-18579-4_39