Can anyone explain me about the simulation of hill climbing algorithm??
古いコメントを表示
採用された回答
その他の回答 (2 件)
grace peng
2017 年 12 月 19 日
0 投票
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
カテゴリ
ヘルプ センター および File Exchange で Particle Swarm についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!