IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v67y2019i5p1437-1452.html
   My bibliography  Save this article

Empty-Car Routing in Ridesharing Systems

Author

Listed:
  • Anton Braverman

    (Kellogg School of Management, Kellogg Global Hub, 2211 Campus Drive, Evanston, Illinois 60208)

  • J. G. Dai

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853; Institute for Data and Decision Analytics (iDDA) and Shenzhen Research Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, 518172 China)

  • Xin Liu

    (School of Electrical, Computer, and Energy Engineering, Arizona State University, Tempe, Arizona 85281)

  • Lei Ying

    (School of Electrical, Computer, and Energy Engineering, Arizona State University, Tempe, Arizona 85281)

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.

Suggested Citation

  • Anton Braverman & J. G. Dai & Xin Liu & Lei Ying, 2019. "Empty-Car Routing in Ridesharing Systems," Operations Research, INFORMS, vol. 67(5), pages 1437-1452, September.
    • Handle: RePEc:inm:oropre:v:67:y:2019:i:5:p:1437-1452
    DOI: opre.2018.1822
    as

    Download full text from publisher

    File URL: https://doi.org/opre.2018.1822
    Download Restriction: no
    File URL: https://libkey.io/opre.2018.1822?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Bimpikis, Kostas & Candogan, Ozan & Saban, Daniela, 2016. "Spatial Pricing in Ride-Sharing Networks," Research Papers 3482, Stanford University, Graduate School of Business.
    2. Jonatha Anselmi & Bernardo D'Auria & Neil Walton, 2013. "Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 469-491, August.
    3. Daniel Adelman, 2007. "Price-Directed Control of a Closed Logistics Queueing Network," Operations Research, INFORMS, vol. 55(6), pages 1022-1038, December.
    4. George, David K. & Xia, Cathy H., 2011. "Fleet-sizing and service availability for a vehicle rental system via closed queueing networks," European Journal of Operational Research, Elsevier, vol. 211(1), pages 198-207, May.
    5. Ariel Waserhole & Vincent Jost, 2016. "Pricing in vehicle sharing systems: optimization in queuing networks with product forms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 293-320, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    2. Quan-Lin Li & Rui-Na Fan, 2022. "A mean-field matrix-analytic method for bike sharing systems under Markovian environment," Annals of Operations Research, Springer, vol. 309(2), pages 517-551, February.
    3. Li, Shukai & Luo, Qi & Hampshire, Robert Cornelius, 2021. "Optimizing large on-demand transportation systems through stochastic conic programming," European Journal of Operational Research, Elsevier, vol. 295(2), pages 427-442.
    4. Van der Heide, G. & Roodbergen, K.J., 2013. "Transshipment and rebalancing policies for library books," European Journal of Operational Research, Elsevier, vol. 228(2), pages 447-456.
    5. Saif Benjaafar & Daniel Jiang & Xiang Li & Xiaobo Li, 2022. "Dynamic Inventory Repositioning in On-Demand Rental Networks," Management Science, INFORMS, vol. 68(11), pages 7861-7878, November.
    6. Saif Benjaafar & Shining Wu & Hanlin Liu & Einar Bjarki Gunnarsson, 2022. "Dimensioning On-Demand Vehicle Sharing Systems," Management Science, INFORMS, vol. 68(2), pages 1218-1232, February.
    7. Long He & Guangrui Ma & Wei Qi & Xin Wang, 2021. "Charging an Electric Vehicle-Sharing Fleet," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 471-487, March.
    8. Long Gao & Jim (Junmin) Shi & Michael F. Gorman & Ting Luo, 2020. "Business Analytics for Intermodal Capacity Management," Manufacturing & Service Operations Management, INFORMS, vol. 22(2), pages 310-329, March.
    9. Sharon Datner & Tal Raviv & Michal Tzur & Daniel Chemla, 2019. "Setting Inventory Levels in a Bike Sharing Network," Service Science, INFORMS, vol. 53(1), pages 62-76, February.
    10. Wang, Tao & Guo, Jia & Zhang, Wei & Wang, Kai & Qu, Xiaobo, 2024. "On the planning of zone-based electric on-demand minibus," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    11. Christine Fricker & Nicolas Servel, 2016. "Two-choice regulation in heterogeneous closed networks," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 173-197, February.
    12. Ariel Waserhole & Vincent Jost, 2016. "Pricing in vehicle sharing systems: optimization in queuing networks with product forms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 293-320, August.
    13. Stokkink, Patrick & Geroliminis, Nikolas, 2021. "Predictive user-based relocation through incentives in one-way car-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 230-249.
    14. Liu, Yang & Xie, Jiaohong & Chen, Nan, 2022. "Stochastic one-way carsharing systems with dynamic relocation incentives through preference learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    15. Belleh Fontem, 2022. "An optimal stopping policy for car rental businesses with purchasing customers," Annals of Operations Research, Springer, vol. 317(1), pages 47-76, October.
    16. Foschi, Rachele, 2023. "A Point Processes approach to bicycle sharing systems’ design and management," Socio-Economic Planning Sciences, Elsevier, vol. 87(PB).
    17. Christine Fricker & Nicolas Gast, 2016. "Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 261-291, August.
    18. Saif Benjaafar & Ming Hu, 2020. "Operations Management in the Age of the Sharing Economy: What Is Old and What Is New?," Manufacturing & Service Operations Management, INFORMS, vol. 22(1), pages 93-101, January.
    19. Nourinejad, Mehdi & Zhu, Sirui & Bahrami, Sina & Roorda, Matthew J., 2015. "Vehicle relocation and staff rebalancing in one-way carsharing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 98-113.
    20. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:67:y:2019:i:5:p:1437-1452. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.