Spring 2018

Two-Stage Stochastic Approximation for Dynamic Rebalancing of Shared Mobility Systems

Wednesday, June 5th, 2019 2:00 pm2:30 pm

Add to Calendar


Joe Warrington (ETH Zürich)

Mobility systems featuring shared vehicles are often unable to serve all potential customers, as the distribution of demand does not coincide with the positions of vehicles at any given time. System operators often choose to reposition these shared vehicles (such as bikes, cars, or scooters) actively during the course of the day to improve service rate. They face a complex dynamic optimization problem in which many integer-valued decisions must be made, using real-time state and forecast information, and within the tight computation time constraints inherent to real-time decision-making. We first present a novel nested-flow formulation of the problem, and demonstrate that its linear relaxation is significantly tighter than one from existing literature. We then adapt a two-stage stochastic approximation scheme from the generic SPAR method of Powell et al., in which rebalancing plans are optimized against a value function representing the expected cost (in terms of fulfilled and unfulfilled customer demand) of the future evolution of the system. The true value function is approximated by a separable function of contributions due to the rebalancing actions carried out at each station and each time step of the planning horizon. The new algorithm is suited to real-time use, as it typically generates high-quality solutions in tens of iterations and can be truncated to fit within available computation time. We provide insight into this good performance by examining the mathematical properties of our new flow formulation, and demonstrate the algorithm on synthetic and real networks.