The Reactive Tabu Search

@article{Battiti1994TheRT,
  title={The Reactive Tabu Search},
  author={Roberto Battiti and Giampietro Tecchiolli},
  journal={INFORMS J. Comput.},
  year={1994},
  volume={6},
  pages={126-140}
}
We propose an algorithm for combinatorial optimization where an explicit check for the repetition of configurations is added to the basic scheme of Tabu search. In our Tabu scheme the appropriate size of the list is learned in an automated way by reacting to the occurrence of cycles. In addition, if the search appears to be repeating an excessive number of solutions excessively often, then the search is diversified by making a number of random moves proportional to a moving average of the cycle… 
An implementation of the iterated tabu search algorithm for the quadratic assignment problem
TLDR
An implementation of the iterated tabu search (ITS) algorithm for the quadratic assignment problem (QAP), which is one of the well-known problems in combinatorial optimization, and shows promising efficiency, especially for the random QAP instances.
An Empirical Study of State Encoding in Tabu Search
Recently, the Tabu Search (TS) metaheuristic has been applied to a number of combinatorial optimisation problems with success [1, 14, 15, 18, 19]. TS is an enhancement of the well known hill climbing
Reactive Search, a history-based heuristic for MAX-SAT
TLDR
A new RS algorithm is proposed for the approximated solution of the Maximum Satissability problem: a component based on local search with temporary prohibitions is complemented with a reactive scheme that determines the appropriate value of the prohibition parameter by monitoring the Hamming distance along the search trajectory.
Reactive search, a history-sensitive heuristic for MAX-SAT
TLDR
A new RS algorithm is proposed for the approximated solution of the Maximum Satisfiability problem: a component based on local search with temporary prohibitions (Tabu Search) is complemented with a reactive scheme that determines the appropriate value of the prohibition parameter by monitoring the Hamming distance along the search trajectory.
Reactive Local Search for the Maximum Clique Problem1
TLDR
Reactive Local Search is based on local search complemented by a feedback (history-sensitive) scheme to determine the amount of diversification, in a manner inspired by Tabu Search, for the solution of the Maximum-Clique problem.
Reactive and dynamic local search for Max-Clique , an experimental comparison
TLDR
Results of an ongoing investigation about how different algorithmic building blocks contribute to solving the Maximum Clique problem are presented, showing the crucial effects of the implementation, the robustness of different techniques, and their empirical scalability.
Hyper-Reactive Tabu Search for MaxSAT
TLDR
This paper proposes a hyper-parameterized tabu search approach that dynamically adjusts key parameters of the search using a learned strategy, and shows that this approach can lead to state-of-the-art performance without any expert user involvement.
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
TLDR
New heuristic algorithms are proposed for the Graph Partitioning problem and detailed experimental results are presented on benchmark suites used in the previous literature, consisting of graphs derived from parametric models and of "real-world" graphs of large size.
Partially persistent dynamic sets for history-sensitive heuristics
  • R. Battiti
  • Computer Science
    Data Structures, Near Neighbor Searches, and Methodology
  • 1999
TLDR
This paper analyzes the use of persistent dynamic sets for storing and retrieving states and discusses the advantages of this option with respect to popular but less eecient realizations.
Training neural nets with the reactive tabu search
TLDR
The task of training subsymbolic systems is considered as a combinatorial optimization problem and solved with the heuristic scheme of the reactive tabu search (RTS), which is applicable to nondifferentiable functions, is robust with respect to the random initialization, and effective in continuing the search after local minima.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
Tabu Search Applied to the Quadratic Assignment Problem
TLDR
This paper describes an adaptation of Tabu Search, a recent technique to overcome local optimality, to the Quadratic Assignment Problem (QAP), and suggests that good tabu list sizes increase with dimension of the problem.
Tabu Search - Part II
TLDR
The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Tabu Search - Part I
TLDR
The fundamental principles underlying tabu search as a strategy for combinatorial optimization problems are presented and more advanced considerations are examined, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness.
Hashing vectors for tabu search
TLDR
This paper proposes that hash functions be used to record the solutions encountered during recent iterations of the search in a long list to free the algorithm designer of the need to consider cycling when creating tabu restrictions based on move attributes.
Dynamic tabu list management using the reverse elimination method
TLDR
A dynamic strategy, the reverse elimination method, for tabu list management, is described and directions on improving its computational effort are given.
Genetic algorithms and tabu search: Hybrids for optimization
Handbook Of Genetic Algorithms
TLDR
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems, and introduces the fundamental genetic algorithm (GA), and shows how the basic technique may be applied to a very simple numerical optimisation problem.
Technical Note - On the Cancellation Sequence Method of Tabu Search
This note deals with the Cancellation Sequence Method given in a recent paper on Tabu Search by F. Glover. Slight modifications and corrections are proposed and verified by the use of some examples.
...
...