Abstract
We integrate tabu search, simulated annealing, genetic algorithms, and random restarting. In addition, while simulating the original Markov chain (defined on a state space tailored either to stand-alone simulated annealing or to the hybrid scheme) with the original cooling schedule implicitly, we speed up both stand-alone simulated annealing and the combination by a factor going to infinity as the number of transitions generated goes to infinity. Beyond this, speedup nearly linear in the number of independent parallel processors often can be expected.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Bratley, B.L. Fox and L.E. Schrage,A Guide to Simulation, 2nd ed. (Springer, New York, 1987).
T.-S. Chiang and Y. Chow, On the convergence rate of annealing processes, SIAM J. Control Optim. 26(1988)1455–1470.
L. Devroye,Non-Uniform Random Variate Generation (Springer, New York, 1986).
U. Faigle and W Kern, Some convergence results for probabilistic tabu search, ORSA J. Comput. 4(1992)32–37.
B.L. Fox, Faster simulated annealing, Technical Report, University of Colorado, Denver (1993).
B.L. Fox, Uniting probabilistic methods for optimization,Proc. 1992 Winter Simulation Conf., pp. 500–505.
F. Glover, Future paths for integer programming and links to artificial intelligence, Dec. Sci. 8(1986)156–166.
F. Glover, Simple tabu thresholding in optimization, Technical Report, Graduate School of Business, University of Colorado, Boulder.
F. Glover, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), Discr. Appl. Math., to appear.
F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper. Res.(1993), this volume.
D.E. Goldberg,Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading, MA, 1989).
J.W. Greene and K.J. Supowit, Simulated annealing without rejected moves, IEEE Trans. Computer-Aided Design CAD-5(1986)221–228.
B. Hajek, Cooling schedules for optimal annealing, Math. Oper. Res. 13(1988)311–329.
D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, vol. 1 (McGraw-Hill, New York, 1982).
D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning, Oper. Res. 37(1989)865–892.
D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: an experimental evaluation; part 2, graph coloring and number partitioning, Oper. Res. 39(1991)378–406.
J. Keilson,Markov Chain Models — Rarity and Exponentiality (Springer, New York, 1979).
P.A.W. Lewis and G.S. Shedler, Simulation of nonhomogeneous Poisson processes by thinning, Naval Res. Log. Quarterly 26(1979)403–414.
L.J. Osborne and B.E. Gillett, A comparison of two simulated-annealing algorithms applied to the discrete Steiner problem on networks, ORSA J. Comput. 3(1991)213–225.
Author information
Authors and Affiliations
Additional information
This research was (partially) supported by the Air Force Office of Scientific Research and the Office of Naval Research Contract #F49620-90-C-0033.
Rights and permissions
About this article
Cite this article
Fox, B.L. Integrating and accelerating tabu search, simulated annealing, and genetic algorithms. Ann Oper Res 41, 47–67 (1993). https://doi.org/10.1007/BF02022562
Issue Date:
DOI: https://doi.org/10.1007/BF02022562