Tabu search -- a guided tour (Q2731675)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1626340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search -- a guided tour |
scientific article; zbMATH DE number 1626340 |
Statements
12 March 2002
0 references
tabu search
0 references
metaheuristics
0 references
traveling salesman
0 references
0 references
0 references
Tabu search -- a guided tour (English)
0 references
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.
0 references
