Dynamic tabu list management using the reverse elimination method
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Applying tabu search with influential diversification to multiprocessor scheduling
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A survey on metaheuristics for stochastic combinatorial optimization
Natural Computing: an international journal
Solving permutational routing problems by population-based metaheuristics
Computers and Industrial Engineering
Tabu search algorithm for RP selection in PIM-SM multicast routing
Computer Communications
Model selection for least squares support vector regressions based on small-world strategy
Expert Systems with Applications: An International Journal
Tabu search algorithm for RP selection in PIM-SM multicast routing
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
| Hi-index | 0.00 |
The Tabu Search (TS) meta-heuristic has proved highly successful for solving combinatorial and nonlinear problems. A key aspect of TS consists of using adaptive forms of memory to forbid the search process to revisit solutions already examined unless the trajectory to reach it is different. In Glover (ORSA Journal on Computing, 1990, 2, 4–32) a special memory design was proposed together with a choice rule for handling the situation where the method was compelled to revisit solutions already encountered. This proposal, which specified the exploration should resume from the earliest solution visited in the past, as accompanied by the conjecture that such a choice has implications for finiteness in the zero-one integer program and optimal set membership examples. Up to now numerous applications of TS in various areas of research are available, however, we are aware of only a few results concerning the convergence of TS. In this paper, we prove that Glover's conjecture is true if the neighborhood employed is strongly connected, yielding a “reversible” path from each solution to every other solution.