Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems

Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems

Generalized hill climbing (GHC) algorithms provide a framework for using local search algorithms to address intractable discrete optimization problems. Many well-known local search algorithms can be formulated as GHC algorithms, including simulated annealing, threshold accepting, Monte Carlo search...

Full description

Bibliographic Details
Main Author: Vaughan, Diane Elizabeth
Other Authors: Industrial and Systems Engineering
Format: Others
Published: Virginia Tech 2014
Subjects:
Traveling Salesman Problem
Ergodicity
Local Search
Markov Chains
Simulated Annealing
Generalized Hill Climbing Algorithms
Manufacturing Applications
Online Access:http://hdl.handle.net/10919/28514
http://scholar.lib.vt.edu/theses/available/etd-08042000-14590003/

Internet

http://hdl.handle.net/10919/28514
http://scholar.lib.vt.edu/theses/available/etd-08042000-14590003/

Similar Items