Comments on: Tabu search tutorial. A Graph Drawing Application 3
-
Manuel Lozano [1]
-
[1] Universidad de Granada
Universidad de Granada
Granada, España
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 29, Nº. 2, 2021, págs. 357-362
- Idioma: inglés
- DOI: 10.1007/s11750-021-00608-y
- Enlaces
-
Resumen
Tabu search (TS) is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of TS is its use of adaptive memory, which creates a highly flexible search behavior. Memory-based strategies which are the hallmark of TS approaches are founded on a quest for “integrating principles,” by which alternative forms of memory are appropriately combined with effective strategies for exploiting them. The adaptive memory feature of TS allows the implementation of procedures that are capable of searching the solution space economically and effectively. Since local choices are guided by information collected during the search, TS contrasts with memoryless designs that heavily rely on semi-random processes that implement a form of sampling.
