Global optimization performance measures for generalized hill climbing algorithms

Journal of Global Optimization

Volumn 29, Issue 2, 2004, Pages 173-190

  Jacobson, Sheldon H ^a   Yücesan, Enver ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b INSEAD   (France)

Author keywords

Convergence; Finite time performance; Hill climbing; Local search algorithms

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY;

CONVERGENCE; FINITE-TIME PERFORMANCE; HILL CLIMBING; LOCAL SEARCH ALGORITHMS;

GLOBAL OPTIMIZATION;

EID: 3142748715     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOGO.0000042111.72036.11     Document Type: Article

References (26)

1. Aarts, E. and Korst, J. (2002), Selected topics in simulated annealing. In: Hansen, P. and Ribeiro, C.C. (eds), Essays and Surveys on Metaheuristics, pp. 1-37. Kluwer Academic Publishers, Norwell, MA.
2. Abboud, N., Sakawa, M. and Inuiguchi, M. (1998), School scheduling using threshold accepting, Cybernetics and Systems 29(6), 593-611.
3. Berman, A. and Plemmons, R.J. (1994), Nonnegative Matrices in the Mathematical Sciences, Society for Industrial and Applied Mathematics, Philadelphia, PA.
4. Billingsley, P. (1979), Probability and Measure, John Wiley and Sons, New York.
5. Charon, I. and Hudry, O. (2001), The noising method: a generalization of some metaheuristics, European Journal of Operational Research 135(1), 86-101.
6. Cohn, H. and Fielding, M. (1999), Simulated annealing: searching for an optimal temperature schedule, SIAM Journal of Optimization 9(3), 779-802.
7. Dueck, G. and Scheuer, T. (1990), Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, European Journal of Operational Research 46, 271-281.
8. Fielding, M. (2000), Simulated annealing with an optimal fixed temperature, SIAM Journal of Optimization 11(2), 289-307.
9. Fox, B.L. (1993), Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Annals of Operations Research 41, 47-67.
10. Franz A., Hoffmann K.H. and Salamon P. (2001), Best possible strategy for finding ground states, Physical Review Letters 86(23), 5219-5222.
11. Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman and Company, San Francisco, CA.
12. Glover, F. and Laguna, M. (1997), Tabu Search, Kluwer Academic Publishing, Norwell, MA.
13. Hajek, B. (1988), Cooling schedules for optimal annealing, Mathematics of Operations Research 13, 311-329.
14. Henderson, D., Jacobson, S.H. and Johnson, A.W. (2003), The theory and practice of simulated annealing. In: Glover, F. and Kochenberger, G. (eds), Handbook on Metaheuristics, pp. 287-319. Kluwer Academic Publishers, Norwell, MA.
15. Jacobson, S.H. and Solow, D. (1993), The effectiveness of finite improvement algorithms for finding global optima, Zeitschrift fur Operations Research (ZOR) - Methods and Models of Operations Research 37(3), 257-272.
16. Johnson, A.W. and Jacobson, S.H. (2002a), On the convergence of generalized hill climbing algorithms, Discrete Applied Mathematics 119(1-2), 37-57.
17. Johnson, A.W. and Jacobson, S.H. (2002b), A class of convergent generalized hill climbing algorithms, Applied Mathematics and Computation 125(2-3), 359-373.
18. Johnson, D.S., Papadimitriou, C.H. and Yannakakis, M. (1988), How easy is local search? Journal of Computers and Systems Science 37(1), 79-100.
19. Kirkpatrick, S., Gelatt, C.D., Jr. and Vecchi, M.P. (1983), Optimizaton by simulated annealing, Science 220, 671-680.
20. Lin, S. and Kernighan, B.W. (1973), An effective heuristic for the traveling salesman problem. Operations Research 21, 498-516.
21. Marti, R. (2003), Multi-start methods. In: Glover, F. and Kochenberger, G. (eds.), Handbook on Metaheuristics, pp. 355-368. Kluwer Academic Publishers, Norwell, MA.
22. Mitra, D., Romeo, F. and Sangiovanni-Vincentelli, A.L. (1986), Convergence and finite-time behavior of simulated annealing, Advances in Applied Probability 18, 747-771.
23. Nissen, V. and Paul, H. (1995), A modification of threshold accepting and its application to the quadratic assignment problems, OR Spekrum 17(2-3), 205-210.
24. Orosz, J.E. and Jacobson, S.H. (2002a), Finite-time performance analysis of static simulated annealing algorithms, Computational Optimization and Applications 21(1), 21-53.
25. Orosz, J.E. and Jacobson, S.H. (2002b), Analysis of static simulated annealing algorithms, Journal of Optimization Theory and Application 115(1), 165-182.
26. Sullivan, K.A. and Jacobson, S.H. (2001), A convergence analysis of generalized hill climbing algorithms, IEEE Transactions on Automatic Control 46(8), 1288-1293.