融合局部搜索的和声搜索算法  

Local search technique fusion of harmony search algorithm

作　　者：朱凡[1] 刘建生[1] 谢亮亮[1] 

机构地区：[1]江西理工大学理学院,江西赣州341000

出　　处：《计算机工程与设计》2017年第6期1541-1546,共6页Computer Engineering and Design

基　　金：国家自然科学基金项目(61462036)

摘　　要：针对和声搜索算法存在易陷入局部最优,导致提早收敛的缺点,提出一种融合局部搜索的和声搜索(LSHS)算法。将最优和声向量与在种群中随机选择的两个和声向量进行线性组合,生成一个新和声,扩大局部搜索区域,维持算法多样性,提高算法收敛速度。用9个标准测试函数对所提算法与HS和GHS算法进行实验比较,实验结果表明,LSHS算法的结果更优,性能更好。Harmony search(HS)algorithm tends to suffer from easiness of falling into local optimum,resulting in early convergence.Aiming at these disadvantages of the basic HS,an improved HS algorithm called local search technique fusion of harmony search(LSHS)algorithm was proposed.Linear combination of the best harmony vector and two vectors of harmonies randomly chosen in the population was proceeded to create a new harmony,thus expanding the local search area while the convergence rate was improved.In the experiments,the proposed algorithm was compared with HS and GHS algorithm on nine benchmark functions.Experimental results show that the LSHS algorithm is more effective.

关 键 词：和声搜索算法 最优和声 随机选择 线性组合 局部搜索 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]