期刊文献+

超越方程的全局优化解法 被引量:1

The Global Optimization Method to Transcendental Equation
下载PDF
导出
摘要 现有的粒子群算法在求解超越方程时具有局部搜索能力差、后期收敛速度较慢的缺陷,导致了粒子群算法无法得到较为精确的超越方程的根。在粒子群算法的基础上,加入局部搜索能力较好、后期收敛速度较快的拟牛顿算法,依照算法的进程自动甄选粒子群算法和拟牛顿算法,充分发挥粒子群算法的全局搜索性能和拟牛顿法的局部搜索性能,进而将超越方程转化为了纯粹的函数优化问题,并基于此方法进行求解实验,结果表明该方法具有极高的收敛速度和求解精度。 The existing PSO(particle swarm optimization)algorithm has many problems in solving the transcendental equation,such as poor local search ability,post-convergence slower,which causes that PSO algorithm can not get more precise transcendental equation roots.In this article,based on particle swarm optimization algorithm,and adding quasi-Newton algorithm with better local search ability and faster post-convergence,the particle swarm algorithm and quasi-Newton method have been automatically selected and given full performance in local search ability abut this two algorithms.Thus the transcendental equation has been transformed into purely function optimization problem.Based on this method,a solution experiment has been made,and the results show that this method has the very high convergence speed and solution accuracy.
作者 夏绿玉
出处 《长春工程学院学报(自然科学版)》 2016年第3期125-128,共4页 Journal of Changchun Institute of Technology:Natural Sciences Edition
关键词 粒子群算法 全局优化 拟牛顿法 超越方程 particle swarm optimization global optimization quasi-Newton method transcendental equation
  • 相关文献

参考文献4

二级参考文献33

  • 1王登刚,刘迎曦,李守巨.岩土工程位移反分析的遗传算法[J].岩石力学与工程学报,2000,19(z1):979-982. 被引量:49
  • 2[1]Holland J H.Adaptation in nature and artificial system[M].Ann Arbor:The University of Michigan Press,1975.
  • 3[2]Kennedy J,Eberhart R C.Particle swarm optimization[C]//Proceedings of the IEEE International Conference on Neural Networks.Piscataway,NJ:IEEE Press,1995:1942-1948.
  • 4[3]Guo G W,Huang K M.Competition algorithm of simulating natural tree growth and its application in curve fitting[J].Journal of Computational and Theoretical Nanoscience,2007,4(7-8):1301-1304.
  • 5[5]张金屯.数量生态学[M].北京:科学出版社,2006.
  • 6[6]Bianchini M,Fanelli S.Optimal algorithms for well-conditioned nonlinear systems of equations[J].IEEE Trans.On computers,2001,50(7):689-698.
  • 7[9]Liu F,Chen X,Huang Z.Parallel genetic algorithm for finding roots of complex functional equation[C]//Proceedings of 2nd International Conference on Pervasive Computing and Application.Birmingham,Alabama:IEEE Press,2007:542-545.
  • 8Bonabeau E, Dorigo M, Theraulaz G. Inspiration for optimization from social insect behaviour [J]. Nature, 2000, 406(6): 39-42.
  • 9Bonabeau E, Dorigo M, Theraulaz G. Swarm intelligence: from natural to artificial systems [M]. New York: Oxford Univ Press, 1999.
  • 10Eberhart R C, Shi Y. Particle swarm optimization: developments, applications and resources [A]. Proc 2001 Congress Evolutionary Computation [C]. Piscataway, NJ: IEEE Press, 2001: 81-86.

共引文献92

同被引文献10

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部