 assume that the current solution S with cost f(S) at a given local search iteration has p neighboring solutions, each of them associated with a move indexed by j = 0,..., p. Each neighbor is obtained by applying one of the p moves to the current solution S. 