On the convergence of generalized hill climbing algorithms

Discrete Applied Mathematics

Volumn 119, Issue 1-2, 2002, Pages 37-57

  Johnson, A W ^a   Jacobson, S H ^b  

^a UNITED STATES MILITARY ACADEMY   (United States)

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

Author keywords

Convergence; Discrete optimization; Hill climbing algorithms; Local search; Simulated annealing; Threshold accepting

Indexed keywords

LEARNING ALGORITHMS; MARKOV PROCESSES; SIMULATED ANNEALING; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

CONVERGENCE; DISCRETE OPTIMIZATION; HILL CLIMBING ALGORITHMS; LOCAL SEARCH; THRESHOLD ACCEPTING;

LOCAL SEARCH (OPTIMIZATION);

EID: 84867959651     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00264-5     Document Type: Article

References (17)

1. E.H.L. Aarts, J.H.M. Korst, and P.J.M. van Laarhoven E. Aarts, J.K. Lenstra, Local Search in Combinatorial Optimization 1997 John Wiley and Sons Ltd London, England
2. I. Althofer, and K.U. Koschnick On the convergence of threshold accepting Appl. Math. Optim. 24 1991 183 195
3. S. Anily, and A. Federgruen Simulated annealing methods with general acceptance probabilities J. Appl. Probab. 24 1987 657 667 (Pubitemid 18535921)
4. I. Charon, and O. Hudry The noising method: a new method for combinatorial optimization Oper. Res. Lett. 14 1993 133 137
5. E. Cinlar Introduction to stochastic processes 1975 Prentice-Hall, Inc Englewood Cliffs, New Jersey
6. G. Dueck, and T. Scheuer Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing J. Comput. Phys. 90 1990 161 175
7. R.W. Eglese Simulated annealing: a tool for operational research European J. Oper. Res. 46 1990 271 281 (Pubitemid 20720808)
8. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York, NY
9. B. Hajek Cooling schedules for optimal annealing Math. Oper. Res. 13 2 1988 311 329
10. S.H. Jacobson, K.A. Sullivan, and A.W. Johnson Generalized hill climbing algorithms for discrete manufacturing process design problems using computer simulation models Eng. Optim. 31 1998 247 260
11. S.H. Jacobson, E. Yücesan, On the effectiveness of generalized hill climbing algorithms, Technical Report, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, IL, 2000.
12. A.W. Johnson, Generalized hill climbing algorithms for discrete optimization problems, Doctoral Dissertation, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg VA, 1996.
13. A.W. Johnson, S.H. Jacobson, A class of convergent generalized hill climbing algorithms, Appl. Math. Comput. 2000, to appear.
14. P.J.M. van Laarhoven, and E.H.L. Aarts Simulated Annealing: Theory and Applications 1987 D. Reidel Publishing Company Dordrecht, Holland
15. M.H. Protter, and C.B. Morrey A first course in real analysis 2nd Edition 1991 Springer Verlag New York, NY
16. A. Sangiovanni-Vincentelli Editor's foreward Algorithmica 6 3 1991 295 301
17. C.A. Tovey E. Aarts, J.K. Lenstra, Local search in combinatorial optimization 1997 Wiley London, England