Hashing vectors for tabu search

Tabu search as proposed by Glover has proven to be a very effective meta-heuristic for hard problems. In this paper the authors propose that hash functions be used to record the solutions encountered during recent iterations of the search in a long list. Hash values of potential solutions can be compared to the values on the list for the purpose of avoiding cycling. This frees the algorithm designer of the need to consider cycling when creating tabu restrictions based on move attributes. The authors suggest specific functions that result in very good performance.