计算机工程与应用2018，Vol.54Issue(12)：21-26,115,7.DOI:10.3778/j.issn.1002-8331.1803-0351
随机交叉全局和声搜索算法
Random crosser global harmony search algorithm
摘要
Abstract
This paper proposes a Random Crosser Global Harmony Search(RCGHS)algorithm for the problem of prema-ture convergence in harmony search algorithm. In the improvisation stage, the new harmony vector is generated dynami-cally by means of random crossover for the global optimization problems, i.e., the worst harmony learning from the best harmony and the random selected other harmony learning from the best harmony with different strategies. Mutation strategy is employed to improve the diversity of harmony memory. In the updating stage, the worst harmony vector is updated by the optimal individual of the improvising harmony and the random opposition-based learning harmony vector. Finally, the simulation is carried out using the optimization algorithm of AGHS, ABC, PSO, GWO and other HS variants that are recently proposed. The simulation results demonstrate the RCGHS algorithm has higher convergence precision and con-vergence rate.关键词
和声搜索算法/随机交叉/反向学习/局部最优Key words
harmony search algorithm/random crosser/opposition-based learning/local optimum分类
信息技术与安全科学引用本文复制引用
翟军昌,秦玉平..随机交叉全局和声搜索算法[J].计算机工程与应用,2018,54(12):21-26,115,7.基金项目
国家自然科学基金(No.61603055) （No.61603055）
辽宁省自然基金重点项目(No.20170540011) （No.20170540011）
辽宁省博士科研启动基金(No.201601349) （No.201601349）
辽宁省教育厅项目(No.LQ2017003). （No.LQ2017003）
