同时考虑机组承诺问题的输电网扩容规划

S. Golestani, M. Tadayon, Ali M. Pirbazari
{"title":"同时考虑机组承诺问题的输电网扩容规划","authors":"S. Golestani, M. Tadayon, Ali M. Pirbazari","doi":"10.1109/ISGTEUROPE.2010.5638905","DOIUrl":null,"url":null,"abstract":"Transmission Network Expansion Planning (TNEP) is an important part of power system planning in new structured power market. Its goal is to minimize the network construction and operational cost while satisfying the demand increase, considering technical and economic conditions. Since change in Unit Commitment (UC), influences transmission lines, this paper presents an Integer Coded Genetic Algorithm (ICGA) to solve both problems together. Genetic algorithm can consider all generation and network constraints. Also random behavior of genetic algorithm can simulate real probabilities such as uncertainty in generation. Considering uncertainty for some units, in each iteration, it can find out the probability of congestion for each line. After all iterations it can highlight the transmission lines which need expansion, because of high congestion probability. Simulation results of the proposed idea are presented for IEEE30-bus network.","PeriodicalId":267185,"journal":{"name":"2010 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Transmission network expansion planning considering unit commitment problem simultaneously\",\"authors\":\"S. Golestani, M. Tadayon, Ali M. Pirbazari\",\"doi\":\"10.1109/ISGTEUROPE.2010.5638905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transmission Network Expansion Planning (TNEP) is an important part of power system planning in new structured power market. Its goal is to minimize the network construction and operational cost while satisfying the demand increase, considering technical and economic conditions. Since change in Unit Commitment (UC), influences transmission lines, this paper presents an Integer Coded Genetic Algorithm (ICGA) to solve both problems together. Genetic algorithm can consider all generation and network constraints. Also random behavior of genetic algorithm can simulate real probabilities such as uncertainty in generation. Considering uncertainty for some units, in each iteration, it can find out the probability of congestion for each line. After all iterations it can highlight the transmission lines which need expansion, because of high congestion probability. Simulation results of the proposed idea are presented for IEEE30-bus network.\",\"PeriodicalId\":267185,\"journal\":{\"name\":\"2010 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISGTEUROPE.2010.5638905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISGTEUROPE.2010.5638905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

输电网扩容规划是新结构电力市场中电力系统规划的重要组成部分。其目标是在满足需求增长的同时,兼顾技术经济条件,使网络建设和运营成本最小化。由于单位承诺(UC)的变化会影响传输线,本文提出了一种整数编码遗传算法(ICGA)来共同解决这两个问题。遗传算法可以考虑所有的生成约束和网络约束。此外,遗传算法的随机行为可以模拟实际的概率,如不确定性的产生。考虑到某些单元的不确定性,在每次迭代中,它可以找出每条线路的拥塞概率。由于拥塞概率高,迭代后可以突出需要扩展的传输线。在ieee30总线网络中给出了该方法的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transmission network expansion planning considering unit commitment problem simultaneously
Transmission Network Expansion Planning (TNEP) is an important part of power system planning in new structured power market. Its goal is to minimize the network construction and operational cost while satisfying the demand increase, considering technical and economic conditions. Since change in Unit Commitment (UC), influences transmission lines, this paper presents an Integer Coded Genetic Algorithm (ICGA) to solve both problems together. Genetic algorithm can consider all generation and network constraints. Also random behavior of genetic algorithm can simulate real probabilities such as uncertainty in generation. Considering uncertainty for some units, in each iteration, it can find out the probability of congestion for each line. After all iterations it can highlight the transmission lines which need expansion, because of high congestion probability. Simulation results of the proposed idea are presented for IEEE30-bus network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信