Data-Driven Policies for the Online Ride-Hailing Problem with Fairness

Shachaf Ben-Gal () and Michal Tzur ()
Additional contact information
Shachaf Ben-Gal: Department of Industrial Engineering, Iby and Aladar Fleischman Faculty of Engineering, Tel Aviv University, Tel Aviv 6997801, Israel
Michal Tzur: Department of Industrial Engineering, Iby and Aladar Fleischman Faculty of Engineering, Tel Aviv University, Tel Aviv 6997801, Israel

Transportation Science, 2025, vol. 59, issue 3, 647-669

Abstract: Ride-hailing is a prevalent transportation service that facilitates mobility in urban areas. A ride-hailing service system encompasses several research problems, including the operational assignment of on-demand ride requests to vehicles in real time. The literature suggests various approaches to address similar systems, mainly optimizing the system efficiency, but recent studies pointed out that these systems are likely to cause geographical unfairness among passengers. Such unfairness may imply, for example, that requests whose origin or destination is far from centralized locations may suffer from excessive service rejections. In this paper, we suggest a data-driven approach to design an online assignment policy to overcome this phenomenon. We formulate the online ride-hailing problem with fairness that seeks to maximize both efficiency and geographical fairness in the system while achieving an adequate balance between them. To solve this problem, we offer a new general method to develop online assignment policies based on solutions for offline versions of the problem. The new method suggests extracting information from these solutions to guide real-time assignment decisions, which are chosen using a data-driven algorithm. With a simulation study, we examine the performance of our online policies relative to dispatching rules using synthetic random data that represent a real city layout and movement. Some of these rules are commonly used in practice, and some are more sophisticated ones. Our results demonstrate the viability of our approach to designing online policies. Compared with other dispatching rules, the experiments show that the generated policies maintain a better trade-off between efficiency and geographical fairness and preserve stable performance regardless of the instance size in different system settings.

Keywords: ride-hailing; data-driven policies; fairness; heuristics (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2023.0068 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:59:y:2025:i:3:p:647-669

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().