PSO+: A new particle swarm optimization algorithm for constrained problems

多群优化 数学优化 趋同(经济学) 帝国主义竞争算法 元优化 局部最优 萤火虫算法 水准点(测量) 群体智能 混合算法(约束满足) 收敛速度 无导数优化
作者
Manoela Kohler,Marley Vellasco,Ricardo Tanscheit
出处
期刊:Applied Soft Computing [Elsevier BV]
卷期号:85: 105865-105865 被引量:56
标识
DOI:10.1016/j.asoc.2019.105865
摘要

The Particle Swarm Optimization algorithm is a metaheuristic based on populations of individuals in which solution candidates evolve through simulation of a simplified model of social adaptation. By aggregating robustness, efficiency and simplicity, PSO has gained great popularity. Modified PSO algorithms have been proposed to solve optimization problems with domain, linear and nonlinear constraints. Other algorithms that use multi-objective optimization to deal with constrained problems face the problem of not being able to guarantee finding feasible solutions. Current PSO algorithms that deal with constraints only treat domain constraints by controlling the velocity of particle displacement in the swarm, or do so inefficiently by randomly resetting each infeasible particle. This approach may make it infeasible to optimize certain problems, especially real ones. This work presents a new particle swarm optimization algorithm, called PSO+, capable of solving problems with linear and nonlinear constraints in order to solve these deficiencies. The proposed algorithm uses a feasibility repair operator and two swarms to ensure there will always be a swarm whose particles fully respect every constraint. A new particle update method is also proposed to insert diversity into the swarm and improve search-space coverage, allowing the search-space border to be exploited as well, which is particularly convenient when the optimization involves active constraints in global optimum. Two heuristics are proposed to initialize a feasible swarm with the purpose of speeding up the initialization mechanism and ensuring diversity at the starting point of the optimization process. Furthermore, a neighborhood topology is proposed to minimize premature convergence. The proposed algorithm was tested for twenty-four benchmark functions, as well as in a real reservoir drainage plan optimization problem. Results attest that the new algorithm is competitive, since it increases the efficiency of the PSO and the speed of convergence.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
stuhbnueducn完成签到,获得积分10
1秒前
dk发布了新的文献求助10
1秒前
在水一方应助may采纳,获得10
2秒前
chigga发布了新的文献求助10
2秒前
燚燚应助好运6连采纳,获得10
2秒前
2秒前
Xiaoqiu发布了新的文献求助10
3秒前
Zzz完成签到,获得积分10
3秒前
嗯哼发布了新的文献求助80
3秒前
冰雪物语完成签到,获得积分10
3秒前
流萤发布了新的文献求助10
3秒前
3秒前
hhh完成签到,获得积分10
3秒前
mahuahua完成签到,获得积分10
4秒前
Lynn完成签到,获得积分0
4秒前
小二郎应助zeng采纳,获得10
4秒前
11完成签到,获得积分10
4秒前
Xiongpd完成签到,获得积分10
4秒前
平安完成签到 ,获得积分10
5秒前
5秒前
5秒前
79发布了新的文献求助10
5秒前
Demon完成签到,获得积分10
5秒前
2024910298完成签到,获得积分10
5秒前
6秒前
传奇3应助wyqking采纳,获得10
6秒前
6秒前
35766完成签到,获得积分10
6秒前
day完成签到,获得积分10
6秒前
汝桢完成签到 ,获得积分10
6秒前
6秒前
君莫笑完成签到,获得积分10
6秒前
7秒前
兮颜应助cui采纳,获得10
7秒前
开朗发卡完成签到,获得积分10
7秒前
DrN完成签到,获得积分10
7秒前
NEXUS1604完成签到,获得积分0
7秒前
赫三问发布了新的文献求助10
7秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Salmon nasal cartilage-derived proteoglycan complexes influence the gut microbiota and bacterial metabolites in mice 2000
The Composition and Relative Chronology of Dynasties 16 and 17 in Egypt 1500
Cowries - A Guide to the Gastropod Family Cypraeidae 1200
ON THE THEORY OF BIRATIONAL BLOWING-UP 666
Signals, Systems, and Signal Processing 610
“美军军官队伍建设研究”系列(全册) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6384851
求助须知:如何正确求助?哪些是违规求助? 8197872
关于积分的说明 17338053
捐赠科研通 5438363
什么是DOI,文献DOI怎么找? 2876069
邀请新用户注册赠送积分活动 1852633
关于科研通互助平台的介绍 1697001