Empty-Car Routing in Ridesharing Systems
From MaRDI portal
Publication:5129204
DOI10.1287/opre.2018.1822zbMath1444.90031arXiv1609.07219OpenAlexW2964571806MaRDI QIDQ5129204
Xin Liu, J. G. Dai, Lei Ying, Anton Braverman
Publication date: 26 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07219
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items
Double-ended queues with non-Poisson inputs and their effective algorithms, A Probabilistic Approach to Growth Networks, Spatial Capacity Planning, Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles, Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework, A new <scp>ride‐sharing</scp> model incorporating the passengers' efforts, Applications of fluid models in service operations management, Optimizing large on-demand transportation systems through stochastic conic programming, Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice, On the Optimal Design of a Bipartite Matching Queueing System
Cites Work
- Fleet-sizing and service availability for a vehicle rental system via closed queueing networks
- Bike sharing systems: solving the static rebalancing problem
- Price-Directed Control of a Closed Logistics Queueing Network
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Asymptotic analysis of queueingnetworks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Applied Probability and Queues
- Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
