Addressing the Bike Repositioning Problem in Bike Sharing System: A Two-Stage Stochastic Programming Model

Abstract EN

In this paper, a bike repositioning problem with stochastic demand is studied.

The problem is formulated as a two-stage stochastic programming model to optimize the routing and loading/unloading decisions of the repositioning truck at each station and depot under stochastic demands.

The goal of the model is to minimize the expected total sum of the transportation costs, the expected penalty costs at all stations, and the holding cost of the depot.

A simulated annealing algorithm is developed to solve the model.

Numerical experiments are conducted on a set of instances from 20 to 90 stations to demonstrate the effectiveness of the solution algorithm and the accuracy of the proposed two-stage stochastic model.