Author
Listed:
- Dongling Rong
(School of Management, Xi’an Jiaotong University, Shaanxi 710049, China)
- Xinyu Sun
(School of Management, Xi’an Jiaotong University, Shaanxi 710049, China)
- Meilin Zhang
(School of Business, Singapore University of Social Science, Singapore 599494, Singapore)
- Shuangchi He
(Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 117576, Singapore)
Abstract
Online ride-hailing platforms have developed into an integral part of the transportation infrastructure in many countries. The primary task of a ride-hailing platform is to match trip requests to drivers in real time. Although both passengers and drivers prefer a prompt pickup to initiate the trips, it is often difficult to find a nearby driver for every passenger. If the driver is far from the pickup point, the passenger may cancel the trip while the driver is heading toward the pickup point. For the platform to be profitable, the trip cancellation rate must be maintained at a low level. We propose a computationally efficient data-driven approach to ride matching, in which a pickup time target is imposed on each trip request and an optimization problem is formulated to maximize the joint probability of all the pickup times meeting the targets. By adjusting pickup time targets individually, this approach may assign more high-value trip requests to nearby drivers, thus boosting the platform’s revenue while maintaining a low cancellation rate. In numerical experiments, the proposed approach outperforms several ride-matching policies used in practice.
Suggested Citation
Dongling Rong & Xinyu Sun & Meilin Zhang & Shuangchi He, 2025.
"Satisficing Approach to On-Demand Ride Matching,"
INFORMS Journal on Computing, INFORMS, vol. 37(2), pages 413-427, March.
Handle:
RePEc:inm:orijoc:v:37:y:2025:i:2:p:413-427
DOI: 10.1287/ijoc.2021.0210
Download full text from publisher
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:orijoc:v:37:y:2025:i:2:p:413-427. 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.