首页> 外文OA文献 >Particle Swarm Optimization for Solving Nonlinear Programming Problems
【2h】

Particle Swarm Optimization for Solving Nonlinear Programming Problems

机译:粒子群算法求解非线性规划问题

摘要

In the beginning we provide a brief introduction to the basic concepts of optimization and global optimization, evolutionary computation and swarm intelligence. The necessity of solving optimization problems is outlined and various types of optimization problems are discussed. A rough classfication of established optimization algorithms is provided, followed by Particle Swarm Optimization (PSO) and different types of PSO. Change in velocity component using velocity clamping techniques by bisection method and golden search method are discussed. We have discussed advantages of Using Self-Accelerated Smart Particle Swarm Optimization (SAS-PSO) technique which was introduced . Finally, the numerical values of the objective function are calculated which are optimal solution for the problem. The SAS-PSO and Standard Particle Swarm Optimization technique is compared as a result SAS-PSO does not require any additional parameter like acceleration coefficient and inertia-weight as in case of other standard PSO algorithms.
机译:首先,我们简要介绍了优化和全局优化,进化计算和群体智能的基本概念。概述了解决优化问题的必要性,并讨论了各种类型的优化问题。提供了已建立优化算法的粗略分类,然后是粒子群优化(PSO)和不同类型的PSO。讨论了采用二分法和黄金搜索法的速度钳制技术对速度分量的变化。我们已经讨论了使用自加速智能粒子群优化(SAS-PSO)技术的优点,该技术已被介绍。最后,计算目标函数的数值,这是该问题的最佳解决方案。比较了SAS-PSO和标准粒子群优化技术,因此,与其他标准PSO算法一样,SAS-PSO不需要任何其他参数,如加速度系数和惯性权重。

著录项

  • 作者

    Maharana Rakesh;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号