计算机应用 ›› 2014, Vol. 34 ›› Issue (5): 1267-1270.DOI: 10.11772/j.issn.1001-9081.2014.05.1267

• 先进计算 • 上一篇    下一篇

混合模式搜索的分布式memetic差分进化算法

张春美,郭红戈   

  1. 太原科技大学 电子信息工程学院,太原 030024
  • 收稿日期:2013-11-07 修回日期:2013-12-20 出版日期:2014-05-01 发布日期:2014-05-30
  • 通讯作者: 张春美
  • 作者简介:张春美(1978-),女,山西五台人,讲师,博士,主要研究方向:智能优化;郭红戈(1977-),女,山西潞城人,讲师,硕士,主要研究方向:智能信息处理、优化算法、预测控制。
  • 基金资助:

    国家自然科学基金资助项目;山西省基础研究计划项目(青年);太原科技大学校青年基金

Distributed memetic differential evolution algorithm combined with pattern search

ZHANG Chunmei,GUO Hongge   

  1. School of Electronic Information Engineering, Taiyuan University of Science and Technology, Taiyuan Shanxi 030024, china
  • Received:2013-11-07 Revised:2013-12-20 Online:2014-05-01 Published:2014-05-30
  • Contact: ZHANG Chunmei
  • Supported by:

    National Natural Science Foundation

摘要:

针对差分进化(DE)算法存在的早熟收敛与搜索停滞的问题,提出memetic分布式差分进化(DDE)算法。将memetic算法的思想融入到差分进化算法中,采用分布式的种群结构以及memetic算法中的混合策略,前者将初始种群分为多个子种群,子种群间根据冯·诺依曼拓扑结构周期性地实现信息交流,后者将差分进化算法作为进化的主要框架,模式搜索作为辅助手段,从而平衡算法的探索与开发能力。所提算法充分利用了模式搜索和差分进化算法的优势,建立了有效的搜索机制,增强了算法摆脱局部最优的能力,能够满足搜索过程对种群多样性及收敛速度的需求。将所提算法与几种先进的差分进化算法相比较,对标准测试函数进行优化的实验结果显示:所提算法在解的质量和收敛性能方面,均优于其他几种相比较的先进的差分进化算法。

Abstract:

In view of the problem of premature convergence and stagnation in the Differential Evolution (DE), the distributed memetic differential evolution was put forward. The idea of memetic algorithm was introduced into the DE algorithm. The distributed population structure and the combination strategy in memetic algorithm were applied. In the former strategy, the initial population was divided into multiple subpopulations according to the von Neumann topology and the periodical information exchange was realized among the subpopulations. And in the latter idea, the differential evolution was taken as an evolutionary frame that was assisted by pattern search to balance the exploration and exploitation abilities. The proposed algorithm made full use of advantages of the pattern search and differential evolution, set up an effective search mechanism and enhanced the algorithm to break away from local optima so as to satisfy the demand on population diversity and convergence speed of the search process. The proposed algorithm was run on a set of classic benchmark functions and compared with several state-of-the-art DE algorithms. Numerical results show that the proposed algorithm has excellent performance in terms of solution quality and convergence speed for all test problems given in this study.

中图分类号: