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

On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation

Author

Listed:
  • Guangju Wang

    (Shanghai Qi Zhi Institute, Shanghai, 200232 China)

  • Hailun Zhang

    (School of Data Science, Shenzhen Research Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, 518172 China)

  • Jiheng Zhang

    (Department of Industrial Engineering & Decision Analytics, The Hong Kong University of Science and Technology, Hong Kong)

Abstract

Ride-hailing platforms, such as Uber, Lyft, and DiDi, coordinate supply and demand by matching passengers and drivers. The platform has to promptly dispatch drivers when receiving requests because, otherwise, passengers may lose patience and abandon the service by switching to alternative transportation methods. However, having fewer idle drivers results in a possible lengthy pickup time, which is a waste of system capacity and may cause passengers to cancel the service after they are matched. Because of the complex spatial and queueing dynamics, analysis of the matching decision is challenging. In this paper, we propose a spatial model to approximate the pickup time based on the number of waiting passengers and idle drivers. We analyze the dynamics of passengers and drivers in a queueing model in which the platform can control the matching process by setting a threshold on the expected pickup time. Applying fluid approximations, we obtain accurate performance evaluations and an elegant optimality condition, based on which we propose a policy that adapts to time-varying demand.

Suggested Citation

  • Guangju Wang & Hailun Zhang & Jiheng Zhang, 2024. "On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation," Operations Research, INFORMS, vol. 72(3), pages 1278-1297, May.
  • Handle: RePEc:inm:oropre:v:72:y:2024:i:3:p:1278-1297
    DOI: 10.1287/opre.2022.2399
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2399
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.2399?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
    ---><---

    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:72:y:2024:i:3:p:1278-1297. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.