Can anyone explain me about the simulation of hill climbing algorithm??
Show older comments
Hill climbing algorithm
Accepted Answer
More Answers (2)
aswin t surendran
on 5 Mar 2015
0 votes
grace peng
on 19 Dec 2017
0 votes
hill climb algorithm is similar to the simulated annealing algorithm, which both of them are optimization.
this method selects an optimal solution as the current solution from the solution space of the current solution until it reaches a partial optimal solution。
Hill climbing algorithm is very simple to achieve, the main disadvantage is that it will fall into the partial optimal solution, but not necessarily able to search the ordinal (overall) optimal solution
Categories
Find more on Particle Swarm in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!