计算机应用 ›› 2014, Vol. 34 ›› Issue (1): 194-198.DOI: 10.11772/j.issn.1001-9081.2014.01.0194

• 人工智能 • 上一篇    下一篇

改进和声搜索算法及其在连续函数优化中的应用

路静1,2,顾军华2   

  1. 1. 河北工业大学 电气工程学院,天津 300401
    2. 河北工业大学 计算机科学与软件学院,天津 300401
  • 收稿日期:2013-06-18 修回日期:2013-08-23 出版日期:2014-01-01 发布日期:2014-02-14
  • 通讯作者: 路静
  • 作者简介:路静(1981-),女,北京人,讲师,博士研究生,主要研究方向:智能优化算法、电磁场与磁;顾军华(1966-),男,河北赵县人,教授,博士生导师,博士,主要研究方向:智能信息处理。
  • 基金资助:

    天津市应用基础与前沿技术研究计划项目

Continuous function optimization based on improved harmony search algorithm

LU Jing1,2,GU Junhua1   

  1. 1. School of Computer Science and Engineering, Hebei University of Technology, Tianjin 300401,China
    2. School of Electrical Engineering, Hebei University of Technology, Tianjin 300401,China;
  • Received:2013-06-18 Revised:2013-08-23 Online:2014-01-01 Published:2014-02-14
  • Contact: LU Jing

摘要: 针对一般和声搜索(HS)算法在求解连续函数优化问题时存在的困难,提出一种改进的多样化和声搜索(IDHS)算法。该算法借鉴模拟退火算法的思想对参数的更新方式作出调整,并且限制保存在和声记忆矩阵中的一致和声的数量以增加解的多样性。数值仿真结果表明,与其他几种传统的和声搜索算法相比,该方法进一步提高了计算精度和收敛速度,以及全局寻优能力。

关键词: 和声搜索算法, 元启发式算法, 连续函数优化, 基函数, 遗传算法

Abstract: Concerning the difficulties in solving the continuous functions of general Harmony Search (HS) algorithm, an improved HS algorithm was proposed. With analogies to the concept of the simulated annealing algorithm, the way of updating parameter was redesigned. And it limited the number of identical harmonies stored in the harmony memory to increase the diversity of solutions. Simulation results of the proposed algorithm were compared with other HS approaches. The computational results reveal that the proposed algorithm is more effective in enhancing the solution quality and convergence speed than other HS approaches.

Key words: Harmony Search (HS) algorithm, meta-heuristic algorithm, continuous function optimization, benchmark function, Genetic Algorithm (GA)

中图分类号: