基于粒子群算法的输电约束下发电系统最优竞价策略研究

M. Mandala, C. P. Gupta
{"title":"基于粒子群算法的输电约束下发电系统最优竞价策略研究","authors":"M. Mandala, C. P. Gupta","doi":"10.1109/ISET-INDIA.2011.6145358","DOIUrl":null,"url":null,"abstract":"This paper proposes an optimal strategic bidding with transmission congestion using Particle Swarm Optimization with Time varying acceleration coefficients (PSO-TVAC). A bilevel programming (BLP) technique is formulated in which upper level problem represents an individual generating company (Genco) profit maximization and the lower level represents the independent system operator's (ISO) market clearing problem with and without transmission congestion. The values of Transmission Congestion Distribution factors (TCDFs) are used to select redispatch of generators for congestion management with and without generator reactive power procurement. Numerical result on test system IEEE 30 bus is presented for illustration purpose and the results are compared with Particle swarm optimization (PSO), Particle Swarm Optimization with Time Varying Inertia Weight (PSO-TVIW) and Particle Swarm Optimization with Time Varying acceleration coefficients (PSO-TVAC) in terms of solution quality. The comprehensive experimental results prove that the PSO-TVAC is one among the challenging optimization methods which is indeed capable of obtaining higher quality solutions for the proposed problem.","PeriodicalId":265646,"journal":{"name":"ISGT2011-India","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gencos optimal strategic bidding with transmission constraints using particle swarm optimization\",\"authors\":\"M. Mandala, C. P. Gupta\",\"doi\":\"10.1109/ISET-INDIA.2011.6145358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an optimal strategic bidding with transmission congestion using Particle Swarm Optimization with Time varying acceleration coefficients (PSO-TVAC). A bilevel programming (BLP) technique is formulated in which upper level problem represents an individual generating company (Genco) profit maximization and the lower level represents the independent system operator's (ISO) market clearing problem with and without transmission congestion. The values of Transmission Congestion Distribution factors (TCDFs) are used to select redispatch of generators for congestion management with and without generator reactive power procurement. Numerical result on test system IEEE 30 bus is presented for illustration purpose and the results are compared with Particle swarm optimization (PSO), Particle Swarm Optimization with Time Varying Inertia Weight (PSO-TVIW) and Particle Swarm Optimization with Time Varying acceleration coefficients (PSO-TVAC) in terms of solution quality. The comprehensive experimental results prove that the PSO-TVAC is one among the challenging optimization methods which is indeed capable of obtaining higher quality solutions for the proposed problem.\",\"PeriodicalId\":265646,\"journal\":{\"name\":\"ISGT2011-India\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISGT2011-India\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISET-INDIA.2011.6145358\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISGT2011-India","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISET-INDIA.2011.6145358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文利用时变加速系数粒子群算法(PSO-TVAC)提出了一种考虑传输拥塞的最优竞价策略。提出了一种双层规划(BLP)技术,其中上层问题代表单个发电公司(Genco)的利润最大化问题,下层问题代表独立系统运营商(ISO)在有无传输拥塞的情况下的市场出清问题。利用输电拥塞分配系数(TCDFs)的值来选择在有无发电机无功采购的情况下进行拥塞管理的再调度。为了说明问题,给出了测试系统ieee30总线上的数值结果,并将结果与粒子群算法(PSO)、时变惯性权重粒子群算法(PSO- tview)和时变加速度系数粒子群算法(PSO- tvac)的解质量进行了比较。综合实验结果证明,PSO-TVAC是一种具有挑战性的优化方法,确实能够为所提出的问题获得更高质量的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Gencos optimal strategic bidding with transmission constraints using particle swarm optimization
This paper proposes an optimal strategic bidding with transmission congestion using Particle Swarm Optimization with Time varying acceleration coefficients (PSO-TVAC). A bilevel programming (BLP) technique is formulated in which upper level problem represents an individual generating company (Genco) profit maximization and the lower level represents the independent system operator's (ISO) market clearing problem with and without transmission congestion. The values of Transmission Congestion Distribution factors (TCDFs) are used to select redispatch of generators for congestion management with and without generator reactive power procurement. Numerical result on test system IEEE 30 bus is presented for illustration purpose and the results are compared with Particle swarm optimization (PSO), Particle Swarm Optimization with Time Varying Inertia Weight (PSO-TVIW) and Particle Swarm Optimization with Time Varying acceleration coefficients (PSO-TVAC) in terms of solution quality. The comprehensive experimental results prove that the PSO-TVAC is one among the challenging optimization methods which is indeed capable of obtaining higher quality solutions for the proposed 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学术官方微信