.png){kind=icon}
返回
A nested particle swarm algorithm based on sphere mutation to solve bi-level optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-019-03888-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of bi-level optimization has always been a hot topic due to its extensive application. Increasing size and complexity have prompted theoretical and practical interest in the design of effective algorithm. This paper adopts particle swarm algorithm (PSO) at both level. First, given the nested nature of bi-level problem, we introduce a hyper-sphere search into PSO as mutation operator to maintain the swarms diversity. Second, for complex constraints processing, the proposed algorithm adopts a dynamic constraint handling strategy, which makes the solution located on the constraint boundary easier to be obtained. Third, a quadratic approximation mutation is introduced into PSO, which guides particles to a better search area. Finally, the convergence is proved and the simulation results show that the proposed algorithm is effective.
Keyword:
Bi-level optimization
Particle swarm algorithm
Sphere search
Radial basis function (RBF)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method基于再生核Hilbert空间方法的模糊微分方程数值解法.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems再生核算法在求解二阶两点模糊边值问题中的应用SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏
查看更多内容