The local search of the proposed GRASP heuristic uses the best improvement strategy (i.e., the best solution in N ( S, A ) is selected) and terminates when the objective function value cannot be improved further (all solutions in N ( S, A ) are worse than the current solution). The local search procedure of the proposed GRASP heuristic is given in Algorithm 3.2 .