In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search ...
mathworld.wolfram.com/TabuSearch.html mathworld.wolfram.com/TabuSearch.html
Tabu search - Wikipedia, the free encyclopedia
Tabu search is a mathematical optimization method, belonging to the class of local search techniques. Tabu search enhances the performance of a local search method by using memory structures: once a ...
en.wikipedia.org/wiki/Tabu_search
The basic concept of Tabu Search as described by Glover (1986) is "a meta-heuristic superimposed on another heuristic. The overall approach is to avoid entrainment in cycles by forbidding or penalizing moves which take the solution, in the next iteration, to points in the solution space previously visited ( hence "tabu").
www.cs.sandia.gov/opt/survey/ts.html
Tabu search (TS) is an iterative procedure designed for the solution of optimization problems. ... TS has been applied to the network design problem. For a description of the technique and its application to a number of problem domains read Tabu Search, the book. A large number of references to TS can be found here.
www.sce.carleton.ca/netmanage/tony/ts.html
The roots of tabu search go back to the 1970's; it was first presented in its ... A didactic presentation of tabu search and a series of applications have ...
www.cs.colostate.edu/~whitley/CS640/hertz92tutorial.pdf
This paper presents the fundamental concepts of Tabu Search (TS) in a tutorial fashion.  Special emphasis is put on showing the relationships with classical Local Search methods and on the basic elements of any TS heuristic, namely, the definition of the search space, the neighborhood structure, and the search...
www.ifi.uio.no/infheur/Bakgrunn/Intro_to_TS_Gendreau.ht... www.ifi.uio.no/infheur/Bakgrunn/Intro_to_TS_Gendreau.htm
Tabu Search - This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI des... ... This book explores the meta-heuristics approach called tabu search,
www.springer.com/business/operations+research/book/978-... www.springer.com/business/operations+research/book/978-0-7923-9965-0
CiteSeerX - Document Details (Isaac Councill, Lee Giles): We consider the problem of designing self-healing rings in order to protect the transmission of telecommunication demands in a zonal network. This problem stems from a real application with operational constraints such as dual homing and hop limit per ring.
citeseer.ist.psu.edu/fortz00tabu.html citeseer.ist.psu.edu/fortz00tabu.html
Tabu Search for the Flexible-Routing Job Shop Problem (1996) (Make Corrections) (1 citation); John B. Chambers, J. Wesley Barnes; Home/Search Context Related; ... 11.4%: New Tabu Search Results for the Job Shop Scheduling Problem - Chambers, Barnes (1996) (Correct); Active bibliography (related documents):
citeseer.ist.psu.edu/chambers96tabu.html citeseer.ist.psu.edu/chambers96tabu.html
One of the most efficient strategies is tabu search. Tabu search allows the search to explore solutions that do not decrease the objective function value only in those cases where these solutions are not forbidden.
www.idsia.ch/~monaldo/tabusearch.html www.idsia.ch/~monaldo/tabusearch.html
Definitions