一种新的拟对立Jaya算法求解最优潮流

W. Warid, H. Hizam, N. Mariun, N. A. Abdul Wahab
{"title":"一种新的拟对立Jaya算法求解最优潮流","authors":"W. Warid, H. Hizam, N. Mariun, N. A. Abdul Wahab","doi":"10.1109/ICCSE1.2018.8373995","DOIUrl":null,"url":null,"abstract":"This article introduces a new meta-heuristic algorithm, namely quasi-oppositional Jaya (QOJaya) algorithm for solving the optimal power flow (OPF) problem. In this approach, an intelligence strategy, namely quasi-oppositional based learning (QOBL) is integrated into the original Jaya algorithm to enhance its convergence rapidity and solution optimality. The suggested QOJaya algorithm to deal with single objective OPF problem is scrutinized and validated using the IEEE 30-bus test network. The obtained results reveal the supremacy of the proposed QOJaya algorithm over the basic Jaya algorithm in terms of solution quality and execution time. In addition, the results show the superiority of the proposed QOJaya algorithm over many existing heuristics optimization algorithms introduced in the literature in terms of solution feasibility and optimality.","PeriodicalId":383579,"journal":{"name":"2018 International Conference on Computing Sciences and Engineering (ICCSE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Novel Quasi-Oppositional Jaya Algorithm for Optimal Power Flow Solution\",\"authors\":\"W. Warid, H. Hizam, N. Mariun, N. A. Abdul Wahab\",\"doi\":\"10.1109/ICCSE1.2018.8373995\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article introduces a new meta-heuristic algorithm, namely quasi-oppositional Jaya (QOJaya) algorithm for solving the optimal power flow (OPF) problem. In this approach, an intelligence strategy, namely quasi-oppositional based learning (QOBL) is integrated into the original Jaya algorithm to enhance its convergence rapidity and solution optimality. The suggested QOJaya algorithm to deal with single objective OPF problem is scrutinized and validated using the IEEE 30-bus test network. The obtained results reveal the supremacy of the proposed QOJaya algorithm over the basic Jaya algorithm in terms of solution quality and execution time. In addition, the results show the superiority of the proposed QOJaya algorithm over many existing heuristics optimization algorithms introduced in the literature in terms of solution feasibility and optimality.\",\"PeriodicalId\":383579,\"journal\":{\"name\":\"2018 International Conference on Computing Sciences and Engineering (ICCSE)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Computing Sciences and Engineering (ICCSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE1.2018.8373995\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Computing Sciences and Engineering (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE1.2018.8373995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种求解最优潮流问题的元启发式算法——准对偶Jaya (QOJaya)算法。该方法在原有的Jaya算法中加入了一种智能策略,即准对立学习(quasi- positional - based learning, QOBL),提高了算法的收敛速度和解的最优性。提出的QOJaya算法处理单目标OPF问题,并在IEEE 30总线测试网络上进行了验证。结果表明,本文提出的QOJaya算法在解质量和执行时间上优于基本的Jaya算法。此外,结果表明,所提出的QOJaya算法在解的可行性和最优性方面优于文献中引入的许多现有启发式优化算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Quasi-Oppositional Jaya Algorithm for Optimal Power Flow Solution
This article introduces a new meta-heuristic algorithm, namely quasi-oppositional Jaya (QOJaya) algorithm for solving the optimal power flow (OPF) problem. In this approach, an intelligence strategy, namely quasi-oppositional based learning (QOBL) is integrated into the original Jaya algorithm to enhance its convergence rapidity and solution optimality. The suggested QOJaya algorithm to deal with single objective OPF problem is scrutinized and validated using the IEEE 30-bus test network. The obtained results reveal the supremacy of the proposed QOJaya algorithm over the basic Jaya algorithm in terms of solution quality and execution time. In addition, the results show the superiority of the proposed QOJaya algorithm over many existing heuristics optimization algorithms introduced in the literature in terms of solution feasibility and optimality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信