1 Department of Economics and Business Economics, Aarhus BSS, Aarhus University2 The University of Hong Kong3 Department of Economics and Business Economics, Aarhus BSS, Aarhus University
In this paper, we study the static bike repositioning problem where the problem consists of selecting a subset of stations to visit, sequencing them, and determining the pick-up/drop-off quantities (associated with each of the visited stations) under the various operational constraints. The objective is to minimize the total penalties incurred at all the stations. We present an iterated tabu search heuristic to solve the described problem. Experimental results show that this simple heuristic can generate high quality solutions using small computing times.
Transportation Research. Part E: Logistics and Transportation Review, 2014, Vol 69, p. 180-198