A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem

Algorithm 2

Variable neighborhood search (VNS).

	Input: The maximum number of iterations ;
	Output: Robust scheduling x; scheduling cost ;
(1)	The solution x of model 1 is obtained by algorithm 1;
(2)	Compute ;
(3)	;
(4)	whiledo
(5)	;
(6)	whiledo
(7)	Shaking: Randomly choose a solution from the kth neighbor ;
(8)	VND: local search
(9)	;
(10)	whiledo
(11)	find a neighbor in ;
(12)	ifthen
(13)	ifthen
(14)	;
(15)	else
(16)	;
(17)	end if
(18)	end if
(19)	end while
(20)	ifthen
(21)	;
(22)	else
(23)	;
(24)	end if
(25)	end while
(26)	;
(27)	end while