REBALANCING STATIC BIKE-SHARING SYSTEMS: A TWO-PERIOD TWO-COMMODITY MULTI-DEPOT MATHEMATICAL MODEL

Abstract

In this paper, an Integer Linear Programming (ILP) has been developed for rebalancing the stations of a Periodic Bike Relocation Problem (PBRP) in multiple periods. The objective function of the mathematical model is reducing costs of implementing trucks, transportation between stations and holding bikes on trucks during rebalancing. The variables we are following them in this model are conducting the optimal route in several periods, using the most appropriate trucks for these routes, and determining the best program for loading/unloading bikes for stations. The distinguishing features of the proposed model are considering several bike types, several exclusive trucks and several time periods. Finally, a numerical example confirms the applicability of the proposed model.