Generalized hill climbing algorithms for discrete optimization problems

Generalized hill climbing algorithms for discrete optimization problems

Generalized hill climbing (GHC) algorithms are introduced, as a tool to address difficult discrete optimization problems. Particular formulations of GHC algorithms include simulated annealing (SA), local search, and threshold accepting (T A), among. others. A proof of convergence of GHC algorithms i...

Full description

Bibliographic Details
Main Author: Johnson, Alan W.
Other Authors: Industrial and Systems Engineering
Format: Others
Language:en
Published: Virginia Tech 2014
Subjects:
simulated annealing
hill climbing algorithms
discrete optimization
combinatorial optimization
convergence
heuristics
LD5655.V856 1996.J646
Online Access:http://hdl.handle.net/10919/38064
http://scholar.lib.vt.edu/theses/available/etd-06062008-152638/

Internet

http://hdl.handle.net/10919/38064
http://scholar.lib.vt.edu/theses/available/etd-06062008-152638/

Similar Items