A class of convergent generalized hill climbing algorithms

DOI10.1016/S0096-3003(00)00137-5zbMath1032.90036OpenAlexW1983858667MaRDI QIDQ1855135

Alan W. Johnson, Jacobson, Sheldon H.

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(00)00137-5

zbMATH Keywords

convergencesimulated annealinglocal searchdiscrete optimization

Mathematics Subject Classification ID

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

Related Items

Analyzing the performance of simultaneous generalized hill climbing algorithms ⋮ A novel hybrid Petri net model for urban intersection and its application in signal control strategy ⋮ Visiting near-optimal solutions using local search algorithms ⋮ Adaptive search with stochastic acceptance probabilities for global optimization ⋮ A framework for analyzing sub-optimal performance of local search algorithms ⋮ Hill Climbing Algorithms and Trivium ⋮ Analysis of static simulated annealing algorithms ⋮ On the convergence of generalized hill climbing algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
• The effectiveness of finite improvement algorithms for finding global optima
• Classification of Acceptance Criteria for the Simulated Annealing Algorithm
• On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
• Computational issues for accessibility in discrete event simulation
• Equation of State Calculations by Fast Computing Machines