基于人工智能的无功功率优化调度技术:当代调查、实验与分析

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Mohamed Abdel-Basset, Reda Mohamed, Ibrahim M. Hezam, Karam M. Sallam, Ahmad M. Alshamrani, Ibrahim A. Hameed
{"title":"基于人工智能的无功功率优化调度技术:当代调查、实验与分析","authors":"Mohamed Abdel-Basset,&nbsp;Reda Mohamed,&nbsp;Ibrahim M. Hezam,&nbsp;Karam M. Sallam,&nbsp;Ahmad M. Alshamrani,&nbsp;Ibrahim A. Hameed","doi":"10.1007/s10462-024-10982-1","DOIUrl":null,"url":null,"abstract":"<div><p>The optimization challenge known as the optimal reactive power dispatch (ORPD) problem is of utmost importance in the electric power system owing to its substantial impact on stability, cost-effectiveness, and security. Several metaheuristic algorithms have been developed to address this challenge, but they all suffer from either being stuck in local minima, having an insufficiently fast convergence rate, or having a prohibitively high computational cost. Therefore, in this study, the performance of four recently published metaheuristic algorithms, namely the mantis search algorithm (MSA), spider wasp optimizer (SWO), nutcracker optimization algorithm (NOA), and artificial gorilla optimizer (GTO), is assessed to solve this problem with the purpose of minimizing power losses and voltage deviation. These algorithms were chosen due to the robustness of their local optimality avoidance and convergence speed acceleration mechanisms. In addition, a modified variant of NOA, known as MNOA, is herein proposed to further improve its performance. This modified variant does not combine the information of the newly generated solution with the current solution to avoid falling into local minima and accelerate the convergence speed. However, MNOA still needs further improvement to strengthen its performance for large-scale problems, so it is integrated with a newly proposed improvement mechanism to promote its exploration and exploitation operators; this hybrid variant was called HNOA. These proposed algorithms are used to estimate potential solutions to the ORPD problem in small-scale, medium-scale, and large-scale systems and are being tested and validated on the IEEE 14-bus, IEEE 39-bus, IEEE 57-bus, IEEE 118-bus, and IEEE 300-bus electrical power systems. In comparison to eight rival optimizers, HNOA is superior for large-scale systems (IEEE 118-bus and 300-bus systems) at optimizing power losses and voltage deviation; MNOA performs better for medium-scale systems (IEEE 57-bus); and MSA excels for small-scale systems (IEEE 14-bus and 39-bus systems).</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 1","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-10982-1.pdf","citationCount":"0","resultStr":"{\"title\":\"Artificial intelligence-based optimization techniques for optimal reactive power dispatch problem: a contemporary survey, experiments, and analysis\",\"authors\":\"Mohamed Abdel-Basset,&nbsp;Reda Mohamed,&nbsp;Ibrahim M. Hezam,&nbsp;Karam M. Sallam,&nbsp;Ahmad M. Alshamrani,&nbsp;Ibrahim A. Hameed\",\"doi\":\"10.1007/s10462-024-10982-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The optimization challenge known as the optimal reactive power dispatch (ORPD) problem is of utmost importance in the electric power system owing to its substantial impact on stability, cost-effectiveness, and security. Several metaheuristic algorithms have been developed to address this challenge, but they all suffer from either being stuck in local minima, having an insufficiently fast convergence rate, or having a prohibitively high computational cost. Therefore, in this study, the performance of four recently published metaheuristic algorithms, namely the mantis search algorithm (MSA), spider wasp optimizer (SWO), nutcracker optimization algorithm (NOA), and artificial gorilla optimizer (GTO), is assessed to solve this problem with the purpose of minimizing power losses and voltage deviation. These algorithms were chosen due to the robustness of their local optimality avoidance and convergence speed acceleration mechanisms. In addition, a modified variant of NOA, known as MNOA, is herein proposed to further improve its performance. This modified variant does not combine the information of the newly generated solution with the current solution to avoid falling into local minima and accelerate the convergence speed. However, MNOA still needs further improvement to strengthen its performance for large-scale problems, so it is integrated with a newly proposed improvement mechanism to promote its exploration and exploitation operators; this hybrid variant was called HNOA. These proposed algorithms are used to estimate potential solutions to the ORPD problem in small-scale, medium-scale, and large-scale systems and are being tested and validated on the IEEE 14-bus, IEEE 39-bus, IEEE 57-bus, IEEE 118-bus, and IEEE 300-bus electrical power systems. In comparison to eight rival optimizers, HNOA is superior for large-scale systems (IEEE 118-bus and 300-bus systems) at optimizing power losses and voltage deviation; MNOA performs better for medium-scale systems (IEEE 57-bus); and MSA excels for small-scale systems (IEEE 14-bus and 39-bus systems).</p></div>\",\"PeriodicalId\":8449,\"journal\":{\"name\":\"Artificial Intelligence Review\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":10.7000,\"publicationDate\":\"2024-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10462-024-10982-1.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Intelligence Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10462-024-10982-1\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-10982-1","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

最优无功功率调度(ORPD)问题对电力系统的稳定性、成本效益和安全性具有重大影响,因此是电力系统中最重要的优化挑战。目前已开发出几种元启发式算法来应对这一挑战,但它们都存在以下问题:要么陷入局部最小值,要么收敛速度不够快,要么计算成本过高。因此,在本研究中,以最小化功率损耗和电压偏差为目的,评估了最近发布的四种元启发式算法的性能,即螳螂搜索算法 (MSA)、蜘蛛黄蜂优化器 (SWO)、胡桃钳优化算法 (NOA) 和人工大猩猩优化器 (GTO)。之所以选择这些算法,是因为它们具有鲁棒性的局部最优避免和收敛速度加速机制。此外,为了进一步提高 NOA 的性能,本文还提出了 NOA 的改进变体,即 MNOA。这种改进变体不将新生成解的信息与当前解结合起来,以避免陷入局部最小值并加快收敛速度。然而,MNOA 仍需进一步改进,以加强其在大规模问题上的性能,因此将其与新提出的改进机制相结合,以促进其探索和利用算子;这种混合变体被称为 HNOA。这些提出的算法用于估算 ORPD 问题在小型、中型和大型系统中的潜在解决方案,并在 IEEE 14 总线、IEEE 39 总线、IEEE 57 总线、IEEE 118 总线和 IEEE 300 总线电力系统中进行了测试和验证。与八种竞争对手的优化器相比,HNOA 在大规模系统(IEEE 118 总线和 300 总线系统)的功率损耗和电压偏差优化方面更胜一筹;MNOA 在中型系统(IEEE 57 总线)中表现更佳;而 MSA 则在小型系统(IEEE 14 总线和 39 总线系统)中表现出色。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial intelligence-based optimization techniques for optimal reactive power dispatch problem: a contemporary survey, experiments, and analysis

The optimization challenge known as the optimal reactive power dispatch (ORPD) problem is of utmost importance in the electric power system owing to its substantial impact on stability, cost-effectiveness, and security. Several metaheuristic algorithms have been developed to address this challenge, but they all suffer from either being stuck in local minima, having an insufficiently fast convergence rate, or having a prohibitively high computational cost. Therefore, in this study, the performance of four recently published metaheuristic algorithms, namely the mantis search algorithm (MSA), spider wasp optimizer (SWO), nutcracker optimization algorithm (NOA), and artificial gorilla optimizer (GTO), is assessed to solve this problem with the purpose of minimizing power losses and voltage deviation. These algorithms were chosen due to the robustness of their local optimality avoidance and convergence speed acceleration mechanisms. In addition, a modified variant of NOA, known as MNOA, is herein proposed to further improve its performance. This modified variant does not combine the information of the newly generated solution with the current solution to avoid falling into local minima and accelerate the convergence speed. However, MNOA still needs further improvement to strengthen its performance for large-scale problems, so it is integrated with a newly proposed improvement mechanism to promote its exploration and exploitation operators; this hybrid variant was called HNOA. These proposed algorithms are used to estimate potential solutions to the ORPD problem in small-scale, medium-scale, and large-scale systems and are being tested and validated on the IEEE 14-bus, IEEE 39-bus, IEEE 57-bus, IEEE 118-bus, and IEEE 300-bus electrical power systems. In comparison to eight rival optimizers, HNOA is superior for large-scale systems (IEEE 118-bus and 300-bus systems) at optimizing power losses and voltage deviation; MNOA performs better for medium-scale systems (IEEE 57-bus); and MSA excels for small-scale systems (IEEE 14-bus and 39-bus systems).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
×
引用
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学术官方微信