[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Empty-Car Routing in Ridesharing Systems

Published: 01 September 2019 Publication History

Abstract

Understanding the Fundamentals of Empty-Car Routing in Ridesharing Systems

Abstract

How to efficiently route empty-cars in ridesharing systems? In this paper “Empty-car Routing in Ridesharing Systems,” A. Braverman, J.G. Dai, X. Liu, and L. Ying introduce a novel model based on closed queueing networks and propose an optimization framework to optimize empty-car routing for maximizing system-wide utility functions. We propose a fluid-based optimal routing policy by solving the optimization problem in a large market regime. We establish both process-level and steady-state convergence of the closed queueing network to the fluid-limit and prove the optimal network utility obtained from the fluid-based optimization is an upper bound on the utility in the finite car system for any routing policy under which the closed queueing network has a stationary distribution. This upper bound is achieved asymptotically under the fluid-based optimal routing policy.

Abstract

This paper considers a closed queueing network model of ridesharing systems, such as Didi Chuxing, Lyft, and Uber. We focus on empty-car routing, a mechanism by which we control car flow in the network to optimize system-wide utility functions, for example, the availability of empty cars when a passenger arrives. We establish both process-level and steady-state convergence of the queueing network to a fluid limit in a large market regime where demand for rides and supply of cars tend to infinity and use this limit to study a fluid-based optimization problem. We prove that the optimal network utility obtained from the fluid-based optimization is an upper bound on the utility in the finite car system for any routing policy, both static and dynamic, under which the closed queueing network has a stationary distribution. This upper bound is achieved asymptotically under the fluid-based optimal routing policy. Simulation results with real-world data released by Didi Chuxing demonstrate the benefit of using the fluid-based optimal routing policy compared with various other policies.

References

[1]
Adelman D (2007) Price-directed control of a closed logistics queueing network. Oper. Res. 55(6):1022–1038.
[2]
Anselmi J, D’Auria B, Walton N (2013) Closed queueing networks under congestion: Nonbottleneck independence and bottleneck convergence. Math. Oper. Res. 38(3):469–491.
[3]
Asmussen S (2003) Applied Probability and Queues, 2nd ed. (Springer, New York).
[4]
Banerjee S, Freund D, Lykouris T (2016) Multi-objective pricing for shared vehicle systems. Working paper, Cornell University, Ithaca, NY.
[5]
Banerjee S, Freund D, Lykouris T (2017) Pricing and optimization in shared vehicle systems: An approximation framework. Working paper, Cornell University, Ithaca, NY.
[6]
Baskett F, Chandy KM, Muntz RR, Palacios FG (1975) Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Machinery 22(2):248–260.
[7]
Bimpikis K, Candogan O, Daniela S (2016) Spatial pricing in ride-sharing networks. Working paper, Stanford Graduate School of Business, Stanford, CA.
[8]
Chafkin M (2016) Uber’s first self-driving fleet arrives in pittsburgh this month. Bloomberg (August 18), https://www.bloomberg.com/news/features/2016-08-18/uber-s-first-self-driving-fleet-arrives-in-pittsburgh-this-month-is06r7on.
[9]
Chemla D, Meunier F, Calvo RW (2013) Bike sharing systems: Solving the static rebalancing problem. Discrete Optim. 10(2):120–146.
[10]
Czyzyk J, Mesnier MP, Moré JJ (1998) The NEOS server. IEEE Comput. Sci. Engrg. 5(3):68–75.
[11]
DRI (2016) Didi Research Institute website. Accessed June 30, 2016, http://research.xiaojukeji.com/index_en.html.
[12]
George DK (2012) Stochastic modeling and decentralized control policies for large-scale vehicle sharing systems via closed queueing networks. PhD thesis, The Ohio State University, Columbus.
[13]
George DK, Xia CH (2011) Fleet-sizing and service availability for a vehicle rental system via closed queueing networks. Eur. J. Oper. Res. 211(1):198–207.
[14]
Green LV, Kolesar PJ, Whitt W (2007) Coping with time-varying demand when setting staffing requirements for a service system. Production Oper. Management 16(1):13–39.
[15]
Henderson SG, O’Mahony E, Shmoys DB (2016) (Citi)Bike sharing. Working paper, Cornell University, Ithaca, NY.
[16]
Iglesias R, Rossi F, Zhang R, Pavone M (2016) A BCMP network approach to modeling and controlling autonomous mobility-on-demand systems. Working paper, Stanford University, Stanford, CA.
[17]
Krichagina EV (1992) Asymptotic analysis of queueing networks. Stochastics Stochastics Rep. 40(1–2):43–76.
[18]
Ma S, Zheng Y, Wolfson O (2013) T-share: A large-scale dynamic taxi ridesharing service. Proc. 2013 IEEE 29th Internat. Conf. Data Engrg. (Institute of Electrical and Electronics Engineers, Washington, DC), 410–421.
[19]
Ozkan E, Ward AR (2016) Dynamic matching for real-time ridesharing. Working paper, College of Administrative Sciences and Economics, Koç University, Istanbul.
[20]
Pavone M, Smith SL, Frazzoli E, Rus D (2012) Robotic load balancing for mobility-on-demand systems. Internat. J. Robotics Res. 31(7):839–854.
[21]
Reiser M, Lavenberg SS (1980) Mean-value analysis of closed multichain queuing networks. J. ACM 27(2):313–322.
[22]
Santos DO, Xavier EC (2015) Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems Appl. 42(19):6728–6737.
[23]
Suri R, Sahu S, Vernon M (2007) Approximate mean value analysis for closed queuing networks with multiple-server stations. Working paper, University of Wisconsin–Madison, Madison.
[24]
Waserhole A, Jost V (2013) Vehicle sharing system pricing regulation: A fluid approximation. Working paper, G-SCOP, University of Grenoble, Grenoble, France.
[25]
Waserhole A, Jost V (2016) Pricing in vehicle sharing systems: Optimization in queuing networks with product forms. EURO J. Trans. Logist. 5(3):293–320.
[26]
Yang P, Iyer K, Frazier PI (2016) Mean field equilibria for competitive exploration in resource sharing settings. Proc. 25th Internat. Conf. World Wide Web (WWW '16) (International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva), 177–187.
[27]
Zhang R, Pavone M (2016) Control of robotic mobility-on-demand systems. Internat. J. Robotics Res. 35(1–3):186–203.

Cited By

View all
  • (2024)Safe Model-Based Multi-Agent Mean-Field Reinforcement LearningProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662952(973-982)Online publication date: 6-May-2024
  • (2024)Heatmap-Based Decision Support for Repositioning in Ride-Sharing SystemsTransportation Science10.1287/trsc.2023.120258:1(110-130)Online publication date: 1-Jan-2024
  • (2024)Matching vs. Individual ChoiceTransportation Science10.1287/trsc.2022.006758:1(198-218)Online publication date: 1-Jan-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Operations Research
Operations Research  Volume 67, Issue 5
September-October 2019
297 pages
ISSN:0030-364X
DOI:10.1287/opre.2019.67.issue-5
Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 September 2019
Accepted: 04 September 2018
Received: 28 February 2017

Author Tags

  1. ridesharing
  2. fluid limit
  3. closed queueing network
  4. BCMP network
  5. car routing

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Safe Model-Based Multi-Agent Mean-Field Reinforcement LearningProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662952(973-982)Online publication date: 6-May-2024
  • (2024)Heatmap-Based Decision Support for Repositioning in Ride-Sharing SystemsTransportation Science10.1287/trsc.2023.120258:1(110-130)Online publication date: 1-Jan-2024
  • (2024)Matching vs. Individual ChoiceTransportation Science10.1287/trsc.2022.006758:1(198-218)Online publication date: 1-Jan-2024
  • (2024)Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing NetworkOperations Research10.1287/opre.2022.242572:5(2097-2118)Online publication date: 1-Sep-2024
  • (2024)On-Demand Ride-Matching in a Spatial Model with Abandonment and CancellationOperations Research10.1287/opre.2022.239972:3(1278-1297)Online publication date: 1-May-2024
  • (2024)Multiobjective Stochastic OptimizationManufacturing & Service Operations Management10.1287/msom.2020.024726:2(500-518)Online publication date: 1-Mar-2024
  • (2024)Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing NetworksMathematics of Operations Research10.1287/moor.2022.016349:3(1647-1677)Online publication date: 1-Aug-2024
  • (2024)Blind Dynamic Resource Allocation in Closed Networks via Mirror BackpressureManagement Science10.1287/mnsc.2023.493470:8(5445-5462)Online publication date: 1-Aug-2024
  • (2024)Spatiotemporal Pricing and Fleet Management of Autonomous Mobility-on-Demand Networks: A Decomposition and Dynamic Programming Approach With Bounded Optimality GapIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.334025325:7(7057-7069)Online publication date: 1-Jul-2024
  • (2024)A Reinforcement Learning and Prediction-Based Lookahead Policy for Vehicle Repositioning in Online Ride-Hailing SystemsIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.331204825:2(1846-1856)Online publication date: 1-Feb-2024
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media