基于改进粒子群算法求解约束优化问题

Chaoli Sun, J. Zeng, S. Chu, J. Roddick, Jeng-Shyang Pan
{"title":"基于改进粒子群算法求解约束优化问题","authors":"Chaoli Sun, J. Zeng, S. Chu, J. Roddick, Jeng-Shyang Pan","doi":"10.1109/IBICA.2011.35","DOIUrl":null,"url":null,"abstract":"Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Solving Constrained Optimization Problems by an Improved Particle Swarm Optimization\",\"authors\":\"Chaoli Sun, J. Zeng, S. Chu, J. Roddick, Jeng-Shyang Pan\",\"doi\":\"10.1109/IBICA.2011.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive.\",\"PeriodicalId\":158080,\"journal\":{\"name\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IBICA.2011.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBICA.2011.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

约束优化问题构成了实际应用程序的很大一部分。这类问题的解决已逐渐引起人们的重视。针对约束优化问题,提出了一种基于可行性规则的改进粒子群优化算法(IPSO)。在算法中引入了影响粒子飞行方向的平均速度和粒子在邻域的最佳历史位置这两个湍流因素,使算法不会过早收敛。在13个知名的基准函数上测试了IPSO算法的性能。实验结果表明,本文提出的IPSO算法简单、有效,具有较强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Solving Constrained Optimization Problems by an Improved Particle Swarm Optimization
Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信