Optimizing large on-demand transportation systems through stochastic conic programming

Abstract On-demand transportation systems (OTS) are increasingly popular worldwide. Prior literature has studied how to control vehicle fleet in queueing-networks to rebalance excess supply or demand in OTS. This aggregated setting models the stochastic demand process and decompose large-scale networks for which product-form equilibrium distributions exist. However, such an approach is unsatisfactory in terms of computational complexity for its dependence on vehicle numbers. This paper presents a stochastic conic programming approach that obtains the near-optimal vehicle repositioning controls with endogenous demand with mild computational complexity and high fidelity. This global framework covers most existing queueing-network-based OTS models in the literature. Leveraging this approach, we explore day-to-day vehicle repositioning problems for on-demand vehicle operations in New York City. These results support the potential for providing a more accessible and sustainable on-demand mobility service, which is of particular significance as multimodal transport continues to emerge.

[1]  David B. Shmoys,et al.  Minimizing Multimodular Functions and Allocating Capacity in Bike‐Sharing Systems , 2016, IPCO.

[2]  Joseph Ying Jun Chow,et al.  Non-myopic Relocation of Idle Mobility-on-Demand Vehicles as a Dynamic Location-Allocation-Queueing Problem , 2017 .

[3]  Gérard P. Cachon,et al.  The Role of Surge Pricing on a Service Platform with Self-Scheduling Capacity , 2016, Manuf. Serv. Oper. Manag..

[4]  Paolo Santi,et al.  Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing , 2022 .

[5]  Christopher S. Tang,et al.  Coordinating Supply and Demand on an On-Demand Service Platform with Impatient Customers , 2017, Manuf. Serv. Oper. Manag..

[6]  M. Lariviere,et al.  Operations in the On-Demand Economy: Staffing Services with Self-Scheduling Capacity , 2016 .

[7]  Krishna R. Pattipati,et al.  Approximate mean value analysis algorithms for queuing networks: existence, uniqueness, and convergence results , 1990, JACM.

[8]  Quanlin Li,et al.  Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks , 2020, Processes.

[9]  Jonatha Anselmi,et al.  Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence , 2012, Math. Oper. Res..

[10]  Marco Pavone,et al.  A BCMP network approach to modeling and controlling autonomous mobility-on-demand systems , 2016, Int. J. Robotics Res..

[11]  Walid Klibi,et al.  Planning and operating a shared goods and passengers on-demand rapid transit system for sustainable city-logistics , 2015 .

[12]  Christo Wilson,et al.  Profiling Transport Network Company Activity using Big Data , 2018 .

[13]  Emilio Frazzoli,et al.  Robotic load balancing for mobility-on-demand systems , 2012, Int. J. Robotics Res..

[14]  Hai Yang,et al.  Economic Analysis of Ride-sourcing Markets , 2016 .

[15]  Terry A. Taylor,et al.  On-Demand Service Platforms , 2017, Manuf. Serv. Oper. Manag..

[16]  Qi Luo.  Dynamic Congestion Pricing for Ridesourcing Traffic: a Simulation Optimization Approach , 2019, 2019 Winter Simulation Conference (WSC).

[17]  Cathy H. Xia,et al.  Fleet-sizing and service availability for a vehicle rental system via closed queueing networks , 2011, Eur. J. Oper. Res..

[18]  M. J. M. Posner,et al.  Closed Finite Queuing Networks with Time Lags , 1968, Oper. Res..

[19]  Hai Yang,et al.  Ridesourcing systems: A framework and review , 2019, Transportation Research Part B: Methodological.

[20]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[21]  Lei Ying,et al.  Empty-Car Routing in Ridesharing Systems , 2016, Oper. Res..

[22]  Jee Eun Kang,et al.  Inventory rebalancing through pricing in public bike sharing systems , 2018, Eur. J. Oper. Res..

[23]  Marco Pavone,et al.  Control of robotic mobility-on-demand systems: A queueing-theoretical perspective , 2014, Int. J. Robotics Res..

[24]  Niels A. H. Agatz,et al.  The Benefits of Meeting Points in Ride-Sharing Systems , 2015 .

[25]  Güneş Erdoğan,et al.  Discrete Optimization An exact algorithm for the static rebalancing problem arising in bicycle sharing systems , 2015 .

[26]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[27]  Yashodhan Kanoria,et al.  State Dependent Control of Closed Queueing Networks , 2018, PERV.

[28]  David A. Hensher,et al.  Mobility as a service (MaaS): Charting a future context , 2020, Transportation Research Part A: Policy and Practice.

[29]  Qi Luo,et al.  Multimodal Connections between Dockless Bikesharing and Ride-Hailing: An Empirical Study in New York City , 2018, 2018 21st International Conference on Intelligent Transportation Systems (ITSC).

[30]  Robert C. Hampshire,et al.  Inventory rebalancing and vehicle routing in bike sharing systems , 2017, Eur. J. Oper. Res..

[31]  Joseph Y. J. Chow,et al.  A scalable non-myopic dynamic dial-a-ride and pricing problem , 2015 .

[32]  Kostas Bimpikis,et al.  Spatial Pricing in Ride-Sharing Networks , 2019, Oper. Res..

[33]  Amy R. Ward,et al.  Dynamic Matching for Real-Time Ride Sharing , 2020 .

[34]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[35]  Pascal Van Hentenryck,et al.  Benders Decomposition for the Design of a Hub and Shuttle Public Transit System , 2015, Transp. Sci..

[36]  Weibo Li,et al.  A Critical Review of New Mobility Services for Urban Transport , 2016 .

[37]  Omar J. Ibarra-Rojas,et al.  Planning, operation, and control of bus transport systems: A literature review , 2015 .

[38]  Rajan Suri,et al.  Robustness of queuing network formulas , 1983, JACM.

[39]  Vincent Jost,et al.  Pricing in vehicle sharing systems: optimization in queuing networks with product forms , 2016, EURO J. Transp. Logist..

[40]  Christian Artigues,et al.  Vehicle routing problems with alternative paths: An application to on-demand transportation , 2010, Eur. J. Oper. Res..

[41]  Tal Raviv,et al.  Static repositioning in a bike-sharing system: models and solution approaches , 2013, EURO J. Transp. Logist..

[42]  Martin W. P. Savelsbergh,et al.  Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..

[43]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[44]  Hua Zhang,et al.  Optimal Passenger-Seeking Policies on E-hailing Platforms Using Markov Decision Process and Imitation Learning , 2019 .

[45]  Marco Pavone,et al.  Analysis, Control, and Evaluation of Mobility-on-Demand Systems: A Queueing-Theoretical Approach , 2019, IEEE Transactions on Control of Network Systems.

[46]  Emilio Frazzoli,et al.  On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.

[47]  Carlos F. Daganzo,et al.  A general model of demand-responsive transportation services: From taxi to ridesharing to dial-a-ride , 2019, Transportation Research Part B: Methodological.