Addressing the Bike Repositioning Problem in Bike Sharing System: A Two-Stage Stochastic Programming Model

Algorithm 1

SA_BRPSD.

	Obtain the initial solution S0.
	Set the parameter for the simulated annealing, T0, TE, α, Iiter, Maxiter
	Set S^best ⟵ S0; S^current ⟵ S0; T ⟵ T0.
	While T ≥ TEdo
	m ⟵ 0; n ⟵ 0;
	While m ≤ Iiter ＆ n ≤ Maxiterdo
	S ⟵ Local search (S^current, N^k);
	S^new ⟵ Second-Stage-Opt (S);
	Δ ⟵ F(S^new) − F(S^current);
	If Δ ≤ 0 then
	S^current ⟵ S^new, n ⟵ n + 1;
	If F(S^current) ≤ F(S^best) then
	S^best ⟵ S^current;
	end
	else
	Ifthen
	S^current ⟵ S^new, n ⟵ n + 1;
	end
	end
	m ⟵ m + 1;
	end
	T ⟵ α ⃞ T;
	end
	Return: S^best