Please enable JavaScript.
Coggle requires JavaScript to display documents.
Local Search Algorithm - Coggle Diagram
Local Search Algorithm
Examples
The vertex cover problem
The travelling salesman problem
The boolean satisfiability problem
The nurse scheduling problem
The k-medoid clustering problem
Attributes of local search algorithm
Operates using single current node
The path followed by the search are not retained
Hill Climbing
Moves in the direction of increasing value
Terminates at peak where no neighbor has a higher value
Tabu search
Stochastic Hill Climbing
Choose next move randomly among uphill moves
Probability of selection may vary with the
steepness of uphill move
Steepest-ascent Hill Climbing
Evaluate initial state, if it isn't the goal state then quit, else make the current state this initial state and proceed. If no better state, terminate.
variation of simple hill climbing
Consider all moves and selects the best as the next state
Simulated annealing