The Bikesharing allocation and rebalancing problem is the problem of determining the initial daily allocation of bikes to stations in a bikesharing system composed of one depot and multiple capacitated stations, in which bikes can be rebalanced at a point in time later in the day. We propose a two-stage stochastic programming formulation, where the allocation is made in the rst-stage and the recourse decisions related to rebalancing are made in the second-stage. The impact of the stochastic demand on the problem solution is examined, showing the bene ts of the proposed methodology with respect to the solution of the deterministic equivalent formulation. Nevertheless, we derive a deterministic solution-based heuristic for solving the stochastic program that signi cantly reduces its solution time without losing solution quality. We benchmark our approach on the real bikesharing system of the city of San Francisco.
Citation
Submitted for evaluation to OMEGA on May 22, 2018.