-   Programming (
-   -   Simulated Annealing vs. Stochastic Hill Climbing (

Chronothread 02-28-2011 04:32 PM

Simulated Annealing vs. Stochastic Hill Climbing
Is the only real difference between the two that simulated annealing only allows for neighbors in the correct "temperature" set to be considered while stochastic hill climbing considers everything from the start? Also, if this is the case why does this feature of simulated annealing help prevent getting stuck in a local minimum/maximum?

ta0kira 02-28-2011 05:15 PM

Are you trying to compare partial differential equations with Markov processes?
Kevin Barry

Nominal Animal 02-28-2011 05:42 PM

In simulated annealing, the "temperature" acts like a float with a depth probe, while stochastic hill climbing is stuck to the surface.

Actually, stochastic hill climbing is like a runner with severe dementia but sharp wits: not knowing exactly which direction to take, but always downhill. Simulated annealing is like a runner on drugs: tends to run downhill, but will occasionally run uphill too, if high enough.

All times are GMT -5. The time now is 02:19 AM.