A convergence analysis of generalized hill climbing algorithms

DOI10.1109/9.940936MaRDI QIDQ4540465zbMATH OpenOpenAlexFDO

Authors Kelly A. Sullivan, Sheldon H. Jacobson

Publication date 21 July 2002

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10919/27027

zbMATH Keywords

convergencediscrete optimizationmetaheuristicsperformance of local search algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On the convergence of generalized hill climbing algorithms
• A class of convergent generalized hill climbing algorithms
• Global optimization performance measures for generalized hill climbing algorithms
• Analyzing the performance of local search algorithms using generalized hill climbing algorithms
• Finite-time performance analysis of static simulated annealing algorithms

Cited in

(10)

• On the convergence of generalized hill climbing algorithms
• Analysis of static simulated annealing algorithms
• A class of convergent generalized hill climbing algorithms
• Global optimization performance measures for generalized hill climbing algorithms
• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
• Analyzing the performance of simultaneous generalized hill climbing algorithms
• Analyzing the performance of local search algorithms using generalized hill climbing algorithms
• Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
• Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
• Finite-time performance analysis of static simulated annealing algorithms

This page was built for publication: A convergence analysis of generalized hill climbing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540465)