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

Algorithm 4

TS for bi-level model.

Function  TS_BL(LS_LW, Perb_LW, LS_BL)

s₀≔Initialization; Tuba=;

s≔s₀; s≔s₀; ConsIter_TS≔0;

while  ConsIter_TS<=MaxConsIter_TS  do

   N(s) ≔ LocalSearch(s, LS_BL);(N(s) consists of all feasible neighbor solutions

obtained by applying the three local search moves).

  Select a solution in the set N(s) that minimizes TS(s), and the solution is either a

non-tabu solution or a solution better than the best one so far (i.e., TC()<TC(s)),

and update the tabu.

 s≔ILS_LM(, LS_LM, Perb_LM);

  if TC(s)<TC(s),then

   s≔ s;

   ConsIter_TS≔0;

  else

   ConsIter_TS≔ ConsIter_TS+1;

  end

  end

 Return  s