Experiments concerning hashing in the multiobjective tabu search method TAMOCO

This paper examines the use of hashing in the multiobjective tabu search, TAMOCO. The hashing method was suggested by Woodruff and Zemel as a method of avoiding return to the already examined solutions in the standard single-objective tabu search. While the traditional tabu list is capable of ensuring this, it can normally only be used for cycles of a moderate length. The hashing method, however, can efficiently avoid cycles over a much larger number of iterations and must be considered a natural component in the tabu search tool-box. The paper reports from two experiments of practical models.