Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Davis (ed.),Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991).
U. Faigle and W. Kern, Some convergence results for probabilistic tabu search, ORSA J. Comput. 4(1992)32–37.
F. Glover, Tabu search — Part I, ORSA J. Comput. 1(1989)190–206.
F. Glover, Tabu search — Part II, ORSA J. Comput. 2(1990)4–32.
F. Glover and M. Laguna, Target analysis to improve tabu search, Technical Report ORP89-21, Grad. Program in Ops. Res., University of Texas, Austin (1990).
P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44(1990)279–303.
A. Hertz and D. de Werra, The tabu search metaheuristic: How we used it, Ann. Math. Art. Int. 1(1990)111–121.
D. Knuth,The Art of Computer Programming, Vol. 3 (Addison-Wesley, Reading, MA, 1983).
M. Malek, J. Guruswamy, H. Owens and M. Pandya, Serial and parallel search simulated annealing and tabu search algorithms for the travelling salesman problem, Ann. Oper. Res. 21(1989)26–51.
J.D. Schaffer, R.A. Caruana, L.J. Eshelman and R. Das, A study of control parameters affecting online performance of genetic algorithms for function optimization, in:Proc. 3rd Int. Conf. on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann, San Mateo, CA, 1989).
J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1990)33–45.
J. Skorin-Kapov, Extensions of a tabu search adaptation to the quadratic assignment problem, Working Paper, W.A. Harriman School for Management and Policy, State University of New York, Stony Brook, NY (1991)
E. Taillard, Robust taboo search for quadratic assignment problem, Parallel Comput. 17(1991)443–455.
D.L. Woodruff, Sequencing and batching in a constant work in process production system, Doctoral Dissertation, Northwestern University, Evanston, IL (1990).
D.L. Woodruff and M.L. Spearman, Sequencing and batching for two classes of jobs with due dates and setup times, Prod. Oper. Manag. 1(1992)87–102.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Woodruff, D.L., Zemel, E. Hashing vectors for tabu search. Ann Oper Res 41, 123–137 (1993). https://doi.org/10.1007/BF02022565
Issue Date:
DOI: https://doi.org/10.1007/BF02022565