Result: Hashing vectors for tabu search

Title:
Hashing vectors for tabu search
Authors:
Eitan Zemel, David L. Woodruff
Source:
Annals of Operations Research. 41:123-137
Publisher Information:
Springer Science and Business Media LLC, 1993.
Publication Year:
1993
Subject Terms:
Combinatorial optimization, Computational methods for problems pertaining to operations research and mathematical programming, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Document Type:
Academic journal Article
File Description:
application/xml
Language:
English
ISSN:
1572-9338
0254-5330
DOI:
10.1007/bf02022565
Access URL:
https://zbmath.org/232537
https://doi.org/10.1007/bf02022565
http://doi.org/10.1007/BF02022565
https://link.springer.com/article/10.1007%2FBF02022565
https://doi.org/10.1007/BF02022565
Rights:
Springer TDM
Accession Number:
edsair.doi.dedup.....b2d86a89efe4365f2acf11cadc17c4a3
Database:
OpenAIRE

Further Information

Tabu search as proposed by Glover [3,4] has proven to be a very effective metaheuristic for hard problems. In this paper we 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. We suggest specific functions that result in very good performance.