Chapter 4 Beyond Classical Search
16 September 2023
14:57
Greedy Local Search: Hill Climbing
The hill climbing search algorithm is the
technique. At each step, the current node
neighbor; in this version, that means the
VALUE, but if a heuristic cost estimate h
neighbor with the lowest h.
most basic local search
is replaced by the best
neighbor with the highest
is used, we would find the
It often gets stuck at local minima/maxima, ridges, and plateaux.
Allow sideways move
Stochastic Hill Climbing: chooses randomly from the uphill moves; the
probability of selection can vary with the steepness of the uphill
move.
Random restart Hill Climbing adopts the well-known adage "If at first
you don't succeed, try again." It conducts a series of hill-climbing
searches from randomly generated initial states until a goal is found.
If each hill-climbing search has a probability p of success, then the
expected number of restarts required is 1/p.
Simulated Annealing
The simulated annealing algorithm is a version of stochastic hill
climbing where some downhill moves are allowed. Downhill moves are
New Section 2 Page 1
climbing where some downhill moves are allowed. Downhill moves are
accepted readily early in the annealing schedule and less often as
time passes. The schedule input determines the temperature T value as
a time function.
A try to combine hill climbing with a random walk in some way that
yields both efficiency and completeness.
The algorithm accepts a move with some probability less than 1.
Local Beam Search:
Keeps track of k states rather than just one. Useful information is
passed among the parallel search threads. Quicky abandons unfruitful
searches and moves its resources to where the most progress is being
made.
A stochastic beam search variant, analogous to stochastic hill
climbing, helps alleviate this problem. Instead of choosing the best k
from the pool of candidate successors, it chooses k successors
randomly, with the probability of choosing a given success being an
increasing function of its value. Stochastic beam search bears some
resemblance to the process of natural selection, whereby "successors"
(off springs) of a "state" (organism) populate the next generation
according to its "value" (fitness).
- Asexual reproduction
Genetic Algorithms (GA)
A variant of stochastic beam search in which successor states are
generated by combining two parents rather than by modifying a
single state.
New Section 2 Page 2
single state.
- Sexual reproduction
- Fitness function or the objective function
A fitness function should return higher values for better states.
For each pair to be mated, a crossover point is chosen randomly
from the positions in the string.
New Section 2 Page 3