Adaptive Novel Global Harmony Search Algorithm for Function Optimization Problems
Harmony Search (HS) algorithm is a new meta-heuristic global search algorithm.To solve the algorithm easily fall into the local optimal problem, this paper proposes an adaptive novel global harmony search (ANGHS) algorithm based on NGHS algorithm.First, a new location update strategy is given using the adjustment parameter F.Then, the mutation operation is introduced in the case of excluding the small probability Pm.In order to avoid blind adjustment of the step size in the late search and effectively adjust the structure of the solution, the definition of the norm is introduced to adjust parameter bw dynamically.In this paper, 7 standard Benchmark functions are used to simulate the experiment.The results show that the algorithm avoids the premature problem of the algorithm and enhances the global search ability of the algorithm, with obvious improvement in convergence speed and stability, and has good optimize performance.
Harmony search Meta-heuristic Function optimization
Jia-xin CHENG Xiang-qian LIU Xiao-yong CHEN
School of Computer and information Technology, Beijing Jiaotong University, Beijing, China General engineer room of China Railway Jinan Bureau Group Co., Ltd
国际会议
上海
英文
172-178
2018-04-15（万方平台首次上网日期，不代表论文的发表时间）