Skip to main content
Share Your Experience: Take the 2024 Developer Survey
5 votes
Accepted

What is the difference between Stochastic Hill Climbing and Simulated Annealing?

Russell and Norvig's book (3rd edition) describe these two algorithms (section 4.1.1., p. 122) and this book is the reference that you should generally use when studying search algorithms in ...
nbro's user avatar
  • 40.8k
3 votes

When to choose Stochastic Hill Climbing over Steepest Hill Climbing?

Let's begin with some definitions first. Hill-climbing is a search algorithm simply runs a loop and continuously moves in the direction of increasing value-that is, uphill. The loop terminates when it ...
Ugnes's user avatar
  • 2,023
3 votes

When to choose Stochastic Hill Climbing over Steepest Hill Climbing?

The steepest hill climbing algorithms works well for convex optimization. However, real world problems are typically of the non-convex optimization type: there are multiple peaks. In such cases, when ...
Dynamic Stardust's user avatar
1 vote

When to choose Stochastic Hill Climbing over Steepest Hill Climbing?

I'm new to these concepts too, but the way I've understood it, Stochastic hill climbing would perform better in cases where computation time is precious (includes the calculation of the fitness ...
Nav's user avatar
  • 491

Only top scored, non community-wiki answers of a minimum length are eligible