Scribd
Upload
35 views3 pages

Hill Climbing Algorithm

The document discusses the hill climbing algorithm, which is a local search algorithm that continuously moves in the direction of increasing value to find the optimal solution. It describes the key features of hill climbing including that it is a greedy approach with no backtracking. It also discusses different types of hill climbing algorithms and common problems encountered like local maxima.

Uploaded by

Khushi Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views3 pages

Hill Climbing Algorithm

The document discusses the hill climbing algorithm, which is a local search algorithm that continuously moves in the direction of increasing value to find the optimal solution. It describes the key features of hill climbing including that it is a greedy approach with no backtracking. It also discusses different types of hill climbing algorithms and common problems encountered like local maxima.

Uploaded by

Khushi Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Hill Climbing Algorithm

• Hill climbing algorithm is a local search algorithm which continuously moves in the
direction of increasing elevation/value to find the peak of the mountain or best
solution to the problem. It terminates when it reaches a peak value where no
neighbor has a higher value.
• Hill climbing algorithm is a technique which is used for optimizing the
mathematical problems. One of the widely discussed examples of Hill climbing
algorithm is Traveling-salesman Problem in which we need to minimize the
distance traveled by the salesman.
• It is also called greedy local search as it only looks to its good immediate neighbor
state and not beyond that.
• A node of hill climbing algorithm has two components which are state and value.

Features of Hill Climbing:


• Generate and Test variant: Hill Climbing is the variant of Generate and Test
method. The Generate and Test method produce feedback which helps to decide
which direction to move in the search space.
• Greedy approach: Hill-climbing algorithm search moves in the direction which
optimizes the cost.
• No backtracking: It does not backtrack the search space, as it does not remember
the previous states.

State-space Diagram for Hill Climbing:


Local Maximum: Local maximum is a state which is better than its neighbor states.
Global Maximum: Global maximum is the best possible state. It has the highest value of
objective function.
Current state: It is a state where an agent is currently present.
Flat local maximum: It is a flat space where all the neighbor states of current states have
the same value.
Shoulder: It is a plateau region which has an uphill edge.

Types of Hill Climbing Algorithm:


• Simple hill Climbing
• Steepest-Ascent hill-climbing
• Stochastic hill Climbing

1. Simple Hill Climbing:


It only evaluates the neighbor node state at a time and selects the first one which
optimizes current cost and set it as a current state.
2. Steepest-Ascent hill climbing:
This algorithm examines all the neighboring nodes of the current state and selects one
neighbor node which is closest to the goal state.
3. Stochastic hill climbing:
This search algorithm selects one neighbor node at random and decides whether to
choose it as a current state or examine another state.

Problems in Hill Climbing Algorithm:


1. Local Maximum
2. Plateau
3. Ridges
Simulated Annealing

A hill-climbing algorithm which never makes a move towards a lower value guaranteed to
be incomplete because it can get stuck on a local maximum. And if algorithm applies a
random walk, by moving a successor, then it may complete but not efficient.
Simulated Annealing is an algorithm which yields both efficiency and completeness.
In mechanical term Annealing is a process of hardening a metal or glass to a high
temperature then cooling gradually, so this allows the metal to reach a low-energy
crystalline state. The same process is used in simulated annealing in which the algorithm
picks a random move, instead of picking the best move. If the random move improves the
state, then it follows the same path. Otherwise, the algorithm follows the path which has a
probability of less than 1 or it moves downhill and chooses another path.

You might also like