A class of convergent generalized hill climbing algorithms

Authors:
Alan W. Johnson;Sheldon H. Jacobson
Affiliations:
Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Dayton, OH;Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
Applied Mathematics and Computation
Year:
2002

Citing 9
Cited 12

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Simulated annealing: past, present, and future

WSC '95 Proceedings of the 27th conference on Winter simulation
Computational issues for accessibility in discrete event simulation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Classification of acceptance criteria for the simulated annealing algorithm

Mathematics of Operations Research
Simulation Modeling and Analysis

Simulation Modeling and Analysis
On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models

Operations Research
Generalized hill-climbing algorithms for discrete optimization problems

Generalized hill-climbing algorithms for discrete optimization problems

Finite-Time Performance Analysis of Static Simulated Annealing Algorithms

Computational Optimization and Applications
Ordinal Hill Climbing Algorithms for Discrete ManufacturingProcess Design Optimization Problems

Discrete Event Dynamic Systems
Analysis of static simulated annealing algorithms

Journal of Optimization Theory and Applications
Analyzing the Performance of Generalized Hill Climbing Algorithms

Journal of Heuristics
Global Optimization Performance Measures for Generalized Hill Climbing Algorithms

Journal of Global Optimization
Analyzing the performance of simultaneous generalized hill climbing algorithms

Computational Optimization and Applications
Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems

INFORMS Journal on Computing
An investigation into dynamic yard crane deployment and comparisons between hill-climbing and best-first-search algorithms

International Journal of Computer Applications in Technology
Adaptive parameterized improving hit-and-run for global optimization

Optimization Methods & Software - GLOBAL OPTIMIZATION
Hill climbing algorithms and Trivium

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
A framework for analyzing sub-optimal performance of local search algorithms

Computational Optimization and Applications
Adaptive search with stochastic acceptance probabilities for global optimization

Operations Research Letters

Quantified Score

Hi-index	0.48

Visualization

Abstract

Generalized hill climbing (GHC) algorithms have been presented as a modeling framework for local search strategies applied to address intractable discrete optimization (minimization) problems. GHC algorithms include simulated annealing (SA), pure local search (LS), and threshold accepting (TA), among others, as special cases. A particular class of GHC algorithms is designed for discrete optimization problems where the objective function value of a globally optimal solution is known (in this case, the task is to identify an associated optimal solution). This class of GHC algorithms is shown to converge, and six examples are provided that illustrate the diversity of GHC algorithms within this class of convergent algorithms. Implications of these results are discussed.