A Bilevel Programming Model and Algorithm for the Static Bike Repositioning Problem

Table 2

Summary of inexact solution methods for the static BRP in the literature.

References	Solution methods
Benchimol et al. [3]	9.5-approximation algorithm
Dell’Amico et al. [13]	Destroy and repair algorithm
Cruz et al. [4]	ILS
Lin and Chou [5]	Classical heuristics
Di Gaspero et al. [6]	Constraint programming with ACO
Di Gaspero et al. [7, 11]	Constraint programming with LNS
Raidl et al. [8]	VNS
Rainer-Harbach et al. [9]	VNS with VND
Rainer-Harbach et al. [10]	GRASP with VNS
Angeloudis et al. [12]	Multistage heuristic
Forma et al. [15]	3-step math heuristic
Alvarez-Valdes et al. [16]	Heuristic based on minimum cost flow
Ho and Szeto [17]	Hybrid LNS
Schuijbroek et al. [18]	Cluster-first route-second heuristic
Pal and Zhang [19]	Nested LNS with VND
Bulhões et al. [20]	Branch-and-cut with ILS
Szeto and Shui [21]	Enhanced ABC
Liu et al. [22]	Enhanced CRO
Chemla et al. [23]	Branch-and-cut method with TS
Ho and Szeto [26]	Iterated TS
Li et al. [29]	Combined hybrid GA
Szeto et al. [30]	Enhanced CRO
This paper	ILS and TS