多目标最优潮流问题的混合群算法

K. Rajalashmi, S. Prabha
{"title":"多目标最优潮流问题的混合群算法","authors":"K. Rajalashmi, S. Prabha","doi":"10.4236/CS.2016.711304","DOIUrl":null,"url":null,"abstract":"Optimal power flow problem \nplays a major role in the operation and planning of power systems. It assists \nin acquiring the optimized solution for the optimal power flow problem. It \nconsists of \nseveral objective functions and constraints. This paper solves the \nmultiobjective optimal power flow problem using a new hybrid technique by combining \nthe particle swarm optimization and ant colony optimization. This hybrid method overcomes the drawback in local \nsearch such as stagnation and premature convergence and also enhances the \nglobal search with chemical communication signal. The best results are \nextracted using fuzzy approach from the hybrid algorithm solution. These \nmethods have been examined with the power flow objectives such as cost, loss \nand voltage stability index by individuals and multiobjective functions. The \nproposed algorithms applied to IEEE 30 and IEEE 118-bus \ntest system and the results are analyzed and validated. The proposed algorithm \nresults record the best compromised solution with minimum execution time \ncompared with the particle swarm optimization.","PeriodicalId":63422,"journal":{"name":"电路与系统(英文)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Hybrid Swarm Algorithm for Multiobjective Optimal Power Flow Problem\",\"authors\":\"K. Rajalashmi, S. Prabha\",\"doi\":\"10.4236/CS.2016.711304\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal power flow problem \\nplays a major role in the operation and planning of power systems. It assists \\nin acquiring the optimized solution for the optimal power flow problem. It \\nconsists of \\nseveral objective functions and constraints. This paper solves the \\nmultiobjective optimal power flow problem using a new hybrid technique by combining \\nthe particle swarm optimization and ant colony optimization. This hybrid method overcomes the drawback in local \\nsearch such as stagnation and premature convergence and also enhances the \\nglobal search with chemical communication signal. The best results are \\nextracted using fuzzy approach from the hybrid algorithm solution. These \\nmethods have been examined with the power flow objectives such as cost, loss \\nand voltage stability index by individuals and multiobjective functions. The \\nproposed algorithms applied to IEEE 30 and IEEE 118-bus \\ntest system and the results are analyzed and validated. The proposed algorithm \\nresults record the best compromised solution with minimum execution time \\ncompared with the particle swarm optimization.\",\"PeriodicalId\":63422,\"journal\":{\"name\":\"电路与系统(英文)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"电路与系统(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/CS.2016.711304\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"电路与系统(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/CS.2016.711304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

最优潮流问题在电力系统的运行和规划中起着重要的作用。它有助于获得最优潮流问题的最优解。它由几个目标函数和约束组成。本文将粒子群算法与蚁群算法相结合,采用一种新的混合算法求解多目标最优潮流问题。该混合方法克服了局部搜索停滞和过早收敛等缺点,增强了利用化学通信信号进行全局搜索的能力。利用模糊方法从混合算法解中提取最佳结果。这些方法分别以成本、损耗和电压稳定指标为潮流目标,通过个体和多目标函数进行了验证。将所提出的算法应用于ieee30和ieee118总线测试系统,并对测试结果进行了分析和验证。与粒子群算法相比,该算法在最短的执行时间内记录了最佳妥协解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hybrid Swarm Algorithm for Multiobjective Optimal Power Flow Problem
Optimal power flow problem plays a major role in the operation and planning of power systems. It assists in acquiring the optimized solution for the optimal power flow problem. It consists of several objective functions and constraints. This paper solves the multiobjective optimal power flow problem using a new hybrid technique by combining the particle swarm optimization and ant colony optimization. This hybrid method overcomes the drawback in local search such as stagnation and premature convergence and also enhances the global search with chemical communication signal. The best results are extracted using fuzzy approach from the hybrid algorithm solution. These methods have been examined with the power flow objectives such as cost, loss and voltage stability index by individuals and multiobjective functions. The proposed algorithms applied to IEEE 30 and IEEE 118-bus test system and the results are analyzed and validated. The proposed algorithm results record the best compromised solution with minimum execution time compared with the particle swarm optimization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
273
期刊最新文献
Breast Cancer Detection Based on Multi-Slotted Patch Antenna at ISM Band Dual-Delay-Path Ring Oscillator with Self-Biased Delay Cells for Clock Generation Behavioral Model of Molecular Gap-Type Atomic Switches and Its SPICE Integration Ultrasound Needle Guidance System for Precision Vaccinations and Drug Deliver Drafting an Electrostatic Charge Control Plan for a Large Scale Scientific Instrument: Guidelines and a Case Study
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1