Restarting search algorithms with applications to simulated annealing

Advances in Applied Probability

Volumn 33, Issue 1, 2001, Pages 242-259

  Mendivil, F ^a   Shonkwiler, R ^b   Spruill, M C ^b  

^a ACADIA UNIVERSITY   (Canada)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Coding schedule; Minimization; Random search; Stochastic process renewal

Indexed keywords

PROBABILITY; RANDOM PROCESSES; SIMULATED ANNEALING; THEOREM PROVING;

COOLING SCHEDULE; RESTARTING SEARCH ALGORITHMS;

ALGORITHMS;

EID: 0035272720     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/999187906     Document Type: Article

References (23)

1. AARTS, E. AND KORST, J. (1989). Simulated Annealing and the Boltzmann Machines. John Wiley, Chichester.
2. ANDRESEN, B. (1996). Finite-time thermodynamics and simulated annealing. In Entropy and Entropy Generation, ed. J. S. Shinov. Kluwer, Dordrecht, pp. 111-127.
3. ANDRESEN, B. AND GORDON, J. M. (1994). Constant thermodynamic speed for minimizing entropy production in thermodynamic processes and simulated annealing. Phys. Rev. E 50, 4346-4351.
4. ATKINSON, A. C. (1992). A segmented algorithm for simulated annealing. Statist. Comput. 2, 221-230.
5. d. J. Appl. Prob. 29, 885-895.
6. BIXBY, B. AND REINELT, G. (1995). TSPLIB. Available at http://softlib.rice.edu/softlib/tsplib/.
7. CHIANG, T. AND CHOW, Y., (1988). On the convergence rate of annealing processes. SIAM J. Control Optimization 26, 1455-1470.
8. FELLER, W. (1968). An Introduction to Probability Theory. John Wiley, New York.
9. Fox, B. (1995). Faster simulated annealing. SIAM J. Optimization 5, 488-505.
10. Fox, B. AND HEINE, G. (1995). Probabilistic search with overrides. Ann. Appl. Prob. 5, 1087-1094.
11. HAJEK, B. (1988). Cooling schedules for optimal annealing. Math. Operat. Res. 13, 311-329.
12. Hu, X., SHONKWILER, R. AND SPRUILL, M. (1997). Randomized restarts. Submitted.
13. KOLONKO, M. (1995). A piecewise Markovian model for simulated annealing with stochastic cooling schedules. J. Appl. Prob. 32, 649-658.
14. NAKAKUKI, Y. AND SADEH, N. (1994). Increasing the efficiency of simulated annealing search by learning to recognize (un)promising runs. In Proc. 12th Nat. Conf. Artificial Intelligence, Seattle, WA, Vol. 2, pp. 1316-1322.
15. NIEMIRO, W. (1995). Tail events of simulated annealing Markov chains. J. Appl. Prob. 32, 867-876.
16. NOURANI, Y. AND ANDRESEN, B. (1998). A comparison of simulated annealing cooling strategies. J. Phys. A 31, 8373-8385.
17. NOURANI, Y. AND ANDRESEN, B. (1999). Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents. Theoret. Comput. Sci. 215, 51-68.
18. NULTON, J. D. AND SALAMON, P. (1988). Statistical mechanics of combinatorial optimization. Phys. Rev. A 37, 1351-1356.
19. SCHOEN, F. (1991). Stochastic techniques for global optimization: a survey of recent advances. J. Global Optimization 1, 207-228.
20. SHONKWILER, R. AND VAN VLECK, E. (1994). Parallel speed-up of Monte Carlo methods for global optimization. J. Complexity 10, 64-95.
21. THEODOSOPOULOS, T. V. (1999). Some remarks on the optimal level of randomization in global optimization. In Randomization Methods in Algorithm Design (DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 43), ed. P. Pardalos. Amer. Math. Soc., Providence, RI, pp. 303-318.
22. TSITIKLIS, J. N. (1989). Markov chains with rare transitions and simulated annealing. Math. Operat. Res. 14, 70-90.
23. VAN LAARHOVEN, P. AND AARTS, E. (1987). Simulated Annealing: Theory and Applications. Reidel, Boston.