Can anyone explain me about the simulation of hill climbing algorithm??
Mostrar comentarios más antiguos
Hill climbing algorithm
Respuesta aceptada
Más respuestas (2)
aswin t surendran
el 5 de Mzo. de 2015
0 votos
grace peng
el 19 de Dic. de 2017
0 votos
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
Categorías
Más información sobre Particle Swarm en Centro de ayuda y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!