Header menu link for other important links
β-Hill climbing: an exploratory local search
Published in Springer London
Volume: 28
Pages: 153 - 168
Hill climbing method is an optimization technique that is able to build a search trajectory in the search space until reaching the local optima. It only accepts the uphill movement which leads it to easily get stuck in local optima. Several extensions to hill climbing have been proposed to overcome such problem such as Simulated Annealing, Tabu Search. In this paper, an extension version of hill climbing method has been proposed and called β-hill climbing. A stochastic operator called β-operator is utilized in hill climbing to control the balance between the exploration and exploitation during the search. The proposed method has been evaluated using IEEE-CEC2005 global optimization functions. The results show that the proposed method is a very efficient enhancement to the hill climbing providing powerful results when it compares with other advanced methods using the same global optimization functions. © 2016, The Natural Computing Applications Forum.
About the journal
JournalData powered by TypesetNeural Computing and Applications
PublisherData powered by TypesetSpringer London