期刊文献+

复形法粒子群优化算法研究 被引量:7

Novel particle swarm optimization algorithm based on complex method
下载PDF
导出
摘要 针对基本粒子群优化算法对复杂函数优化时难以获得最优解的缺陷,提出了一种复形粒子群优化算法。该算法采用复形法来提高粒子的局部搜索能力,从而保证了算法能够跳出局部最优,获得全局最优解。实验结果表明,与文献算法相比,该算法在基准函数优化时具有更强的寻优能力和更高的搜索精度。 To improve the search quality of the standard PSO algorithm for solving complex function,this paper proposed a novel particle swarm optimization algorithm based on complex method.It improved the local search capability of particle by using complex method in proposed algorithm,so that proposed algorithm could jump out of local optimal,and obtained the global optimal solution.Simulations show that proposed algorithm has more powerful optimizing ability and higher optimizing precision in function optimization than literature algorithms.
作者 张敏辉
机构地区 四川教育学院
出处 《计算机应用研究》 CSCD 北大核心 2012年第2期463-464,468,共3页 Application Research of Computers
关键词 粒子群优化算法 复形法 复形法粒子群算法 函数优化 particle swarm optimization algorithm complex method complex method particle swarm optimization algorithm function optimization
  • 相关文献

参考文献6

  • 1KENNEDY J, EBERHERT R. Particle swarm optimization [ C ]// Proc of IEEE International Conference on Neural Networks. 1995: 1942 - 1948.
  • 2SHI Yu-hui, EBERHART R C. Fuzzy adaptive particle swarm optimi- zation[ C ]//Proc of Congress on Evolutionary Computation. 2009: 101-106.
  • 3BERGH F, ENGELBRECHT A P. A cooperative approach to particle swarm optimization [ J]. IEEE Trans on Evolutionary Computa- tion ,2008,8(3) :225-239.
  • 4LIANG J J, QIN A K, SUGANTHAN P N, et al. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions[ J ]. IEEE Trans on Evolutionary Computation,2009, 10(3) :281-295.
  • 5CLERC M. The swarm and the queen: toward a deterministic and adaptive particle swarm optimization [ J ]. Evolutionary Gomputa- lion,2010,10 ( 3 ) : 1951-1957.
  • 6马建光,方敦原.一种基于概率方法的车型机器人路径规划方法[J].计算机工程与应用,2003,39(34):93-94. 被引量:7

二级参考文献7

  • 1[1]Anny J F.The Complexity of Robot Motion Planning[M].MIT Press,Cambridge, MA, 1988
  • 2[2]Jean-Paul Laumond,Paul E Jacobs,Michel Taix et al.A motion planner for nonholonomic mobile robots[J].JEEE Trans Robot Autom,1994;10(5)
  • 3[3]F Lamiraux,J-P Laumond. Smooth motion planning for car-like vehicles[C].In :Proc of the Int ,Conf on Intelligent Autonomous Systems,Venezia(IT) ,2000-07:1005~1012
  • 4[4]O Takeahashi,R J Schiling. Motion Planning in a plane using generalized Voronoi diagrams[J].IEEE Trans Tobot Autmat, 1989-04;6:143~150
  • 5[5]P L L in,S Chang. A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes. IEEE Trans,Syst,Man ,Cybern,Col, 23.1993: 825~833
  • 6[6]L Kavraki,P Svestka,J-C Latombe et al. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans Robotics and Automation,1996
  • 7[7]M Overmars. A random approach to motion planning[R].Technical Report RUU-CS-92-32,Dept Comput Sci,Utrecht Univ,Utrecht,the Netherlands, 1992-10

共引文献6

同被引文献79

引证文献7

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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