A convergence analysis of generalized hill climbing algorithms

IEEE Transactions on Automatic Control

Volumn 46, Issue 8, 2001, Pages 1288-1293

  Sullivan, Kelly A ^a   Jacobson, Sheldon H ^b  

^a WHQKB   (United States)

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

Author keywords

Convergence; Discrete optimization; Hill climbing algorithms; Local search; Markov chain; Metaheuristics; Simulated annealing

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES; OPTIMIZATION; SIMULATED ANNEALING;

GENERALIZED HILL CLIMBING (GHC) ALGORITHMS;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0035418539     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.940936     Document Type: Article

References (16)

1. Computational analysis of a flexible assembly system design problem
2. Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms
3. Cooling schedules for optimal annealing
4. The theory and practice of simulated annealing
5. Simulated annealing type Markov chains and their order balance equations
6. Simulated annealing methods with general acceptance probabilities
7. On the convergence of generalized hill climbing algorithms
8. On the classification of NP-complete problems in temrs of their correlation coefficients
9. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing