Near-on-Demand Mobility. The Benefits of User Flexibility for Ride-Pooling Services
Authors:
- Zhenliang MaZMZhenliang Ma
- Haris N. KoutsopoulosHKHaris N. Koutsopoulos
Preprint
Abstract
Mobility-On-Demand (MoD) services have been transforming the urban mobility ecosystem. However, they raise a lot of concerns for their impact on congestion, Vehicle Miles Travelled (VMT), and competition with transit. There are also questions about their long-term survival because of inherent inefficiencies in their operations. Considering the popularity of the MoD services, increasing ride-pooling is an important means to address these concerns. Shareability depends not only on riders attitudes and preferences but also on operating models deployed by providers. The paper introduces an advance requests operating model for ride pooling where users may request rides at least H minutes in advance of their desired departure times. A platform with efficient algorithms for request matching, vehicle routing, rebalancing, and flexible user preferences is developed. A large-scale transportation network company dataset is used to evaluate the performance of the advance requests system relative to current practices. The impacts of various design aspects of the system (advance requests horizon, vehicle capacity) on its performance are investigated. The sensitivity of the results to user preferences in terms of the level of service (time to be served and excess trip time), willingness to share and place requests in advance, and traffic conditions are explored. The results suggest that significant benefits in terms of sustainability, level of service, and fleet utilization can be realized when advance requests are along with an increased willingness to share. Furthermore, even near-on-demand (relative short advance planning horizons) operations can offer many benefits for all stakeholders involved (passengers, operators, and cities).Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Why most DRT/Micro-Transits fail – What the survivors tell us about progressResearch in Transportation Economics, 2020
- Dynamic pricing and matching in ride‐hailing platformsNaval Research Logistics (NRL), 2019
- A survey of dial-a-ride problems: Literature review and recent developmentsTransportation Research Part B: Methodological, 2018
- A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing systemTransportation Research Part B: Methodological, 2017
- OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networksComputers, Environment and Urban Systems, 2017
- Typology and literature review for dial-a-ride problemsAnnals of Operations Research, 2017
- The benefits of meeting points in ride-sharing systemsTransportation Research Part B: Methodological, 2015
- Dynamic ride-sharing: A simulation study in metro AtlantaTransportation Research Part B: Methodological, 2011
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986