|
We consider two measures to estimate the performance of the relocation framework. The first measure is the number of shortage stations. The shortage station means the station whose parked bicycles are 0. We have to fill bicycles in that station. The second measure is the number of relocated bicycles. It is the number of bicycles to be relocated by the relocation manager. Because we assume that the driving cost is 0, if we move N bicycles from one station to another station, the number of relocated bicycles is N. In this paper, we invent an algorithm to relocate bicycles to minimize the number of shortage stations given the maximum number of relocated bicycles ¥ó. |