An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
A routing optimization problem arising in bicycle sharing systems is studied. The first exact algorithm for the problem is proposed. The underlying formulation is developed using a variable transformation from general integer to binary variables. The algorithm is a branch-and-cut algorithm that uses combinatorial Benders cuts. Instances with up to 60 stations are solved to optimality.
bicycle sharing systems branch-and-cut pickup and delivery multiple visits