Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

The key idea underlying iterated local search is to focus the search not on the full space of
all candidate solutions but on the solutions that are returned by some underlying algorithm …

The importance of high performance algorithms for tackling difficult optimization problems
cannot be understated, and in many cases the only available methods are metaheuristics …

We discuss several issues that arise in the implementation of Martin, Otto, and Felten's
Chained Lin-Kernighan heuristic for large-scale traveling salesman problems …

In this and the following chapter, we consider what approaches one should take when one is
confronted with a real-world application of the TSP. What algorithms should be used under …

Iterated local search (ILS) is a simple and powerful stochastic local search method. This
article presents and analyzes the application of ILS to the quadratic assignment problem …

In this chapter, we give an overview of the main concepts underlying the stochastic local
search (SLS) framework and outline some of the most relevant SLS techniques. We also …

Stochastic local search methods are at the core of many effective heuristics for tackling
different permutation flowshop problems (PFSPs). Usually, such algorithms require a careful …

In this article we investigate the application of iterated local search (ILS) to the single
machine total weighted tardiness problem. Our research is inspired by the recently proposed …

Iterated Local Search — Variable Neighborhood Search Page 1 Iterated Local Search —
Variable Neighborhood Search Thomas Stutzle stuetzle@informatik.tu-darmstadt.de http://www.intellektik.informatik.tu-darmstadt.de/tom …