Approximation Models for Shared Mobility Rebalancing Under Structured Spatial Imbalance
Wenbo Fan, Zhouyun Chen, Weihua Gu

TL;DR
This paper develops approximation models to estimate the minimum rebalancing distance in shared mobility systems, validated through simulations and real-world data, aiding operators in optimizing vehicle repositioning.
Contribution
The authors introduce closed-form approximation models for rebalancing distances under structured spatial imbalance, applicable to real-world city networks and demand patterns.
Findings
Models accurately predict rebalancing distances within 2% of exact solutions.
The rebalancing distance scales with the square root of service area and demand imbalance.
Empirical validation confirms model applicability to NYC ride-hailing data.
Abstract
Shared mobility systems (e.g., shared cars and ride-hailing services) generate persistent spatial imbalances as vehicles concentrate at popular destinations, leaving trip origins depleted of supply. Operators incur substantial costs in repositioning empty vehicles, and quantifying the theoretical minimum rebalancing distance is practically important. Exact computation requires solving a transportation linear program that is challenging at the city scale. Closed-form approximation models are derived for the minimum rebalancing distance in rectangular service regions. Parallel derivations are presented for the Manhattan metric (grid road networks) and the Euclidean metric (unconstrained movement). A scalar spatial imbalance index condenses the full demand pattern into a single interpretable quantity. Both models share a unified structure: the per-vehicle rebalancing distance scales with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
