Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"hill climbing algorithms"”.
-
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 …
-
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 …
-
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 …
-
Reinforcement Learning of Distributed Surveillance Plans
… is compared with the uniform policy and hill climbing algorithms by executing them on a common set of different data files, generated programmatically with various combinations of problem size, location, and orientation transitions as well as rewards of attacker and defender. The …
-
Assessing the Finite-Time Performance of Local Search Algorithms
… a priori the effectiveness of local search algorithms, which makes the process of choosing parameters to improve their performance difficult. This dissertation introduces the B-acceptable solution probability in terms of B-acceptable solutions as a finite-time performance measure for local …
-
Land Leveling Using Optimal Earthmoving Vehicle Routing
This thesis presents new solution approaches for land leveling, using optimal earthmoving vehicle routing. It addresses the Shortest Route Cut and Fill Problem (SRCFP) developed by Henderson, Vaughan, Wakefield and Jacobson [2000]. The SRCFP is a discrete optimization search problem, proven to be …