Solving a static repositioning problem in bike-sharing systems using iterated tabu search |
| |
| Institution: | 1. Department of Industrial and Management Systems Engineering, University of South Florida, Tampa, FL, USA;2. Department of Industrial and Systems Engineering, University at Buffalo, Buffalo, NY, USA;1. Department of Industrial and Systems Engineering, National University of Singapore, Singapore;2. Air Traffic Management Research Institute, Nanyang Technological University, Singapore;3. Manufacturing and Industrial Engineering Cluster, School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore;4. Industrial and Manufacturing Systems Engineering, University of Hong Kong, Hong Kong, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Bike-sharing Static repositioning Tabu search |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
