求解多目标ORPD问题的改进Jaya优化算法(EJOA)

A. Barakat, R. El-Sehiemy, Mohamed I. Elsayd, E. Osman
{"title":"求解多目标ORPD问题的改进Jaya优化算法(EJOA)","authors":"A. Barakat, R. El-Sehiemy, Mohamed I. Elsayd, E. Osman","doi":"10.1109/ITCE.2019.8646363","DOIUrl":null,"url":null,"abstract":"this article presents an enhanced Jaya optimization algorithm (EJOA) for solving a multi objective function (MOF) of the optimal reactive power dispatch (ORPD) problem. This solution aims to determine the optimal scheduling of control variables to achieve the ORPD primary objectives as well as respecting equality and inequality constrains. This problem is concerned with minimizing the real power losses (PL) and voltage deviation (VD) in power systems. The ORPD problem can be formulated as a non-linear and complex framework. The MOF is dependent on a combination of weighted sum method and fuzzy logic to find the best compromise solution of the competitive objective functions (COFs). For proving the effectiveness of the proposed EJOA, two test systems, IEEE 30-bus system and the network of west delta as a real system (WDRN), are used to prove the capability of the proposed Jaya algorithm with weight sum method and fuzzy member ship for solving a multi-objective ORPD problem. The obtained results confirm that the proposed Jaya algorithm is an effective tool that can makes a noticeable enhancement on solving ORPD problem.","PeriodicalId":391488,"journal":{"name":"2019 International Conference on Innovative Trends in Computer Engineering (ITCE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An Enhanced Jaya Optimization Algorithm (EJOA) for Solving Multi-Objective ORPD Problem\",\"authors\":\"A. Barakat, R. El-Sehiemy, Mohamed I. Elsayd, E. Osman\",\"doi\":\"10.1109/ITCE.2019.8646363\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"this article presents an enhanced Jaya optimization algorithm (EJOA) for solving a multi objective function (MOF) of the optimal reactive power dispatch (ORPD) problem. This solution aims to determine the optimal scheduling of control variables to achieve the ORPD primary objectives as well as respecting equality and inequality constrains. This problem is concerned with minimizing the real power losses (PL) and voltage deviation (VD) in power systems. The ORPD problem can be formulated as a non-linear and complex framework. The MOF is dependent on a combination of weighted sum method and fuzzy logic to find the best compromise solution of the competitive objective functions (COFs). For proving the effectiveness of the proposed EJOA, two test systems, IEEE 30-bus system and the network of west delta as a real system (WDRN), are used to prove the capability of the proposed Jaya algorithm with weight sum method and fuzzy member ship for solving a multi-objective ORPD problem. The obtained results confirm that the proposed Jaya algorithm is an effective tool that can makes a noticeable enhancement on solving ORPD problem.\",\"PeriodicalId\":391488,\"journal\":{\"name\":\"2019 International Conference on Innovative Trends in Computer Engineering (ITCE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Innovative Trends in Computer Engineering (ITCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCE.2019.8646363\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Innovative Trends in Computer Engineering (ITCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCE.2019.8646363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文提出了一种改进的Jaya优化算法(EJOA),用于求解最优无功调度(ORPD)问题的多目标函数问题。该解决方案旨在确定控制变量的最优调度,以实现ORPD的主要目标,并尊重相等和不等式约束。该问题涉及到电力系统中实际功率损耗(PL)和电压偏差(VD)的最小化。ORPD问题可以表述为一个非线性的复杂框架。该算法采用加权和法和模糊逻辑相结合的方法来寻找竞争目标函数的最佳妥协解。为了证明所提出的EJOA算法的有效性,用IEEE 30总线系统和西部三角洲作为一个实际系统的网络(WDRN)两个测试系统验证了所提出的Jaya算法的权值和模糊隶属关系算法求解多目标ORPD问题的能力。实验结果表明,Jaya算法是解决ORPD问题的有效工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Enhanced Jaya Optimization Algorithm (EJOA) for Solving Multi-Objective ORPD Problem
this article presents an enhanced Jaya optimization algorithm (EJOA) for solving a multi objective function (MOF) of the optimal reactive power dispatch (ORPD) problem. This solution aims to determine the optimal scheduling of control variables to achieve the ORPD primary objectives as well as respecting equality and inequality constrains. This problem is concerned with minimizing the real power losses (PL) and voltage deviation (VD) in power systems. The ORPD problem can be formulated as a non-linear and complex framework. The MOF is dependent on a combination of weighted sum method and fuzzy logic to find the best compromise solution of the competitive objective functions (COFs). For proving the effectiveness of the proposed EJOA, two test systems, IEEE 30-bus system and the network of west delta as a real system (WDRN), are used to prove the capability of the proposed Jaya algorithm with weight sum method and fuzzy member ship for solving a multi-objective ORPD problem. The obtained results confirm that the proposed Jaya algorithm is an effective tool that can makes a noticeable enhancement on solving ORPD problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信