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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
zyh给zyh的求助进行了留言
刚刚
underoos完成签到,获得积分10
刚刚
Victor66685应助111采纳,获得30
2秒前
2秒前
cyy完成签到,获得积分10
3秒前
3秒前
underoos发布了新的文献求助10
4秒前
张不张发布了新的文献求助10
4秒前
4秒前
alian发布了新的文献求助10
4秒前
量子星尘发布了新的文献求助10
4秒前
she发布了新的文献求助10
4秒前
拼搏的韭菜完成签到,获得积分10
5秒前
优美巨人发布了新的文献求助10
5秒前
Akim应助cc采纳,获得10
6秒前
6秒前
星辰大海应助清欢采纳,获得10
7秒前
斯文败类应助小冯采纳,获得10
7秒前
细心蚂蚁发布了新的文献求助10
7秒前
SunOSun发布了新的文献求助30
8秒前
学术laji发布了新的文献求助10
8秒前
8秒前
10秒前
科研通AI5应助xiaoyu123采纳,获得10
10秒前
10秒前
情怀应助awwww采纳,获得10
11秒前
neckerzhu发布了新的文献求助10
11秒前
紧张的惜寒完成签到,获得积分10
13秒前
13秒前
13秒前
干涸的脑瓜完成签到 ,获得积分10
13秒前
13秒前
14秒前
16秒前
nns完成签到,获得积分10
16秒前
17秒前
wml完成签到,获得积分10
17秒前
cc完成签到,获得积分10
17秒前
oudian发布了新的文献求助10
17秒前
17秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Zeolites: From Fundamentals to Emerging Applications 1500
International Encyclopedia of Business Management 1000
Encyclopedia of Materials: Plastics and Polymers 1000
Architectural Corrosion and Critical Infrastructure 1000
Early Devonian echinoderms from Victoria (Rhombifera, Blastoidea and Ophiocistioidea) 1000
Hidden Generalizations Phonological Opacity in Optimality Theory 1000
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 4934228
求助须知:如何正确求助?哪些是违规求助? 4202186
关于积分的说明 13056265
捐赠科研通 3976412
什么是DOI,文献DOI怎么找? 2178969
邀请新用户注册赠送积分活动 1195288
关于科研通互助平台的介绍 1106655