Branch-and-Price-and-Cut for the Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load

Abstract

Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load (HFMDSBRP-SD) is an extension of the Static Bike Rebalancing Problem, considering heterogeneous fleet multiple depots, allowing split load. It consists of finding a set of least-cost repositioning vehicle routes and determining each station’s pickup or delivery quantity to satisfy the demand of each station. We develop a branch-and-price-and-cut (BPC) where a tabu search column generator and a heuristic label-setting algorithm are introduced to accelerate the column generation procedure, the subset-row (SR) inequalities, the strong minimum number of vehicles (SMV) inequalities, and the enhanced elementary inequalities are extended fitting this problem and applied to speed up the global convergence rate. Computational results demonstrate the effectiveness of the BPC algorithm. Among 360 instances with a maximum size of 30, there are 298 instances capable of achieving optimality within two hour time limitation.