约束非线性优化问题粒子群优化的前景理论

A. Abdulkareem, H. A. Dhahad, N. Q. Yousif
{"title":"约束非线性优化问题粒子群优化的前景理论","authors":"A. Abdulkareem, H. A. Dhahad, N. Q. Yousif","doi":"10.1109/SCEE.2018.8684144","DOIUrl":null,"url":null,"abstract":"A swarm of individuals or particles work together to achieve a collective goal are called particle swarm optimization (PSO). However, when PSO applied to Constraints nonlinear optimization problems (CNOPs), this technique requires an efficient mechanism to handle the constraints, since it still suffers from the premature convergence problem (local minimum solution), and its inability to find a refinement solution, due to lack of exploitation and exploration capability. So that to deal with the above issues, a novel model of decision-making process has been used in PSO to solve the CNOP. This decision model improves the exploration hence, reduce the risk of premature convergence, by firstly, expanding the search space through generating new alternative solutions and secondly, factoring the risk of violating system constraints during the evolutionary process; while the exploitation has been improved through taking an effective choice (less risky solution) among the generated alternative solutions. The validation of the proposed approach has been performed on several benchmarks CNOPs. The statistical results demonstrate that the new algorithm considerably better than or at least competitive to several evolutionary algorithms reported in the literature.","PeriodicalId":357053,"journal":{"name":"2018 Third Scientific Conference of Electrical Engineering (SCEE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Prospect Theory in Particle Swarm Optimization for Constraints Nonlinear Optimization Problems\",\"authors\":\"A. Abdulkareem, H. A. Dhahad, N. Q. Yousif\",\"doi\":\"10.1109/SCEE.2018.8684144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A swarm of individuals or particles work together to achieve a collective goal are called particle swarm optimization (PSO). However, when PSO applied to Constraints nonlinear optimization problems (CNOPs), this technique requires an efficient mechanism to handle the constraints, since it still suffers from the premature convergence problem (local minimum solution), and its inability to find a refinement solution, due to lack of exploitation and exploration capability. So that to deal with the above issues, a novel model of decision-making process has been used in PSO to solve the CNOP. This decision model improves the exploration hence, reduce the risk of premature convergence, by firstly, expanding the search space through generating new alternative solutions and secondly, factoring the risk of violating system constraints during the evolutionary process; while the exploitation has been improved through taking an effective choice (less risky solution) among the generated alternative solutions. The validation of the proposed approach has been performed on several benchmarks CNOPs. The statistical results demonstrate that the new algorithm considerably better than or at least competitive to several evolutionary algorithms reported in the literature.\",\"PeriodicalId\":357053,\"journal\":{\"name\":\"2018 Third Scientific Conference of Electrical Engineering (SCEE)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Third Scientific Conference of Electrical Engineering (SCEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCEE.2018.8684144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Third Scientific Conference of Electrical Engineering (SCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCEE.2018.8684144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

一群个体或粒子一起工作以实现一个集体目标被称为粒子群优化(PSO)。然而,当PSO应用于约束非线性优化问题(CNOPs)时,由于缺乏开发和勘探能力,该技术仍然存在过早收敛问题(局部最小解)以及无法找到细化解的问题,因此需要一种有效的机制来处理约束。为了解决上述问题,在PSO中引入了一种新的决策过程模型来解决CNOP问题。该决策模型首先通过生成新的备选解来扩大搜索空间,其次考虑了进化过程中违反系统约束的风险,从而提高了探索能力,降低了过早收敛的风险;而通过在生成的备选解决方案中采取有效的选择(风险较小的解决方案)来改进开发。所提出的方法已在几个基准cnop上进行了验证。统计结果表明,新算法明显优于或至少与文献中报道的几种进化算法相竞争。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Prospect Theory in Particle Swarm Optimization for Constraints Nonlinear Optimization Problems
A swarm of individuals or particles work together to achieve a collective goal are called particle swarm optimization (PSO). However, when PSO applied to Constraints nonlinear optimization problems (CNOPs), this technique requires an efficient mechanism to handle the constraints, since it still suffers from the premature convergence problem (local minimum solution), and its inability to find a refinement solution, due to lack of exploitation and exploration capability. So that to deal with the above issues, a novel model of decision-making process has been used in PSO to solve the CNOP. This decision model improves the exploration hence, reduce the risk of premature convergence, by firstly, expanding the search space through generating new alternative solutions and secondly, factoring the risk of violating system constraints during the evolutionary process; while the exploitation has been improved through taking an effective choice (less risky solution) among the generated alternative solutions. The validation of the proposed approach has been performed on several benchmarks CNOPs. The statistical results demonstrate that the new algorithm considerably better than or at least competitive to several evolutionary algorithms reported in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信