计算机科学 ›› 2014, Vol. 41 ›› Issue (5): 230-234.doi: 10.11896/j.issn.1002-137X.2014.05.048

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

带共轭梯度算子的爆炸搜索算法

曹炬,李艳姣,陈钢   

  1. 华中科技大学数学与统计学院 武汉430074;华中科技大学数学与统计学院 武汉430074;华中科技大学数学与统计学院 武汉430074
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金项目(11171122)资助

Explosion Search Algorithm with Conjugate Gradient Operator

CAO Ju,LI Yan-jiao and CHEN Gang   

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

摘要: 爆炸搜索算法作为一种全局优化算法,在迭代后期会出现收敛速度慢、精度低的问题,而传统的优化算法恰好能克服这些缺点。因此,引入一种传统算法——近似共轭梯度法,即用差商代替导数的共轭梯度法。在此基础上,提出了带共轭梯度算子的爆炸搜索算法,先引入了新的变异算子来提高算法的全局搜索能力,再运用共轭梯度法添加一个新的算子——共轭梯度算子,实现对最优炸点的局部搜索,从而提高算法的收敛速度与精度。6个常用的benchmark函数的测试结果说明,改进算法的优化结果明显优于原算法。

关键词: 爆炸搜索算法,变异算子,共轭梯度法

Abstract: As a global optimization algorithm,Explosion Search Algorithm (ESA) has some problem of low convergence speed and low optimization precision in the later period of the optimization.Fortunately,some deterministic optimization algorithms can overcome these shortcomings.Therefore,a deterministic algorithm without derivate information,which is called approximate conjugate gradient algorithm using difference quotient,was added in ESA.Based on the above,an improved Explosion Search Algorithm with Conjugate Gradient Operator (CGESA) was proposed.In CGESA,a new mutation operator is introduced to enhance the global search ability.Meanwhile,a new operator is introduced namely conjugate gradient operator to improve the local search ability of the optimal burst point,so that the convergence speed and optimization precision of CGESA are improved.Experimental results of the six well-known benchmark functions indicate that CGESA achieves better performance than ESA.

Key words: Explosion search algorithm,Mutation operator,Conjugate gradient method

[1] Holland J.Adaptation in Natural and Artificial Systems[M].Ann Arbor:University of Michigan Press,1975
[2] James K,Eberhart R C.Particle Swarm Optimization[C]∥IEEE International Conference on Neural Networks.IEEE,1995:1942-1947
[3] Pan W T.A new Fruit Fly Optimization Algorithm:Taking the financial distress model as an example[J].Knowledge-Based Systems,2012,6:69-74
[4] Gandomi A H,Alavi A H.Krill herd:A new bio-inspired optimization algorithm[J].Commun Nonlinear Sci Numer Simulat,2012,7(12):4831-4845
[5] 吴斌,崔志勇,倪卫红.具有混合群智能行为的萤火虫群优化算法研究[J].计算机科学,2012,9(5),198-199
[6] Eskandar H,Sadollah A,Bahreininejad A,et al.Water cycle algorithm-A novel metaheuristic optimization method for solving constrained engineering optimization problems[J].Computers & Structures,2012,110-111:151-166
[7] 曹炬,侯学卿.具有邻域搜索机制的爆炸搜索算法[J].计算机工程,2011,7(18):183-187
[8] 曹炬,侯学卿.爆炸搜索算法及其收敛性证明[J].计算机科学,2011,8(11):231-233
[9] Paul S.Andrews.An Investigation into Mutation Operators for Particle Swarm Optimization[C]∥IEEE Congress on Evolutiona-ry Computation.2006:1044-1050
[10] 吴祁宗.运筹学与最优化方法[M].北京:机械工业出版社,2003:114-117
[11] 赵小平.差商最速下降法及其收敛性[J].华东化工学院学报,1992,8(6):807-809
[12] Yao Xin,Liu Yong,Lin Guang-ming.Evolutionary Programming Made Faster[J].IEEE Transactions on Evolutionary Computation,1999,3(2):82-102
[13] Shi Yu-hui,Eberhart R C.A Modified Particle Swarm Optimizer[C]∥Proceeding of IEEE International Conference on Evolutionary Computation.1998,9-73
[14] Poli R,Kennedy J,Blackwell T.Particle swarm optimization[J].Swarm Intelligence Journal,2007,1:33-57

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!