Tabu Search
Adaptive memory search for multidemand multidimensional knapsack problems
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
INFORMS Journal on Computing
High-Performance Local Search for Task Scheduling with Human Resource Allocation
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
| Hi-index | 0.00 |
Metaheuristic (and other) methods are often implemented using standardized parameter values. This is most often seen when comparing a favorite method with competing methods, but also when inexperienced researchers implement a method for the first time. Often the (hidden) correlations between the search method components and parameters are neglected or ignored, using only standardized templates. This paper looks at some of these pitfalls or hidden correlations, using the mechanisms of tabu search (TS) as examples. The points discussed are illustrated by examples from the authors experience.