Experiments with a form of double iterated search f or use on hard combinatorial problems with many objectives
Mike B. Wright · 2006
Iterated Local Search (Lourenco et al., 2003), henceforth to be referred to as ILS, is a metaheuristic that has been used successfully to solve many combinatorial optimisation problems, producing competitive results. The technique essentially consists of two phases: a local improvement phase which leads monotonically to a local optimum and another very short phase which may take one of a number of forms, often involving a small number of moves chosen partly or wholly at random. The technique then iterates between these phases until some stopping criterion is satisfied.