Data-Driven Policies for the Online Ride-Hailing Problem with Fairness
Published Online:26 Mar 2025https://doi.org/10.1287/trsc.2023.0068
References
- (2023) A novel repositioning approach and analysis for dynamic ride-hailing problems. EURO J. Transportation Logist. 12:100109.Crossref, Google Scholar
- (2012) Optimization for dynamic ride-sharing: A review. Eur. J. Oper. Res. 223(2):295–303.Crossref, Google Scholar
- (2017) On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Natl. Acad. Sci. USA 114(3):462–467.Crossref, Google Scholar
- (2022) Supplier menus for dynamic matching in peer-to-peer transportation platforms. Transportation Sci. 56(5):1304–1326.Link, Google Scholar
- (2022) A learning-based optimization approach for autonomous ridesharing platforms with service-level contracts and on-demand hiring of idle vehicles. Transportation Sci. 56(3):677–703.Link, Google Scholar
- (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6):977–987.Link, Google Scholar
- (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8–15. Crossref, Google Scholar
- (2012) On the efficiency-fairness trade-off. Management Sci. 58(12):2234–2250.Link, Google Scholar
- (2019) Online vehicle routing: The edge of optimization in large-scale applications. Oper. Res. 67(1):143–162.Link, Google Scholar
- (2020) Understanding inequalities in ride-hailing services through simulations. Sci. Rep. 10(1):6500.Crossref, Google Scholar
- (2023) Same-day delivery with fair customer service. Eur. J. Oper. Res. 308:738–751.Crossref, Google Scholar
- (2007) The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. 153(1):29–46.Crossref, Google Scholar
- (2021) Allocation problems in ride-sharing platforms: Online matching with offline reusable resources. ACM Trans. Econom. Comput. 9(3):13.Google Scholar
- (2018) An empirical study on travel patterns of internet based ride-sharing. Transportation Res. Part C Emerging Tech. 86:1–22.Crossref, Google Scholar
- (2020) Centralized and decentralized autonomous dispatching strategy for dynamic autonomous taxi operation in hybrid request mode. Transportation Res. Part C Emerging Tech. 111:397–420.Crossref, Google Scholar
- (2019) The humanitarian pickup and distribution problem. Oper. Res. 67(1):10–32.Link, Google Scholar
- (2014) The travel and environmental implications of shared autonomous vehicles, using agent-based model scenarios. Transportation Res. Part C Emerging Tech. 40:1–13.Crossref, Google Scholar
- (2021) We are on the way: Analysis of on-demand ride-hailing systems. Manufacturing Service Oper. Management 23(5):1237–1256.Link, Google Scholar
- (2023) Combining value function approximation and multiple scenario approach for the effective management of ride-hailing services. EURO J. Transportation Logist. 12:100104.Crossref, Google Scholar
- (2019) Uber, public transit, and urban transportation equity: A case study in New York City. Professional Geographer 71(2):315–330.Crossref, Google Scholar
- (1990) An optimal algorithm for on-line bipartite matching. Proc. Twenty-Second Annual ACM Sympos. Theory Comput. (ACM, New York), 352–358.Google Scholar
- (1963) The Advanced Theory of Statistics Volume 1 Distribution Theory (Griffin, London).Google Scholar
- (2022) Dynamic ride-hailing with electric vehicles. Transportation Sci. 56(3):775–794.Link, Google Scholar
- (2022) Improving zonal fairness while maintaining efficiency in rideshare matching. Proc. Twelfth Internat. Workshop Agents Traffic Transportation (ATT’ 2022) (Vienna, Austria), 77–90.Google Scholar
- (2015) Dynamic ridesharing: Is there a role for dedicated drivers? Transportation Res. Part B Methodological 81:483–497.Crossref, Google Scholar
- (2019) Balancing efficiency and fairness in on-demand ridesourcing. Advances in Neural Information Processing Systems, vol. 32 (Curran Associates, Inc., Red Hook, NY), 477.Google Scholar
- (2018) Efficient large-scale fleet management via multi-agent deep reinforcement learning. KDD’18 Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (London), 1774–1783.Google Scholar
- (2018) Online spatio-temporal matching in stochastic and dynamic domains. Artificial Intelligence 261:71–112.Crossref, Google Scholar
- (2021) Group-level fairness maximization in online bipartite matching. Preprint, submitted May 21, https://arxiv.org/abs/2011.13908.Google Scholar
- (2016) An assignment-based approach to efficient real-time city-scale taxi dispatching. IEEE Intelligent Systems 31(1):68–77. Crossref, Google Scholar
- (1991) Modelling effectiveness-equity trade-offs in public service delivery systems. Management Sci. 37(4):467–482.Link, Google Scholar
- (2016) Taxi dispatch with real-time sensing data in metropolitan areas: A receding horizon control approach. IEEE Trans. Automation Sci. Engrg. 13(2):463–478.Crossref, Google Scholar
- (2020) Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours. Proc. AAAI Conf. Artificial Intelligence 24(2):2210–2217.Google Scholar
- (2024) The dynamic pickup and allocation with fairness problem. Transportation Sci. 58(4):821–840.Link, Google Scholar
- (2020) Exploring the equity of traditional and ride-hailing taxi services during peak hours. Transportation Res. Record 2674(9):266–278.Crossref, Google Scholar
- (2019) A unified framework for stochastic optimization. Eur. J. Oper. Res. 275(3):795–821.Crossref, Google Scholar
- (2021) Data-driven methods for balancing fairness and efficiency in ride-pooling. Proc. Thirtieth Internat. Joint Conf. Artificial Intelligence (ijcai.org), 363–369.Google Scholar
- (2018) The meal delivery routing problem. Optim. Online 1–70. Google Scholar
- (2021) Towards a geographically even level of service in on-demand ridepooling. 2021 IEEE Internat. Intelligent Transportation Systems Conf. (ITSC) (IEEE, Piscataway, NJ), 2429–2434.Google Scholar
- (2019) Two-sided fairness for repeated matchings in two-sided markets: A case study of a ride-hailing platform. Proc. 25th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 3082–3092.Google Scholar
- (2021) Fast approximate solutions using reinforcement learning for dynamic capacitated vehicle routing with time windows. Proc. Adaptive Learning Agents Workshop Twentieth Internat. Conf. Autonomous Agents Multiagent Systems (AAMAS 2021).Google Scholar
- (2022) Optimizing long-term efficiency and fairness in ride-hailing via joint order dispatching and driver repositioning. KDD’22 Proc. 28th ACM SIGKDD Conf. Knowledge Discovery Data Mining (ACM, New York), 3950–3960.Google Scholar
- (2023) Anticipatory rebalancing of RoboTaxi systems. Transportation Res. Part C Emerging Tech. 153:104196.Crossref, Google Scholar
- (2017) Toward a geographic understanding of the sharing economy: Systemic biases in UberX and TaskRabbit. ACM Trans. Comput-Human Interaction 24(3):21.Crossref, Google Scholar
- (2021) The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transportation Sci. 55(1):75–100.Link, Google Scholar
- (2019) The same-day delivery problem for online purchases. Transportation Sci. 53(1):167–184.Link, Google Scholar
- (2022) Real-time driver-request assignment in ridesourcing. Proc. Thirty-Sixth AAAI Conf. Artificial Intelligence (AAAI-22) 36(4):3840–3849.Google Scholar
- (2019) Ridesourcing systems: A framework and review. Transportation Res. Part B Methodological 129:122–155. Crossref, Google Scholar

