An Improvement of Hill Climbing Algorithm with Jumping Strategy
碩士 === 國立金門技術學院 === 電資研究所 === 98 === Hill-Climbing(HC) is an optimization algorithm that is widely known. It’s simple and fast. However, HC will be trapped when it fall into local optima, and cannot find global optimal solution. In this paper, we design a jumping strategy to help HC escape from loca...
Main Authors: | Bo-Yang Lin, 林伯陽 |
---|---|
Other Authors: | Chung-Chen Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/10690344384197282246 |
Similar Items
-
Improving the Hill-Climbing Algorithm for the Nurse Rostering Programs Design
by: Huang,Siang-ruei, et al.
Published: (2011) -
When A Genetic Algorithm Outperforms Hill-Climbing
by: Prügel-Bennett, A.
Published: (2004) -
Generalized hill climbing algorithms for discrete optimization problems
by: Johnson, Alan W.
Published: (2014) -
A Convergence Analysis of Generalized Hill Climbing Algorithms
by: Sullivan, Kelly Ann
Published: (2014) -
Intelligent hybrid cuckoo search and β-hill climbing algorithm
by: Bilal H. Abed-alguni, et al.
Published: (2020-02-01)