A Convergence Analysis of Generalized Hill Climbing Algorithms

A Convergence Analysis of Generalized Hill Climbing Algorithms

Generalized hill climbing (GHC) algorithms provide a unifying framework for describing several discrete optimization problem local search heuristics, including simulated annealing and tabu search. A necessary and a sufficient convergence condition for GHC algorithms are presented. The convergence c...

Full description

Bibliographic Details
Main Author: Sullivan, Kelly Ann
Other Authors: Industrial and Systems Engineering
Format: Others
Published: Virginia Tech 2014
Subjects:
heuristics
discrete optimization
local search
simulated annealing
convergence
combinatorial optimization
hill climbing algorithms
Markov chain
Online Access:http://hdl.handle.net/10919/27027
http://scholar.lib.vt.edu/theses/available/etd-041999-213806/

Internet

http://hdl.handle.net/10919/27027
http://scholar.lib.vt.edu/theses/available/etd-041999-213806/

Similar Items