Analyzing the performance of simultaneous generalized hill climbing algorithms

DOI10.1007/s10589-007-9019-yzbMath1161.90537OpenAlexW2016073735MaRDI QIDQ2642634

Hemanshu Kaul, Diane E. Vaughan, Jacobson, Sheldon H.

Publication date: 17 August 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9019-y

zbMATH Keywords

Markov chainsSimulated annealingErgodicityLocal searchGeneralized hill climbing algorithms

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Optimal search strategies using simultaneous generalized hill climbing algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Computable bounds for geometric convergence rates of Markov chains
• 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
• Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems
• Cooling Schedules for Optimal Annealing
• On Eigenvalues and Annealing Rates
• Markov Chains with Rare Transitions and Simulated Annealing
• Note on the Convergence of Simulated Annealing Algorithms
• The Theory and Practice of Simulated Annealing
• Convergence Rates for Markov Chains

This page was built for publication: Analyzing the performance of simultaneous generalized hill climbing algorithms