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에서 Switches and Breakers에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!