计算机应用 ›› 2012, Vol. 32 ›› Issue (02): 428-431.DOI: 10.3724/SP.J.1087.2012.00428

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

基于微粒群与混合蛙跳融合的群体智能算法

孙辉1,龙腾2,赵嘉1   

  1. 1. 南昌工程学院 信息工程学院,南昌 330099
    2. 南昌航空大学 信息工程学院,南昌 330063
  • 收稿日期:2011-07-13 修回日期:2011-09-20 发布日期:2012-02-23 出版日期:2012-02-01
  • 通讯作者: 龙腾
  • 作者简介:孙辉(1959-),男,江西九江人,教授,博士,主要研究方向:计算智能、变分不等原理及变分不等式、多尺度几何分析、图像处理;
    龙腾(1986-),男,江西南昌人,硕士研究生,主要研究方向:群智能算法;
    赵嘉(1981-),男,江西九江人,讲师,硕士,主要研究方向:群智能算法。
  • 基金资助:
    国家自然科学基金资助项目(61072080);江西省自然科学基金资助项目(2010GZS0163,2009GZS0083)

Swarm intelligence algorithm based on combination of shuffled frog leaping algorithm and particle swarm optimization

SUN Hui1,LONG Teng2,ZHAO Jia1   

  1. 1. School of Information Engineering, Nanchang Institute of Technology, Nanchang Jiangxi 330099, China
    2. School of Information Engineering, Nanchang Hangkong University, Nanchang Jiangxi 330063, China
  • Received:2011-07-13 Revised:2011-09-20 Online:2012-02-23 Published:2012-02-01
  • Contact: LONG Teng

摘要: 针对微粒群算法和混合蛙跳算法存在的早熟收敛问题,提出一种基于微粒群与混合蛙跳算法融合的群体智能算法。新算法将整个群体分成数目相等的蛙群和微粒群群体。在两群体独立进化过程中,设计了一种两群之间的信息替换策略:比较蛙群与微粒群的最佳适应值,如果蛙群进化较好,利用蛙群各子群中最差个体替换微粒群一部分较好个体;否则,用微粒群中较好的一部分个体替换蛙群各子群的最好个体。同时,设计了一种两群之间的相互协作方式。为避免微粒群因早熟收敛而影响信息替换策略效果,适时对其所有个体最好位置进行随机扰动。仿真实验表明,新算法可以有效提高全局搜索能力及收敛速度,对于高维复杂函数问题,算法具有很好的稳定性。

关键词: 微粒群算法, 混合蛙跳算法, 信息替换策略, 随机扰动, 协作方式

Abstract: Concerning the premature convergence of Particle Swarm Optimization (PSO) algorithm and Shuffled Frog Leaping Algorithm (SFLA), this paper proposed a swarm intelligence optimization algorithm based on the combination of SFLA and PSO. In this algorithm, the whole particle was divided into two equal groups: SFLA and PSO. An information replacement strategy was designed in the process of their iteration: comparing the fitness of PSO with that of SFLA, the worst individual in each subgroup of SFLA would replace some better individuals in PSO when SFLA is better; otherwise, some better individuals in PSO would replace the best individual in each subgroup of SFLA. Meanwhile, a collaborative approach between the two groups was also designed. Since the information replacement strategy could be influenced by the premature convergence problem in PSO, a random disturbance would be given on each particle's best position. The simulation results show that the proposed algorithm can improve the global search ability and convergence speed efficiently. For the complex functions with high-dimension, the algorithm has very good stability.

Key words: Particle Swarm Optimization (PSO), Shuffled Frog Leaping Algorithm (SFLA), information replacement strategy, random disturbance, collaborative approach

中图分类号: