Adaptive multi-strategy particle swarm optimization for solving NP-hard optimization problems

IF 0.6 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE International Journal of Knowledge-Based and Intelligent Engineering Systems Pub Date : 2023-12-21 DOI:10.3233/kes-230137
Houda Abadlia, Imhamed R. Belhassen, Nadia Smairi
{"title":"Adaptive multi-strategy particle swarm optimization for solving NP-hard optimization problems","authors":"Houda Abadlia, Imhamed R. Belhassen, Nadia Smairi","doi":"10.3233/kes-230137","DOIUrl":null,"url":null,"abstract":"Particle Swarm Optimization algorithm (PSO) has been widely utilized for addressing optimization problems due to its straightforward implementation and efficiency in tackling various test functions and engineering optimization problems. Nevertheless, PSO encounters issues like premature convergence and a lack of diversity, particularly when confronted with complex high-dimensional optimization tasks. In this study, we propose an enhanced version of the Island Model Particle Swarm Optimization (IMPSO), where island models are integrated into the PSO algorithm based on several migration strategies. The first contribution consists in applying a new selection and replacement strategies based on tabu search technique, while the second contribution consists in proposing a dynamic migration rate relying on the Biogeography-Based Optimization technique. To assess and validate the effectiveness of the proposed method, several unconstrained benchmark functions are applied. The obtained results confirm that the approach yield better performance than the old version of IMPSO for solving NP-hard optimization problems. Compared to the performance of other well-known evolutionary algorithms, the proposed approach is more efficient and effective.","PeriodicalId":44076,"journal":{"name":"International Journal of Knowledge-Based and Intelligent Engineering Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Knowledge-Based and Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/kes-230137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Particle Swarm Optimization algorithm (PSO) has been widely utilized for addressing optimization problems due to its straightforward implementation and efficiency in tackling various test functions and engineering optimization problems. Nevertheless, PSO encounters issues like premature convergence and a lack of diversity, particularly when confronted with complex high-dimensional optimization tasks. In this study, we propose an enhanced version of the Island Model Particle Swarm Optimization (IMPSO), where island models are integrated into the PSO algorithm based on several migration strategies. The first contribution consists in applying a new selection and replacement strategies based on tabu search technique, while the second contribution consists in proposing a dynamic migration rate relying on the Biogeography-Based Optimization technique. To assess and validate the effectiveness of the proposed method, several unconstrained benchmark functions are applied. The obtained results confirm that the approach yield better performance than the old version of IMPSO for solving NP-hard optimization problems. Compared to the performance of other well-known evolutionary algorithms, the proposed approach is more efficient and effective.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于解决 NP 难优化问题的自适应多策略粒子群优化法
粒子群优化算法(PSO)因其实施简单、处理各种测试功能和工程优化问题的效率高而被广泛用于解决优化问题。然而,PSO 会遇到过早收敛和缺乏多样性等问题,尤其是在面对复杂的高维优化任务时。在本研究中,我们提出了岛屿模型粒子群优化(IMPSO)的增强版,根据几种迁移策略将岛屿模型集成到 PSO 算法中。第一个贡献在于应用了基于塔布搜索技术的新选择和替换策略,第二个贡献在于提出了基于生物地理学优化技术的动态迁移率。为了评估和验证所提方法的有效性,应用了几个无约束基准函数。结果证实,在解决 NP 难优化问题时,该方法比旧版 IMPSO 性能更好。与其他著名的进化算法相比,所提出的方法更加高效和有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.10
自引率
0.00%
发文量
22
期刊最新文献
On the optimal multi-objective design of fractional order PID controller with antlion optimization Eternal 1-security number of a fuzzy graph with level J Interval type-2 fuzzy approach for retinopathy detection in fundus images DeepGAN: Utilizing generative adversarial networks for improved deep learning Fast retrieval of multi-modal embeddings for e-commerce applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1