Transmission Network Expansion Planning Considering Uncertainty in Demand with Global and Nodal Approach

IF 1.3 4区 工程技术 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Latin America Transactions Pub Date : 2024-10-04 DOI:10.1109/TLA.2024.10705973
Nestor Gonzalez-Cabrera;Daniel Ernesto Hernandez Reyes;Vicente Torres García
{"title":"Transmission Network Expansion Planning Considering Uncertainty in Demand with Global and Nodal Approach","authors":"Nestor Gonzalez-Cabrera;Daniel Ernesto Hernandez Reyes;Vicente Torres García","doi":"10.1109/TLA.2024.10705973","DOIUrl":null,"url":null,"abstract":"Transmission expansion planning aims to establish when and where to install new infrastructure such as transmission lines, cables, generators and transformers in the electrical power system. The planning must be motivated mainly to satisfy the increase in demand, consequently increase the reliability of the system and provide non-discriminatory access for generators and consumers to the electrical grid. In this sense, this work aims to propose a methodology to handle demand uncertainty by reducing scenarios through the K-means clustering algorithm, which is used to construct representative demand curves that allow using a static model of stochastic linear optimization with less computational effort, which seeks to minimize the investment and operating costs of the electrical system, meeting the total demand of the system. The global demand and nodal demand approach of the system is compared, observing the behaviour of investment and operating costs, as well as their advantages. The results demonstrate that the formulation can be estimate the number of scenarios through mathematical metrics and the global demand approach has the advantage of only needing data on the behavior of the total demand of the system.","PeriodicalId":55024,"journal":{"name":"IEEE Latin America Transactions","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10705973","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Latin America Transactions","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10705973/","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Transmission expansion planning aims to establish when and where to install new infrastructure such as transmission lines, cables, generators and transformers in the electrical power system. The planning must be motivated mainly to satisfy the increase in demand, consequently increase the reliability of the system and provide non-discriminatory access for generators and consumers to the electrical grid. In this sense, this work aims to propose a methodology to handle demand uncertainty by reducing scenarios through the K-means clustering algorithm, which is used to construct representative demand curves that allow using a static model of stochastic linear optimization with less computational effort, which seeks to minimize the investment and operating costs of the electrical system, meeting the total demand of the system. The global demand and nodal demand approach of the system is compared, observing the behaviour of investment and operating costs, as well as their advantages. The results demonstrate that the formulation can be estimate the number of scenarios through mathematical metrics and the global demand approach has the advantage of only needing data on the behavior of the total demand of the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑需求不确定性的输电网络扩建规划与全局和节点方法
输电扩展规划旨在确定何时何地在电力系统中安装新的基础设施,如输电线路、电缆、发电机和变压器。规划的主要目的必须是满足需求的增长,从而提高系统的可靠性,并为发电机和用户提供无差别的电网接入。从这个意义上说,这项工作旨在提出一种方法,通过 K-means 聚类算法来减少各种情况,从而处理需求的不确定性。K-means 聚类算法用于构建有代表性的需求曲线,从而可以使用随机线性优化的静态模型,并减少计算量,从而最大限度地降低电力系统的投资和运营成本,满足系统的总需求。对系统的全局需求和节点需求方法进行了比较,观察了投资和运营成本的表现及其优势。结果表明,该方案可以通过数学指标来估算方案数量,而全局需求法的优势在于只需要系统总需求行为的数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Latin America Transactions
IEEE Latin America Transactions COMPUTER SCIENCE, INFORMATION SYSTEMS-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
3.50
自引率
7.70%
发文量
192
审稿时长
3-8 weeks
期刊介绍: IEEE Latin America Transactions (IEEE LATAM) is an interdisciplinary journal focused on the dissemination of original and quality research papers / review articles in Spanish and Portuguese of emerging topics in three main areas: Computing, Electric Energy and Electronics. Some of the sub-areas of the journal are, but not limited to: Automatic control, communications, instrumentation, artificial intelligence, power and industrial electronics, fault diagnosis and detection, transportation electrification, internet of things, electrical machines, circuits and systems, biomedicine and biomedical / haptic applications, secure communications, robotics, sensors and actuators, computer networks, smart grids, among others.
期刊最新文献
Mathematical Modeling for Pectin Extraction in Melon waste Impact of the Extreme Operating Gusts on Power Converter Connected to PMSG-based Wind Turbine for Reliability Analysis Comparative Study of Tire Models Applied to Electronic Stability Control in Automotive Simulator IoT-based Environmental Monitoring and Prediction of Banana Moisture Content in a Solar Greenhouse Dryer Learnable Query Contrast and Spatio-temporal Prediction on Point Cloud Video Pre-training
×
引用
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