Ain Optimization G8
Ain Optimization G8
Ain Optimization G8
NODE
HILL CLIMBING
CONSISTENCY
SIMULATED ARC
ANNEALING CONSISTENCY
LINEAR BACKTRACKING
PROGRAMMING SEARCH
- search algorithm that maintains a single node
and searches by moving to a neighboring node.
--> is a local search algorithm commonly used for
optimization problems
Simplicity: Easy to implement and Local optima: Hill Climbing can get
doesn’t require complex data structures. stuck in a local optimum.