title: Random Mutation Hill Climber & Simulated Annealing - Which is Fastest?
body: <p>I have used a random mutation hill climbing algorithm as part of a project that I am working on, but was wondering whether it would be better to use simulated annealing to minimise the chance of getting stuck in any local optima.</p>
  
  <p>The question I have is which one tends to be generally faster from your experience?  Obviously there is a huge wealth of applications for both algorithms; this is more of a generalised pondering, if you like.</p>
  
  <p>Thank you.</p>