计算机科学 ›› 2015, Vol. 42 ›› Issue (9): 240-245.doi: 10.11896/j.issn.1002-137X.2015.09.046

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

基于斥力的引力搜索算法

王奇琪,孙根云,王振杰,张爱竹,陈晓琳,黄丙湖   

  1. 中国石油大学华东地球科学与技术学院 青岛266580,中国石油大学华东地球科学与技术学院 青岛266580,中国石油大学华东地球科学与技术学院 青岛266580,中国石油大学华东地球科学与技术学院 青岛266580,中国石油大学华东地球科学与技术学院 青岛266580,中国石油大学华东地球科学与技术学院 青岛266580
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(41471353)资助

Repulsion Force Based Gravitational Search Algorithm

WANG Qi-qi, SUN Gen-yun, WANG Zhen-jie, ZHANG Ai-zhu, CHEN Xiao-lin and HUANG Bing-hu   

  • Online:2018-11-14 Published:2018-11-14

摘要: 针对引力搜索算法(Gravitational Search Algorithm,GSA)收敛速度较快、易陷入局部最优的缺点,提出一种加入斥力的引力搜索算法RFGSA(Repulsion Force based Gravitational Search Algorithm)。该算法在引力搜索算法中引入斥力,即将一部分引力变为斥力,从而增加种群的多样性,有利于寻找全局最优。对10个基准测试函数进行优化的结果表明:该算法的收敛结果明显优于遗传算法、粒子群算法及原始的引力搜索算法。

关键词: 引力搜索算法(GSA),斥力,多样性,基准测试函数

Abstract: To overcome the shortage of gravitational search algorithm(GSA),such as high convergence speed and premature convergence,this paper presented a repulsion force based GSA(RFGSA).In RFGSA,repulsion force is introduced to GSA,which means that a part of attraction force is changed to repulsive force.Therefore,the diversity of the population is increased and thus the search ability of GSA is improved.To demonstrate the validity of RFGSA,10 benchmark functions were tested.The compared results indicate the significant superiority of the proposed algorithm.

Key words: Gravitational search algorithm(GSA),Repulsion force,Diversity,Benchmark function

[1] Rashedi E,Nezamabadi-pour H,Saryazdi S.GSA:a gravitational search algorithm [J].Information Sciences,2009,179(13):2232-2248
[2] Tang K S,Man K F,Kwong S,et al.Genetic algorithms and their applications [J].IEEE Signal Processing Magazine,1996,3(6):22-37
[3] Kirkpatrick S,Gelatto C D,Vecchi M P.Optimization by simulated annealing [J].Science,1983,220:671-680
[4] Dorigo M,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperating agents[J].IEEE Transactions on Systems,Man,and Cybernetics:Part B,1996,26(1):29-41
[5] Karakuzu J,Eberhart R C.Particle swarm optimization [C]∥Proceedings of IEEE International Conference on Neural Networks,1995:1942-1948
[6] 刘建华,张永晖,周理,等.一种权重递增的粒子群算法[J].计算机科学,2014,1(3):59-65 Liu Jian-hua,Zhang Yong-hui,Zhou Li,et al.Partide Swarm Optimization with Weight Increasing[J].Computer Science,2014,41(3):59-65
[7] 席裕庚,柴天佑,挥为民.遗传算法综述[J].控制理论与应用,1996,3(6):697-708 Xi Yu-geng,Chai Tian-you,Hui Wei-min.Survey on Genetic Algorithm[J].Coontrol Theory and Applications,1996,13(6):697-708
[8] Liu Y,Ma L.Gravitational search algorithm for location pro-blem[J].Computer Engineering and Applications,2012,8(27):42-44
[9] 牛培峰,肖兴军,李国强,等.基于万有引力搜索算法的电厂锅炉NOx排放模型的参数优化[J].动力工程学报,2013,3(2):100-106 Niu Pei-feng, Xiao Xing-jun,Li Guo-qiang,et al.Parameter Optimization for NOx Emission Model of power Plant Boilers Based on Gravitational Search Algorithm [J].Journal of Chinese Socie-ty of Power Engineering,2013,3(2):100-106
[10] 李沛,段海滨.基于改进万有引力搜索算法的无人机航路规划[J].中国科学,2012,2(10):1130-1136 Li P,Duan H B.Path planning of unmanned aerial vehicle based on improved gravitational search algorithm[J].Sci China Tech Sci,2012,2(10):1130-1136
[11] Jiang S,Ji Z,Shen Y.A novel hybrid particle swarm optimization and gravitational search algorithm for solving economic emission load dispatch problems with various practical constraints [J].Electrical Power and Energy Systems,2014,55:628-644
[12] 李春龙,戴娟,潘丰.引力搜索算法中粒子记忆性改进的研究[J].计算机应用,2012,2(10):2732-2735 Li C-L,Dai J,Pan F.Analysis on improvement of particle memory in gravitational search algorithm[J].Journal of Computer Applications,2012,2(10):2732-2735
[13] 徐星,李元香,姜大志,等.一种基于分子动理论的改进粒子群优化算法[J].系统仿真学报,2009,21(7):1904-1907 Xu X,Li Y X,Jiang D Z,et al.Improved Particle Swarm Optimization Algorithm Based on Theory of Molecular Motion[J].Journal of System Simulation,2009,21(7):1904-1907
[14] Rashedi E.Fuzzy Gravitational Search Algorithm[C]∥2012 2ndInternational Conference on Computer and Knowledge Engine-ering(ICCKE).2012:18-19

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!