亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
陈旧完成签到,获得积分10
5秒前
欣欣子完成签到,获得积分10
11秒前
17秒前
yxl完成签到,获得积分10
18秒前
可耐的盈完成签到,获得积分10
24秒前
28秒前
绿毛水怪完成签到,获得积分10
31秒前
33秒前
lsc完成签到,获得积分10
37秒前
39秒前
42秒前
小fei完成签到,获得积分10
43秒前
麻辣薯条完成签到,获得积分10
49秒前
52秒前
中中完成签到,获得积分10
55秒前
时尚身影完成签到,获得积分10
56秒前
56秒前
阿瓜师傅完成签到 ,获得积分10
57秒前
58秒前
Akim应助猜猜我是谁采纳,获得10
1分钟前
leoduo完成签到,获得积分0
1分钟前
流苏2完成签到,获得积分10
1分钟前
loii应助科研通管家采纳,获得20
1分钟前
1分钟前
大模型应助快点喝奶茶采纳,获得10
1分钟前
1分钟前
烟花应助武狼帝采纳,获得10
1分钟前
1分钟前
1分钟前
武狼帝发布了新的文献求助10
2分钟前
2分钟前
碧蓝皮卡丘完成签到,获得积分10
2分钟前
vvan发布了新的文献求助10
2分钟前
2分钟前
zh完成签到,获得积分10
2分钟前
2分钟前
2分钟前
武狼帝完成签到 ,获得积分10
2分钟前
2分钟前
2分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The Cambridge History of China: Volume 4, Sui and T'ang China, 589–906 AD, Part Two 1500
Cowries - A Guide to the Gastropod Family Cypraeidae 1200
Quality by Design - An Indispensable Approach to Accelerate Biopharmaceutical Product Development 800
Signals, Systems, and Signal Processing 610
Research Methods for Applied Linguistics 500
A Social and Cultural History of the Hellenistic World 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6394459
求助须知:如何正确求助?哪些是违规求助? 8209627
关于积分的说明 17382127
捐赠科研通 5447639
什么是DOI,文献DOI怎么找? 2880008
邀请新用户注册赠送积分活动 1856463
关于科研通互助平台的介绍 1699118