粒子群优化算法中的不可见墙方法

胡建; 李志蜀; 罗震; 罗谦; 乔少杰

您当前的位置：

首页 >

文章列表页 >

粒子群优化算法中的不可见墙方法

信息工程 | 更新时间：2023-11-28

- 粒子群优化算法中的不可见墙方法
- The Invisible Wall in Particle Swarm Optimization
- 工程科学与技术 2009年41卷第5期页码：165-169
- 作者机构：
  
  四川大学计算机学院
- 作者简介：
- 基金信息：
  
  国家科技部中小型科技企业创新基金(06C26225101730)
- DOI：
  中图分类号：
- 纸质出版日期：2009，
  
  网络出版日期：2009-6-4，
扫描看全文
胡建,李志蜀,罗震,罗谦,乔少杰.粒子群优化算法中的不可见墙方法[J].工程科学与技术,2009,41(5):165-169.

Hu Jian, Qiao Shao-jie. The Invisible Wall in Particle Swarm Optimization[J]. Advanced Engineering Sciences, 2009,41(5):165-169.
胡建,李志蜀,罗震,罗谦,乔少杰.粒子群优化算法中的不可见墙方法[J].工程科学与技术,2009,41(5):165-169. DOI：

Hu Jian, Qiao Shao-jie. The Invisible Wall in Particle Swarm Optimization[J]. Advanced Engineering Sciences, 2009,41(5):165-169. DOI：

摘要

中文摘要: 为了解决粒子群优化算法在处理边界约束问题时容易早熟的问题，从理论上证明了传统的不可见墙（Invisible Wall， IW）方法存在两种缺陷，即邻居中最优粒子与其他粒子具有不均等的进化机会，且大量的位置升级是多余的；并提出了一种改进的IW，即对各维分别进行离界判断，若其离界则立即再次升级。实验证明，改进的IW在收敛精度和运行时间上具有更好的性能，并对不同类型的边界表现了更强的鲁棒性和一致性。

Abstract

Abstract:The particle swarm optimization (PSO) is apt to cause premature convergence for boundary-constrained optimization problems. To solve this problem

two drawbacks in the invisible wall (IW) widely employed in PSO were discovered: the best particles in neighborhoods and the other particles have distinct opportunities to be evolved

and many updates of a particle’s position are unnecessary. An improved IW (IIW) was proposed. IIW detects whether or not a particle flies outside the allowable solution space in each dimension. If a dimension of the particle is out of the space

it will be updated immediately. Experiments were conducted in several boundary conditions and in different dimensionality

and the results showed that IIW performed more effectively than IW.

关键词

粒子群优化进化算法群体智能不可见墙边界约束

Keywords

particle swarm optimizationevolutionary algorithmsSwarm intelligenceinvisible wallboundary-constrained optimization

references

Jacob Robinson ；Yahya Rahmat-Samii,Particle Swarm Optimization in Electromagnetics,IEEE Transactions on Antennas and Propagation ,2004, 52(2).

Tiago Sousa ；Arlindo Silva ；Ana Neves,Particle Swarm based Data Mining Algorithms for classification tasks,Parallel Computing ,2004, 30(5/6).

Eberhart R C;Shi Y,Evolving artifieial neural networks,北京,1998.

van Den B F;Engelbrecht A P,A cooperative approach to particle Swarm optimization evolutionary computation,IEEE Transitions on Evolutionary Computation

Eberhart R C;Shi Y,Comparing inertia weights and constriction factors in particle swarm optimization,2000.

van den Bergh, F ；Engelbrecht, AP,A study of particle swarm optimization particle trajectories,Information Sciences ,2006, 176(8).

Shenheng Xu ；Rahmat-Samii, Y.,Boundary Conditions in Particle Swarm Optimization Revisited,IEEE Transactions on Antennas and Propagation ,2007, 55(3).

Bratton D;Kennedy J,Defining a Standard for Particle Swarm Optimization,2007.

Monson C K;Seppi K D,Exposing origin-seeking bias in PSO,2005.

Alvarez-Benitez J E;Everson R M;Fieldsend J E,A MOPSO algorithm based exclusively on pareto dominance concepts,2005.

Zhang W J;Xie X F;Bi D C,Handling botmdary constraints for numerical optimization by particle swarm flying in periodic search space,2004.

Richer T J;Blackwell T M,The Levy Particle Swarm,Vancouver,BC Canada,2006.

Kennedy J,Bare bones particle swarms,Indianapolis,USA,2003.

Clere M;Kennedy J,The particle swarm-explosion,stability,and convergence in a multidimensional complex space,IEEE Transactions on Evolutionary Computation,2002(6).

Liang J J;Qin A K;Suganthan P N,Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,IEEE Transactions on Evointionary Computation,2006(10).

Kennedy J;Eberhart R C,Particle swarm optimization,Perth,Australia,1995.

更多指标>

浏览量

270

下载量

CNKI被引量

文章被引用时，请邮件提醒。

提交

工具集

关联资源

粒子群优化算法中的位置矢量的评价策略

基于粒子群算法和投影追踪分析的干气密封动态特性优化