Greedy Hill-Climbing (cont.)

To avoid these problems, we can use:

• TABU-search

  • Keep list of K most recently visited structures
  • Apply best move that does not lead to a structure in the list
  • This escapes plateaus and local maxima and with “basin” smaller than K structures

• Random Restarts

  • Once stuck, apply some fixed number of random edge changes and restart search
  • This can escape from the basin of one maxima to another

Previous slide

Next slide

Back to first slide

View graphic version