基于改进JAYA算法的最优无功调度

T. Das, R. Roy, K. Mandal
{"title":"基于改进JAYA算法的最优无功调度","authors":"T. Das, R. Roy, K. Mandal","doi":"10.1109/ICCECE48148.2020.9223111","DOIUrl":null,"url":null,"abstract":"One of the most commonly used optimization problem in power system is the optimal reactive power dispatch (ORPD) problem. It is a non-linear and complex optimization problem, which helps in achieving a more economic and secure operation of the system. The problem formulated a single-objective problem and is used to solve two different objective functions separately. The solution is to obtain the optimal values of the control variables to minimize the active power loss and the total voltage deviation of the system. In this paper, the modified JAYA (MJAYA) algorithm has been used to solve the ORPD problem. This algorithm is the modified version of the JAYA algorithm having better convergence compared to the latter. The proposed algorithm was tested on IEEE 14 and 57 bus system for solving the ORPD problem. The results were compared with those from many other widely used distinguished algorithms. The comparisons show the dominance of the MJAYA algorithm over the others in terms of its success in optimizing the objective functions and obtaining the best solutions to the ORPD problem.","PeriodicalId":129001,"journal":{"name":"2020 International Conference on Computer, Electrical & Communication Engineering (ICCECE)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal Reactive Power Dispatch based on Modified JAYA Algorithm\",\"authors\":\"T. Das, R. Roy, K. Mandal\",\"doi\":\"10.1109/ICCECE48148.2020.9223111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most commonly used optimization problem in power system is the optimal reactive power dispatch (ORPD) problem. It is a non-linear and complex optimization problem, which helps in achieving a more economic and secure operation of the system. The problem formulated a single-objective problem and is used to solve two different objective functions separately. The solution is to obtain the optimal values of the control variables to minimize the active power loss and the total voltage deviation of the system. In this paper, the modified JAYA (MJAYA) algorithm has been used to solve the ORPD problem. This algorithm is the modified version of the JAYA algorithm having better convergence compared to the latter. The proposed algorithm was tested on IEEE 14 and 57 bus system for solving the ORPD problem. The results were compared with those from many other widely used distinguished algorithms. The comparisons show the dominance of the MJAYA algorithm over the others in terms of its success in optimizing the objective functions and obtaining the best solutions to the ORPD problem.\",\"PeriodicalId\":129001,\"journal\":{\"name\":\"2020 International Conference on Computer, Electrical & Communication Engineering (ICCECE)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Computer, Electrical & Communication Engineering (ICCECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCECE48148.2020.9223111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Computer, Electrical & Communication Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE48148.2020.9223111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

电力系统中最常用的优化问题之一是最优无功调度问题。这是一个非线性、复杂的优化问题,它有助于实现系统更经济、更安全的运行。该问题是一个单目标问题,用于分别求解两个不同的目标函数。其解决方法是求出控制变量的最优值,使系统的有功功率损耗和总电压偏差最小。本文采用改进的JAYA (MJAYA)算法求解ORPD问题。该算法是JAYA算法的改进版,收敛性优于后者。该算法在ieee14和ieee57总线系统上进行了测试,用于解决ORPD问题。结果与许多其他广泛使用的区分算法进行了比较。比较表明,MJAYA算法在优化目标函数和获得ORPD问题的最优解方面优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Reactive Power Dispatch based on Modified JAYA Algorithm
One of the most commonly used optimization problem in power system is the optimal reactive power dispatch (ORPD) problem. It is a non-linear and complex optimization problem, which helps in achieving a more economic and secure operation of the system. The problem formulated a single-objective problem and is used to solve two different objective functions separately. The solution is to obtain the optimal values of the control variables to minimize the active power loss and the total voltage deviation of the system. In this paper, the modified JAYA (MJAYA) algorithm has been used to solve the ORPD problem. This algorithm is the modified version of the JAYA algorithm having better convergence compared to the latter. The proposed algorithm was tested on IEEE 14 and 57 bus system for solving the ORPD problem. The results were compared with those from many other widely used distinguished algorithms. The comparisons show the dominance of the MJAYA algorithm over the others in terms of its success in optimizing the objective functions and obtaining the best solutions to the 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学术官方微信