1. Introduction -- 2. Computational complexity -- 3. Local improvement on discrete structures -- 4. Simulated annealing -- 5. Tabu search -- 6. Genetic algorith

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting

The ubiquity of combinatorial optimization problems in our society is illustrated by the novel application areas for optimization technology, which range from s

Local search has been applied successfully to a diverse collection of optimization problems. However, results are scattered throughout the literature. This is t

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best paper