A New Technique For Applying Genetic Algorithms To Power System Security Optimisation Problems

B. Nicholson, R. Dunn, K. Chan, A. R. Daniels
{"title":"A New Technique For Applying Genetic Algorithms To Power System Security Optimisation Problems","authors":"B. Nicholson, R. Dunn, K. Chan, A. R. Daniels","doi":"10.1109/EMPD.1998.702528","DOIUrl":null,"url":null,"abstract":"This aper presents a new technique for harnessing the power of Anetic Algorithms, (GA), for the optimisation of power system transient security and economy. The paper summarises the 'classical' application of GAS to the problem, and discusses a number of factors which contribute to the poor performance of the resulting optimiser, both in terms of solution quality and computational load. The main concerns raised are then addressed through a novel, mathematically justified, encoding strategy based on the implicit inclusion of important constraint equations, together with eqlicit adherence to the Building Block Theorem which has been previously offered as an important pre-requisite for the convergence of GAs[l]. One of the most important properties of the new technique is that it achieves its high performance without the need for any assumptions or ap roximations, thus guaranteeing the quality of the final sofkon. Indeed it is claimed that the reduced computational effort and improved search strategy results in the location of better solutions than those obtainable using any existing technique. However, the design of the algorithm also provides a number of routes by which auxiliary information can be incorporated at the core of the optimisation process to achieve faster convergence at the possible expense of solution quality for liations where execution time is of prime importance. %st the algorithm has been designed for fast execution on a single processor machine, significant care has been exerted to ensure that parallel implementation can be easily achieved using either distributed processing on a cluster of single-processor workstations, or an appropriate multiprocessor machine. The paper concludes by presenting comparative results for a classical GA and one based on the new technique, both applied to a small power system for which com lete knowledge of the 'best' solutions is available. &ese results clearly demonstrate the advantages of the presented method.","PeriodicalId":434526,"journal":{"name":"Proceedings of EMPD '98. 1998 International Conference on Energy Management and Power Delivery (Cat. No.98EX137)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of EMPD '98. 1998 International Conference on Energy Management and Power Delivery (Cat. No.98EX137)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPD.1998.702528","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This aper presents a new technique for harnessing the power of Anetic Algorithms, (GA), for the optimisation of power system transient security and economy. The paper summarises the 'classical' application of GAS to the problem, and discusses a number of factors which contribute to the poor performance of the resulting optimiser, both in terms of solution quality and computational load. The main concerns raised are then addressed through a novel, mathematically justified, encoding strategy based on the implicit inclusion of important constraint equations, together with eqlicit adherence to the Building Block Theorem which has been previously offered as an important pre-requisite for the convergence of GAs[l]. One of the most important properties of the new technique is that it achieves its high performance without the need for any assumptions or ap roximations, thus guaranteeing the quality of the final sofkon. Indeed it is claimed that the reduced computational effort and improved search strategy results in the location of better solutions than those obtainable using any existing technique. However, the design of the algorithm also provides a number of routes by which auxiliary information can be incorporated at the core of the optimisation process to achieve faster convergence at the possible expense of solution quality for liations where execution time is of prime importance. %st the algorithm has been designed for fast execution on a single processor machine, significant care has been exerted to ensure that parallel implementation can be easily achieved using either distributed processing on a cluster of single-processor workstations, or an appropriate multiprocessor machine. The paper concludes by presenting comparative results for a classical GA and one based on the new technique, both applied to a small power system for which com lete knowledge of the 'best' solutions is available. &ese results clearly demonstrate the advantages of the presented method.
应用遗传算法求解电力系统安全优化问题的新技术
本文提出了一种利用无源算法(GA)优化电力系统暂态安全性和经济性的新技术。本文总结了GAS在该问题上的“经典”应用,并讨论了导致优化器性能不佳的一些因素,包括解决方案质量和计算负载。提出的主要问题随后通过一种新颖的、数学上合理的编码策略来解决,该策略基于重要约束方程的隐式包含,以及对构建块定理的明确遵守,该定理先前已被作为GAs收敛的重要先决条件[1]。新技术最重要的特性之一是它无需任何假设或近似即可实现高性能,从而保证了最终软质的质量。事实上,它声称减少的计算工作量和改进的搜索策略比使用任何现有技术都能找到更好的解决方案。然而,该算法的设计还提供了许多途径,通过这些途径,辅助信息可以被纳入优化过程的核心,从而在可能牺牲解决方案质量的情况下实现更快的收敛,其中执行时间是最重要的。虽然该算法是为在单处理器机器上快速执行而设计的,但为了确保在单处理器工作站的集群或适当的多处理器机器上使用分布式处理可以轻松实现并行实现,已经进行了大量的注意。论文最后给出了经典遗传算法和基于新技术的遗传算法的比较结果,两者都应用于小型电力系统,其中“最佳”解决方案的知识是可用的。这些结果清楚地表明了所提出方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信