Iterated Local Search

Iterated Local Search (ILS) is a term in applied mathematics and computer science
defining a modification of local search or hill climbing methods for solving discrete optimization problems.

Local search methods can get stuck in a local minimum, where no improving neighbors are available.

A simple modification consists of ''iterating'' calls to the local search routine, each time starting from a different initial configuration. This is called ''repeated local search'', and implies that the knowledge obtained during the previous local search phases is not used. Learning implies that the previous history, for example the memory about the previously found local minima, is mined to produce better and better starting points for local search.

The implicit assumption is that of a ''clustered distribution of local minima'': when minimizing a function, determining good local minima is easier when starting from a local minimum with a low value than when starting from a random point. The only caveat is to avoid confinement in a given attraction basin, so that the ''kick'' to transform a local minimizer into the starting point for the next run has to be appropriately strong, but not too strong to avoid reverting to memory-less random restarts.

Iterated Local Search is based on building a sequence of locally optimal solutions by:
# perturbing the current local minimum;
# applying local search after starting from the modified solution.

The perturbation strength has to be sufficient to lead the trajectory to a different attraction basin leading to a different local optimum.

Perturbation Algorithm

The perturbation algorithm for ILS is not an easy task. The main aim is not to get stuck into the same local minimum and in order to get this property true, the undo operation is forbidden. Despite this, a good permutation has to consider a lot of values, since there exist two kind of bad permutations:
# too weak: fall back to the same local minimum
# too strong: random restart

Benchmark Perturbation

The procedure consists in fix a number of values for the perturbation such that these values are significant for the instance: on average probability and not rare. After that, on runtime it will be possible to check the benchmark plot in order to get an average idea on the instances passed.

Adaptive Perturbation

Since there is no function ''a priori'' that tells which one is the most suitable value for a given perturbation, the best criterion is to get it adaptive. For instance Battiti and Protasi proposed a reactive search algorithm for MAX-SAT which fits perfectly into the ILS framework. They perform a "directed" perturbation scheme which is implemented by a tabu search algorithm and after each perturbation they apply a standard local descent algorithm. Another way of adapting the perturbation is to change deterministically its strength during the search.

Optimizing Perturbation

Another procedure is to optimize a sub-part of the problem, having that keeps active the not-undo property. If this procedure is possible, all solutions generated after the perturbations tend to be very good. Furthermore the ''new'' parts are optimized too.

Conclusions

The method has been applied to several combinatorial optimization problems including the Job Shop Scheduling problems, Flow-Shop Problems, Vehicle Routing Problems as well as many others.

References

{{Cite web , url=http://homes.di.unimi.it/~cordone/courses/2017-ae/2017-ae.html , title=Roberto Cordone - Corsi - Algoritmi euristici (A.A. 2016/17)

Optimization algorithms and methods