Using Randomness to Avoid Local Minima
We maintain a trial solution.
- Generate a random move from the trial solution.
- If the move would beat the trial solution then accept it as the new trial solution.
- If the move does not improve the solution then accept it with some small probability.
This enables us to navigate the entire solution space and not get caught in a local minimum.