A Multi-commodity Pickup and Delivery Open-tour m-TSP Formulation for Bike Sharing Rebalancing Problem

Bike sharing systems (BSSs) offer a mobility service whereby public bikes, located at different stations across an urban area, are available for shared use. An important point is that the distribution of rides between stations is not uniformly distributed and certain stations fill up or empty over time. These empty and full stations lead to demand for bikes and return boxes that cannot be fulfilled leading to unsatisfied and possibly even lost customers. To avoid this situation, bikes in the systems are redistributed by the provider. In this paper, a mathematical modelling is proposed to rebalance the stations employing non-identical trucks based on Travelling Salesman Problem (TSP) formulation. This modelling is categorized as static repositioning where the demands of stations in one period is considered. In the modelling, several types of bikes have been considered in BSSs and it has assumed that there are two depots and trucks start from one and return to another one. Finally, a numerical example confirms the applicability of the proposed model. The result shows that the modelling would simultaneously obtain the minimum paths, the minimum implementing truck’s costs and the minimum of loading/unloading bikes program.