Multi-population artificial bee colony algorithm for many-objective cascade reservoir scheduling

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Shuai Wang, Hui Wang, Futao Liao, Zichen Wei, Min Hu
{"title":"Multi-population artificial bee colony algorithm for many-objective cascade reservoir scheduling","authors":"Shuai Wang,&nbsp;Hui Wang,&nbsp;Futao Liao,&nbsp;Zichen Wei,&nbsp;Min Hu","doi":"10.1002/cpe.8221","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Artificial bee colony (ABC) is a popular intelligent algorithm that is widely applied to many optimization problems. However, it is challenging for ABC to solve many-objective optimization problems (MaOPs). To tackle this issue, this article proposes a many-objective ABC based on multi-population (called MMaOABC) for MaOPs. In MMaOABC, the population is divided into multiple sub-populations, and each sub-population optimizes one objective. Three search strategies are constructed based on multiple sub-populations to improve convergence and diversity. In the employed bee stage, some excellent solutions in multiple sub-populations are used to guide the convergence. In the onlooker bee stage, new selection probabilities based on diversity metrics are designed to enhance the diversity. Dimensional learning is introduced in the scout bee stage to avoid falling into local minimum. In addition, environmental selection and external archives are utilized for communications among sub-populations. To validate the performance of MMaOABC, two benchmark sets (DTLZ and MaF) with 3, 5, 8, and 15 objectives are tested. Computational results show that MMaOABC is competitive when compared with seven other many-objective evolutionary algorithms (MaOEAs). Finally, MMaOABC is applied to many-objective cascade reservoir scheduling. Simulation results show that MMaOABC still obtains promising performance.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8221","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Artificial bee colony (ABC) is a popular intelligent algorithm that is widely applied to many optimization problems. However, it is challenging for ABC to solve many-objective optimization problems (MaOPs). To tackle this issue, this article proposes a many-objective ABC based on multi-population (called MMaOABC) for MaOPs. In MMaOABC, the population is divided into multiple sub-populations, and each sub-population optimizes one objective. Three search strategies are constructed based on multiple sub-populations to improve convergence and diversity. In the employed bee stage, some excellent solutions in multiple sub-populations are used to guide the convergence. In the onlooker bee stage, new selection probabilities based on diversity metrics are designed to enhance the diversity. Dimensional learning is introduced in the scout bee stage to avoid falling into local minimum. In addition, environmental selection and external archives are utilized for communications among sub-populations. To validate the performance of MMaOABC, two benchmark sets (DTLZ and MaF) with 3, 5, 8, and 15 objectives are tested. Computational results show that MMaOABC is competitive when compared with seven other many-objective evolutionary algorithms (MaOEAs). Finally, MMaOABC is applied to many-objective cascade reservoir scheduling. Simulation results show that MMaOABC still obtains promising performance.

多目标级联水库调度的多群体人工蜂群算法
摘要 人工蜂群(ABC)是一种流行的智能算法,被广泛应用于许多优化问题。然而,要解决多目标优化问题(MaOPs)对人工蜂群来说是一个挑战。为了解决这个问题,本文提出了一种基于多群体的多目标 ABC(称为 MMaOABC)来解决 MaOPs。在 MMaOABC 中,种群被分为多个子种群,每个子种群优化一个目标。为了提高收敛性和多样性,基于多个子群构建了三种搜索策略。在受雇蜜蜂阶段,利用多个子群中的一些优秀解来引导收敛。在观察蜂阶段,设计了基于多样性指标的新选择概率,以提高多样性。在侦察蜂阶段引入了维度学习,以避免陷入局部最小值。此外,还利用环境选择和外部档案进行子群之间的交流。为了验证 MMaOABC 的性能,测试了两个基准集(DTLZ 和 MaF),目标分别为 3、5、8 和 15。计算结果表明,与其他七种多目标进化算法(MaOEAs)相比,MMaOABC具有很强的竞争力。最后,MMaOABC 被应用于多目标级联水库调度。仿真结果表明,MMaOABC仍然获得了可喜的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信