zbMATH — the first resource for mathematics

The tabu search metaheuristic: How we used it. (English) Zbl 0878.68053
Summary: A general description of tabu search is given and various applications to optimization problems are presented. Some guidelines for applying the tabu metaheuristic are exhibited.

68P10 Searching and sorting
68N99 Theory of software
Full Text: DOI
[1] E. Amaldi, Probl?mes d’apprentissage dans les r?seaux de neurones, Diploma Project, Swiss Federal Institute of Technology in Lausanne, Switzerland (December 1987).
[2] Ch. Benke, Die Tabu-Search Methode als m?glicher L?sungsansatz f?r das Stundenplanproblem, Institut f?r H?here Studien, Vienna, Austria (August 1988).
[3] J. Bovet, C. Constantin, and D. de Werra, A convoy scheduling problem, to appear in Discr. Appl. Math. · Zbl 0734.90038
[4] R.M. Brady, Optimization strategies gleaned from biological evolution, Nature 317 (1985) 804-806.
[5] C. Friden, A. Hertz and D. de Werra, STABULUS: a technique for finding stable sets in large graphs with tabu search, Computing 42 (1989) 35-44. · Zbl 0685.68056
[6] F. Glover and C. McMillan, The general employee scheduling problem: an integration of management science and artificial intelligence, Computers and Oper. Res. 13 (1986) 563-593.
[7] F. Glover, Tabu search methods in artificial intelligence and operations research, ORSA Artificial Intelligence Newsletter 1 (1987).
[8] F. Glover, Tabu Search, Part I, ORSA J. Computing 1 (1989) 190-206.
[9] F. Glover, Future paths for integer programming and links to artificial intelligence, Computers and Oper. Res. 13 (1986) 533-549. · Zbl 0615.90083
[10] M. Gronalt, Die Verwendung der Tabu-Methode zur L?sung eines ?Loading Problems?, Projectreport, Institut f?r H?here Studien, Vienna, Austria (June 1988).
[11] P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, RUTCOR Report 43-87, Rutgers University (November 1987). · Zbl 0716.68077
[12] P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming, paper presented at theCongress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986).
[13] A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Computing 29 (1987) 345-351. · Zbl 0626.68051
[14] A. Hertz, Three new adaptations of tabu search techniques, paper presented atEURO IX-TIMS XXVIII, Paris (1988).
[15] A. Hertz, Tabu search for large scale timetabling problems, submitted for publication. · Zbl 0729.90660
[16] J.J. Hopfield, Neural networks and physical systems with emergent collective computational abilities, Proc. Natl. Acad. Sci. USA 79 (1982) 2554-2558. · Zbl 1369.92007
[17] J. Knox, An application of tabu search to the symmetric Traveling Salesman Problem, Ph. D. Thesis (in progress), University of Colorado, Boulder, CO (1988).
[18] W.A. Little, Math. Biosci. 19 (1974) 101. · Zbl 0272.92011
[19] N. Metropolis, A. Rosenbluth, M. Rosenbluth and A. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21 (1953) 1087-1092.
[20] Ch. Wendelin, Graph partitioning with the aid of the tabu method (a new approach for solving grouping problems in FMS), Projectreport, Institut f?r H?here Studien, Vienna, Austria (June 1988).
[21] M. Widmer and A. Hertz, A new approach for solving the Flow Shop sequencing problem, Europ. J. Oper. Res. 41 (1989) 186-193. · Zbl 0671.90040
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.