On the convergence of generalized hill climbing algorithms
From MaRDI portal
Publication:1602702
DOI10.1016/S0166-218X(01)00264-5zbMath0994.90115OpenAlexW2076805032WikidataQ127571028 ScholiaQ127571028MaRDI QIDQ1602702
Alan W. Johnson, Jacobson, Sheldon H.
Publication date: 24 June 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00264-5
Related Items (13)
Analyzing the performance of simultaneous generalized hill climbing algorithms ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ A novel hybrid Petri net model for urban intersection and its application in signal control strategy ⋮ Evaluating the convergence of tabu enhanced hybrid quantum optimization ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Visiting near-optimal solutions using local search algorithms ⋮ Convergence of a modified algorithm of fast probabilistic modeling ⋮ A framework for analyzing sub-optimal performance of local search algorithms ⋮ Attraction probabilities in variable neighborhood search ⋮ Stochastic protein folding simulation in the three-dimensional HP-model ⋮ Analysis of static simulated annealing algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulated annealing: A tool for operational research
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- On the convergence of ``threshold accepting
- The noising method: A new method for combinatorial optimization
- A class of convergent generalized hill climbing algorithms
- Simulated annealing methods with general acceptance probabilities
- Cooling Schedules for Optimal Annealing
This page was built for publication: On the convergence of generalized hill climbing algorithms
