In recent years, a bike-sharing system (BSS) has been introduced as a means of inner city transportation in cities of various countries. The BSS consists of one control center and many dispersed stations where rental bicycles are parked. After many people use the bicycles, the distribution of bicycles among stations changes from the managed initial distribution to a disarranged one. Hence, it is necessary to restore the disarranged distribution to the initial one at the certain time intervals to sustain the good performance of the BSS. This work is done by vehicles that transport bicycles from stations with excess bicycles to ones with a shortage. How to accomplish this task as efficiently as possible is an interesting issue. We have presented a mathematical optimization model on this issue named the BSS routing problem (BSSRP) to determine the shortest tour of the transport vehicle, and proposed heuris-tic solution methods to solve it. In this paper, we propose two new solution methods for the BSSRP. One is based on the idea of searching for solutions including the infeasible space, and the other is based on the idea of dividing the search process into two phases. The results of numerical experiments show that both newly proposed methods are superior to previous methods.