Title page for ETD etd-041999-213806

Type of Document Dissertation
Author Sullivan, Kelly Ann
Author's Email Address sullivak@vt.edu
URN etd-041999-213806
Title A Convergence Analysis of Generalized Hill Climbing Algorithms
Degree PhD
Department Industrial and Systems Engineering
Advisory Committee
Advisor Name Title
Jacobson, Sheldon H. Committee Chair
Kobza, John E. Committee Member
Nachlas, Joel A. Committee Member
Sherali, Hanif D. Committee Member
Ye, Keying Committee Member
  • heuristics
  • discrete optimization
  • local search
  • simulated annealing
  • convergence
  • combinatorial optimization
  • hill climbing algorithms
  • Markov chain
Date of Defense 1999-04-12
Availability unrestricted
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 conditions presented in this dissertation are based upon a new iteration classification scheme for GHC algorithms. The convergence theory for particular formulations of GHC algorithms is presented and the implications discussed. Examples are provided to illustrate the relationship between the new convergence conditions and previously existing convergence conditions in the literature. The contributions of the necessary and the sufficient convergence conditions for GHC algorithms are discussed and future research endeavors are suggested.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  etd.pdf 730.12 Kb 00:03:22 00:01:44 00:01:31 00:00:45 00:00:03

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.