抄録
To find the shortest tour of a transporting vehicle in a bike sharing system (BSS), a bike sharing system routing problem (BSSRP) has been proposed. In the BSSRP, a single vehicle restores the number of bicycles in stations. However, in a real system, the restoration of the number of the bicycles in each station is carried out by multiple vehicles. To decide the shortest tour of the multiple vehicles, we proposed a mathematical optimization model called the multiple-vehicles bike sharing system routing problem (mBSSRP). We present a construction method and local search methods to solve the large-size mBSSRP. The result of numerical experiments shows that the proposed method can find good solutions in a short time.
