Abstract
Tabu search is a metastrategy for guiding known heuristics to overcome local optimality. Successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature. However, up to now mainly static tabu list management ideas have been applied. In this paper we describe a dynamic strategy, the reverse elimination method, and give directions on improving its computational effort. The impact of the method will be shown with respect to a multiconstraint version of the zero-one knapsack problem. Numerical results are presented comparing it with a simulated annealing approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Dammeyer, P. Forst and S. Voß, On the cancellation sequence method of tabu search, ORSA J. Comput. 3(1991)262–265.
F. Dammeyer and S. Voß, Application of tabu search strategies for solving multiconstraint zero-one knapsack problems, Working Paper, TH Darmstadt (1991).
W. Domschke, P. Forst and S. Voß, Tabu search techniques for the quadratic semi-assignment problem, in:New Directions for Operations Research in Manufacturing, ed. G. Fandel, T. Gulledge and A. Jones (Springer, Berlin, 1992) pp. 389–405.
A. Drexl, A simulated annealing approach to the multiconstraint zero-one knapsack problem, Computing 40(1988)1–8.
A. Freville and G. Plateau, Méthodes heuristiques performantes pour les problèmes en variables 0–1 à plusieurs constraintes en inégalité, Publication ANO-91, Université des Sciences et Techniques de Lille (1982).
A. Freville and G. Plateau, Hard 0–1 multiknapsack test problems for size reduction methods, Investigacion Operativa 1(1990)251–270.
A. Freville and G. Plateau, An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem,Conf. on Viewpoints on Optimization, Grimentz (1990).
B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Math. Progr. 31(1985)78–105.
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, E. Taillard and D. de Werra, A user's guide to tabu search, Working Paper, University of Colorado and EPFL Lausanne (1991), to appear.
A. Hertz and D. de Werra, The tabu search metaheuristic: how we used it, Ann. Math. Art. Int. 1(1990)111–121.
A. Hertz and D. de Werra, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11(1989)131–141.
J.P. Kelly, B.L. Golden and A. Assad, Large-scale controlled rounding using tabu search with strategic oscillation, Working Paper, University of Colorado and University of Maryland (1992), to appear.
M. Laguna, J.P. Kelly, J.L. Gonzalez-Velarde and F. Glover, Tabu search for the multilevel generalized assignment problem, Working Paper, University of Colorado (1991).
R. Loulou and E. Michaelides, New greedy-like heuristics for the multidimensional 0–1 knapsack problem, Oper. Res. 27(1979)1101–1114.
S. Senju and Y. Toyoda, An approach to linear programming with 0–1 variables, Manag. Sci. 15(1968)B196-B207.
H.M. Weingartner and D.N. Ness, Methods for the solution of the multi-dimensional 0/1 knapsack problem, Oper. Res. 15(1967)83–103.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dammeyer, F., Voß, S. Dynamic tabu list management using the reverse elimination method. Ann Oper Res 41, 29–46 (1993). https://doi.org/10.1007/BF02022561
Issue Date:
DOI: https://doi.org/10.1007/BF02022561