Tabu search -- a guided tour
The paper is an easy understandable introduction into tabu search. Taking the traveling salesman problem as an running example, tabu search is illustrated and a couple of design-decisions are elaborated. Besides aspiration criteria tactical improvements and extensions are scetched (selection of sub-neighbourhoods, strategic oscillations with penalty functions, reactive and self-tunning features, combinations with genetic algorithms). A rather complete list of references and application areas, where special attention is drawn to the field of global optimization of continuous functions, is added.
scientific article; zbMATH DE number 1626340