东北大学学报:自然科学版 ›› 2014, Vol. 35 ›› Issue (8): 1073-1076.DOI: 10.12068/j.issn.1005-3026.2014.08.003

• 信息与控制 • 上一篇    下一篇

带有全局交叉的修正和声搜索算法

王皓1,高立群1,欧阳海滨1,秦威2   

  1. (1 东北大学 信息科学与工程学院, 辽宁 沈阳110819; 2 中国航天空气动力技术研究院, 北京100074)
  • 收稿日期:2013-09-17 修回日期:2013-09-17 出版日期:2014-08-15 发布日期:2014-04-11
  • 通讯作者: 王皓
  • 作者简介:王皓(1981-),女,辽宁沈阳人,东北大学博士研究生;高立群(1949-),男,辽宁沈阳人,东北大学教授,博士生导师.
  • 基金资助:
    国家自然科学基金资助项目(61273155);辽宁省科技厅博士科研启动基金资助项目(L201205118).

A Modified Harmony Search Algorithm with Global Crossover〓

WANG Hao1, GAO Liqun1, OUYANG Haibin1, QIN Wei2   

  1. 1 School of Information & Science, Northeastern University, Shenyang 110819, China; 2 China Academy of Aerospace Aerodynamics, Beijing 100074, China.
  • Received:2013-09-17 Revised:2013-09-17 Online:2014-08-15 Published:2014-04-11
  • Contact: OUYANG Haibin
  • About author:-
  • Supported by:
    -

摘要: 为增强和声搜索算法的全局搜索能力,提出一种带有全局交叉的修正和声搜索(MHSgc)算法.MHSgc算法采用多和声记忆库协同创作,应用邻域学习策略进行调整,取代原有的基音调整,从而增加了种群多样性.同时,提出一种全局交叉操作,并融合到MHSgc算法中,防止算法陷入局部最小.针对几个标准函数进行了实验仿真,数值结果表明,上述算法优于文献报道的8种智能算法(HS,IHS,GHS,NGHS,EHS,ITHS,MPSO,RMDE),具有较好的优化潜力.

关键词: 和声搜索算法, 多和声记忆库, 邻域学习, 全局交叉, 优化

Abstract: To improve the global search ability of a harmony search algorithm, a modified one with global crossover (MHSgc) was proposed. In the MHSgc, the collaborative improvisation of multipleharmonymemory was applied. A neighborlearning strategy replaced the intrinsic pitch adjusting,and thus the population diversity was increased. Moreover, global crossover operation was introduced into the MHSgc algorithm to avoid getting stuck into local minima. Simulations were carried out based on several benchmark functions. The results show that the proposed algorithm outperforms eight intelligent algorithms (IHS, GHS, NGHS, EHS, ITHS, MPSO, DE, ABC) reported in earlier literatures and has better optimization potential.

Key words: harmony search algorithm, multipleharmonymemory, neighborlearning, global crossover, optimization

中图分类号: