系统工程与电子技术

• 软件、算法与仿真 • 上一篇    下一篇

基于混合策略的引力搜索算法

毕晓君1, 刁鹏飞1, 肖婧2   

  1. 1. 哈尔滨工程大学信息与通信工程学院, 黑龙江 哈尔滨 150001;
    2. 辽宁省交通高等专科学校信息工程系, 辽宁 沈阳 110122
  • 出版日期:2014-11-03 发布日期:2010-01-03

Gravitational search algorithm with mixed strategy

BI Xiao-jun1, DIAO Peng-fei1, XIAO Jing2   

  1. 1.College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China;
    2. Department of Information Engineering, Liaoning Provincial College of Communications, Shenyang 110122, China
  • Online:2014-11-03 Published:2010-01-03

摘要:

为了提高引力搜索算法(gravitational search algorithm, GSA)在处理单目标优化问题上的综合能力,提出了一种基于混合改进策略的GSA。依照种群个体自身的进化情况,提出个体进化率的进化策略,以提高算法的收敛速度;采取方向性的变异策略,较好地平衡了全局搜索能力和局部开采能力,最大限度地降低了种群陷入局部最优的可能。基于标准测试函数的仿真实验表明,基于混合策略的GSA算法可有效避免早熟收敛,在收敛精度和收敛速度上与标准的GSA算法以及相应的改进算法相比有显著提高。

Abstract:

In order to improve the performance of the gravitational search algorithm (GSA) in solving single objective optimization problems, a new GSA with mixed improved strategy is proposed. According to the evolution situation, the individual evolution rate strategy is proposed which is applied to enhance the rate of convergence. And a kind of variation strategy is adopted to balance the ability of global searching and local exploiting which avoid the possibility that the population fall into local optimum. Simulation experimental results on benchmark functions show that the GSA with mixed strategy has a good performance in avoiding premature convergence. Compared with GSA and other improved GSA, the new algorithm has a good performance not only in convergence rate but also in convergence precision.