DocumentCode
1519532
Title
A convergence analysis of generalized hill climbing algorithms
Author
Sullivan, Kelly A. ; Jacobson, Sheldon H.
Author_Institution
United Airlines, Township, IL, USA
Volume
46
Issue
8
fYear
2001
fDate
8/1/2001 12:00:00 AM
Firstpage
1288
Lastpage
1293
Abstract
Generalized hill climbing (GHC) algorithms provide a well-defined framework for describing the performance of local search algorithms for discrete optimization problems. Necessary and sufficient convergence conditions for GHC algorithms are presented. These convergence conditions are derived using a new iteration classification scheme for GHC algorithms. The implications of the necessary and the sufficient convergence conditions fur GHC algorithms with respect to existing convergence theory for simulated annealing are also discussed
Keywords
convergence; iterative methods; optimisation; search problems; convergence analysis; discrete optimization problems; generalized hill climbing algorithms; iteration classification scheme; local search algorithms; necessary and sufficient convergence conditions; simulated annealing; Algorithm design and analysis; Convergence; Industrial engineering; Jacobian matrices; Random variables; Simulated annealing; Sufficient conditions;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.940936
Filename
940936
Link To Document