• Corpus ID: 251280313

Planning ride-sharing services with detour restrictions for spatially heterogeneous demand: A multi-zone queuing network approach

  title={Planning ride-sharing services with detour restrictions for spatially heterogeneous demand: A multi-zone queuing network approach},
  author={Yining Liu and Yanfeng Ouyang},
This study presents a multi-zone queuing network model for steady-state ride-sharing operations that serve heterogeneous demand, and then builds upon this model to optimize the design of ridesharing services. Spatial heterogeneity is addressed by partitioning the study region into a set of relatively homogeneous zones, and a set of criteria are imposed to avoid significant detours among matched passengers. A generalized multi-zone queuing network model is then developed to describe how vehicles… 



On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment

A more general mathematical model for real-time high-capacity ride-sharing that scales to large numbers of passengers and trips and dynamically generates optimal routes with respect to online demand and vehicle locations is presented.

Path-based dynamic pricing for vehicle allocation in ridesharing systems with fully compliant drivers

Spatial pricing of ride-sourcing services in a congested transportation network

Optimal Spatial Pricing for an On-demand Ride-sourcing Service Platform

This paper investigates a long-term optimal spatial pricing strategy for a ride-sourcing platform that serves a particular (possibly populated) area with profit-driven service providers (i.e.,

Equilibrium Analysis of Urban Traffic Networks with Ride-Sourcing Services

This paper enhances the methodology by explicitly modeling those vacant trips, which include cruising for customers and deadheading for picking up them, and describes the equilibrium state that results from the interactions between background regular traffic and occupied, idle, and deadheaded ride-sourcing vehicles.

Analysis of ride-sharing with service time and detour guarantees

Stable Matching for Dynamic Ride-Sharing Systems

This paper considers a notion of stability for ride-sharing matches and presents several mathematical programming methods to establish stable or nearly-stable matches, where it is noted that ride-share matching optimization is performed over time with incomplete information.

A mean-field Markov decision process model for spatial-temporal subsidies in ride-sourcing markets