期刊文献+

改进的PSO算法及其在软测量建模中的应用 被引量:1

Improved Particle Swarm Optimization and Application in Soft Sensor Modeling
下载PDF
导出
摘要 通过大量仿真实验,考察了粒子群算法(PSO)中粒子平均速度和算法收敛性之间的关系,提出了一种基于粒子速度反馈信息的自适应调整权重策略,同时在搜索过程中引入混沌序列。给出的收敛性分析证明,该算法可以以概率1收敛到全局最优解。对经典函数的测试计算表明,改进后的PSO算法较好地解决了基本粒子群算法中易陷入局部最优的缺点,在稳定性和收敛精度上均优于普通的PSO算法。改进的粒子群算法被用于优化神经网络的结构和参数,并将基于改进算法的神经网络用于4_CBA软测量建模中。实际应用表明,与基于其它智能算法的神经网络相比,该网络不仅有较高的泛化性能,而且有更快的学习速度和较好的实时性。 The relationship between swarm average velocity and convergence was studied in particle swarm optimization (PSO) through numerical simulations, and then a novel adaptive inertia weight particle swarm algorithm based on the particle velocity feedback (VPSO) was proposed, simultaneously, chaotic series was introduced in search. Then, the convergence analysis was given, which represents that the algorithm can converge to overall optimum. The experimental results of classic functions show that the advanced PSO algorithm solves the defect of PSO algorithm which is apt to trap in local minimums, and has great advantage of convergence property and robustness compared to PSO algorithm. In the last, the improved PSO was applied to optimize the structure and parameters in neural network (NN). Then, the NN was applied in soft sensor modeling of 4-CBA. The experiments demonstrate that the neural network based on improved PSO has faster learning speed and better real time ability compared to other NN.
出处 《系统仿真学报》 CAS CSCD 北大核心 2009年第8期2125-2129,共5页 Journal of System Simulation
基金 国家杰出青年科学基金(60625302) 国家973计划(2002CB3122000) 国家863计划项目(20060104Z1081) 上海市科委重大基础研究(05DJ14002) 上海市自然科学基金(05ZR14038)
关键词 粒子群算法 自适应 软测量 神经网络 particle swarm optimization adaptive inertia weight soft sensor neural network
  • 相关文献

参考文献11

  • 1李宁,刘飞,孙德宝.基于带变异算子粒子群优化算法的约束布局优化研究[J].计算机学报,2004,27(7):897-903. 被引量:74
  • 2高鹰,谢胜利.免疫粒子群优化算法[J].计算机工程与应用,2004,40(6):4-6. 被引量:160
  • 3Kenndy J. Small Worlds and Megaminds: Effects of Neighborhood Topology on Particle Swarm Performance [C]// Proceedings of the Congress on Evolutionary Computation. Washington DC, USA, 1999: 1931-1938.
  • 4Kenndy J, Eberhart R. Particle Swarm Optimization [C]// Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, 1995. USA: IEEE, 1995: 1942-1948.
  • 5Shi Y, Eberhart R C. A modified particle swarm optimizer [C]//IEEE International Conference of Evolutionary Computation. Anchorage, Alaska, USA, 1998. USA: IEEE, 1998: 69-73.
  • 6孟红记,郑鹏,梅国晖,谢植.基于混沌序列的粒子群优化算法[J].控制与决策,2006,21(3):263-266. 被引量:76
  • 7Clerc M, Kennedy J. The particle swarm-Explosion, stability, and convergence in a multidimensional complex space [J]. IEEE Transactions on Evolutionary Computation (S 1089-778X), 2002, 6( 1): 58-73.
  • 8Cristian TI. The particle swarm optimization algorithm: Convergence analysis and parameter selection [J]. Information Processing Letters (S0020-0190), 2003, 85(6): 317-325.
  • 9梁之舜 邓永绿.概率论与数理统计[M].北京:高等教育出版社,1988..
  • 10郭崇慧,唐焕文.演化策略的全局收敛性[J].计算数学,2001,23(1):105-110. 被引量:36

二级参考文献29

  • 1李宁,刘飞,孙德宝.基于带变异算子粒子群优化算法的约束布局优化研究[J].计算机学报,2004,27(7):897-903. 被引量:74
  • 2李爱国.多粒子群协同优化算法[J].复旦学报(自然科学版),2004,43(5):923-925. 被引量:398
  • 3徐宗本,李国.解全局优化问题的仿生类算法(I)—模拟进化算法[J].运筹学杂志,1995,14(2):1-13. 被引量:39
  • 4李国杰.计算智能:一个重要的研究方向.智能计算机基础研究’94[M].北京:清华大学出版社,1994..
  • 5梁之舜 邓集贤 等.概论论与数理统计[M].北京:高等教育出版社,1988..
  • 6李国杰,智能计算机基础研究’94,1994年
  • 7梁之舜,概率论与数理统计,1988年
  • 8Teng Hong-Fei, Sun Shou-Lin, Ge Wen-Hai, Zhong Wan-Xie. Layout optimization for the dishes installed on a rotating table. Science in China (Series A), 1994,37(10): 1272~1280
  • 9Kennedy J.. Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In: Proceedings of the Congress on Evolutionary Computation, Washington DC, USA, 1999, 1931~1938
  • 10Clerc M., Kennedy J.. The particle swarm--Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computer, 2002,6(1): 58~73

共引文献342

同被引文献6

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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