Transmission Congestion Management via Node-Breaker Topology Control

A novel topology control algorithm is proposed here to reduce congestion and overloads, thereby improving security margins in a power network. The proposed heuristic relies on normalized squares of the line currents as a direct indicator of transmission line loading. The sensitivity of this measure...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE systems journal 2023-09, Vol.17 (3), p.1-12
Hauptverfasser: Babaeinejadsarookolaee, Sogol, Park, Byungkwon, Lesieutre, Bernard, DeMarco, Christopher L.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 12
container_issue 3
container_start_page 1
container_title IEEE systems journal
container_volume 17
creator Babaeinejadsarookolaee, Sogol
Park, Byungkwon
Lesieutre, Bernard
DeMarco, Christopher L.
description A novel topology control algorithm is proposed here to reduce congestion and overloads, thereby improving security margins in a power network. The proposed heuristic relies on normalized squares of the line currents as a direct indicator of transmission line loading. The sensitivity of this measure with respect to breaker positions forms the basis of the proposed heuristic to select switching actions for a reconfigured network topology that reduces the congestion and overloads while holding generation dispatch essentially fixed. While many prior works have examined this class of problem for line switching actions (i.e., topology changes that insert or remove branches), bus-bar switching actions (topology changes that merge or split nodes/buses) have received less research focus. Here, both line switching and bus-bar switching are implemented using a detailed node-breaker representation of the network. The algorithm adopts a novel form of the AC power flow that allows sparse calculation and reduced computation time. Case studies demonstrate that the proposed approach efficiently reduces congestion and overloads in the base case and in contingency situations.
doi_str_mv 10.1109/JSYST.2023.3241805
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_osti_scitechconnect_2418398</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10059000</ieee_id><sourcerecordid>2858748381</sourcerecordid><originalsourceid>FETCH-LOGICAL-c323t-8b7ba74ede086cb3c423ce0f4e4da3a07ed65e2272ee9468bebaf3594fa569633</originalsourceid><addsrcrecordid>eNpNkDtPwzAUhS0EEqXwBxBDBHOKn4k9QnmrwNAwMFmOc1NSWrvYKVL_PUnbgeme4TtX5xyEzgkeEYLV9cv0c1qMKKZsxCgnEosDNCCK5amijB9uNU0lkfwYncQ4x1hIkasBuiuCcXHZxNh4l4y9m0Fse_lqnJnBElyb_DYmefMVpLcBzDeEpPArv_CzTc-3wS9O0VFtFhHO9neIPh7ui_FTOnl_fB7fTFLLKGtTWealyTlUgGVmS2Y5ZRZwzYFXhhmcQ5UJoDSnAIpnsoTS1EwoXhuRqYyxIbrc_fVdRh1t04L9st45sK3uazMlO-hqB62C_1l3bfTcr4Prcmkqhcy5ZJJ0FN1RNvgYA9R6FZqlCRtNsO4n1dtJdT-p3k_amS52pgYA_hmwUBhj9gfc1XLY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2858748381</pqid></control><display><type>article</type><title>Transmission Congestion Management via Node-Breaker Topology Control</title><source>IEEE Electronic Library (IEL)</source><creator>Babaeinejadsarookolaee, Sogol ; Park, Byungkwon ; Lesieutre, Bernard ; DeMarco, Christopher L.</creator><creatorcontrib>Babaeinejadsarookolaee, Sogol ; Park, Byungkwon ; Lesieutre, Bernard ; DeMarco, Christopher L. ; Univ. of Wisconsin, Madison, WI (United States)</creatorcontrib><description>A novel topology control algorithm is proposed here to reduce congestion and overloads, thereby improving security margins in a power network. The proposed heuristic relies on normalized squares of the line currents as a direct indicator of transmission line loading. The sensitivity of this measure with respect to breaker positions forms the basis of the proposed heuristic to select switching actions for a reconfigured network topology that reduces the congestion and overloads while holding generation dispatch essentially fixed. While many prior works have examined this class of problem for line switching actions (i.e., topology changes that insert or remove branches), bus-bar switching actions (topology changes that merge or split nodes/buses) have received less research focus. Here, both line switching and bus-bar switching are implemented using a detailed node-breaker representation of the network. The algorithm adopts a novel form of the AC power flow that allows sparse calculation and reduced computation time. Case studies demonstrate that the proposed approach efficiently reduces congestion and overloads in the base case and in contingency situations.</description><identifier>ISSN: 1932-8184</identifier><identifier>EISSN: 1937-9234</identifier><identifier>DOI: 10.1109/JSYST.2023.3241805</identifier><identifier>CODEN: ISJEB2</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Computer Science ; Congestion ; Congestion management ; Contingency ; Control algorithms ; Control theory ; Engineering ; Heuristic ; Mathematical models ; Network topologies ; Network topology ; node-breaker model ; Operations Research &amp; Management Science ; Optimization ; Overloading ; Power flow ; substation reconfiguration ; Switches ; Switching ; Telecommunications ; Topology ; Transient analysis ; Transmission lines ; transmission topology control ; Voltage control</subject><ispartof>IEEE systems journal, 2023-09, Vol.17 (3), p.1-12</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c323t-8b7ba74ede086cb3c423ce0f4e4da3a07ed65e2272ee9468bebaf3594fa569633</citedby><cites>FETCH-LOGICAL-c323t-8b7ba74ede086cb3c423ce0f4e4da3a07ed65e2272ee9468bebaf3594fa569633</cites><orcidid>0000-0003-3189-816X ; 0000-0002-0234-8022 ; 0000-0002-8817-9804 ; 0000000288179804 ; 0000000202348022 ; 000000033189816X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10059000$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,780,784,796,885,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10059000$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.osti.gov/biblio/2418398$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Babaeinejadsarookolaee, Sogol</creatorcontrib><creatorcontrib>Park, Byungkwon</creatorcontrib><creatorcontrib>Lesieutre, Bernard</creatorcontrib><creatorcontrib>DeMarco, Christopher L.</creatorcontrib><creatorcontrib>Univ. of Wisconsin, Madison, WI (United States)</creatorcontrib><title>Transmission Congestion Management via Node-Breaker Topology Control</title><title>IEEE systems journal</title><addtitle>JSYST</addtitle><description>A novel topology control algorithm is proposed here to reduce congestion and overloads, thereby improving security margins in a power network. The proposed heuristic relies on normalized squares of the line currents as a direct indicator of transmission line loading. The sensitivity of this measure with respect to breaker positions forms the basis of the proposed heuristic to select switching actions for a reconfigured network topology that reduces the congestion and overloads while holding generation dispatch essentially fixed. While many prior works have examined this class of problem for line switching actions (i.e., topology changes that insert or remove branches), bus-bar switching actions (topology changes that merge or split nodes/buses) have received less research focus. Here, both line switching and bus-bar switching are implemented using a detailed node-breaker representation of the network. The algorithm adopts a novel form of the AC power flow that allows sparse calculation and reduced computation time. Case studies demonstrate that the proposed approach efficiently reduces congestion and overloads in the base case and in contingency situations.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Congestion</subject><subject>Congestion management</subject><subject>Contingency</subject><subject>Control algorithms</subject><subject>Control theory</subject><subject>Engineering</subject><subject>Heuristic</subject><subject>Mathematical models</subject><subject>Network topologies</subject><subject>Network topology</subject><subject>node-breaker model</subject><subject>Operations Research &amp; Management Science</subject><subject>Optimization</subject><subject>Overloading</subject><subject>Power flow</subject><subject>substation reconfiguration</subject><subject>Switches</subject><subject>Switching</subject><subject>Telecommunications</subject><subject>Topology</subject><subject>Transient analysis</subject><subject>Transmission lines</subject><subject>transmission topology control</subject><subject>Voltage control</subject><issn>1932-8184</issn><issn>1937-9234</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkDtPwzAUhS0EEqXwBxBDBHOKn4k9QnmrwNAwMFmOc1NSWrvYKVL_PUnbgeme4TtX5xyEzgkeEYLV9cv0c1qMKKZsxCgnEosDNCCK5amijB9uNU0lkfwYncQ4x1hIkasBuiuCcXHZxNh4l4y9m0Fse_lqnJnBElyb_DYmefMVpLcBzDeEpPArv_CzTc-3wS9O0VFtFhHO9neIPh7ui_FTOnl_fB7fTFLLKGtTWealyTlUgGVmS2Y5ZRZwzYFXhhmcQ5UJoDSnAIpnsoTS1EwoXhuRqYyxIbrc_fVdRh1t04L9st45sK3uazMlO-hqB62C_1l3bfTcr4Prcmkqhcy5ZJJ0FN1RNvgYA9R6FZqlCRtNsO4n1dtJdT-p3k_amS52pgYA_hmwUBhj9gfc1XLY</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Babaeinejadsarookolaee, Sogol</creator><creator>Park, Byungkwon</creator><creator>Lesieutre, Bernard</creator><creator>DeMarco, Christopher L.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>OTOTI</scope><orcidid>https://orcid.org/0000-0003-3189-816X</orcidid><orcidid>https://orcid.org/0000-0002-0234-8022</orcidid><orcidid>https://orcid.org/0000-0002-8817-9804</orcidid><orcidid>https://orcid.org/0000000288179804</orcidid><orcidid>https://orcid.org/0000000202348022</orcidid><orcidid>https://orcid.org/000000033189816X</orcidid></search><sort><creationdate>20230901</creationdate><title>Transmission Congestion Management via Node-Breaker Topology Control</title><author>Babaeinejadsarookolaee, Sogol ; Park, Byungkwon ; Lesieutre, Bernard ; DeMarco, Christopher L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c323t-8b7ba74ede086cb3c423ce0f4e4da3a07ed65e2272ee9468bebaf3594fa569633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Congestion</topic><topic>Congestion management</topic><topic>Contingency</topic><topic>Control algorithms</topic><topic>Control theory</topic><topic>Engineering</topic><topic>Heuristic</topic><topic>Mathematical models</topic><topic>Network topologies</topic><topic>Network topology</topic><topic>node-breaker model</topic><topic>Operations Research &amp; Management Science</topic><topic>Optimization</topic><topic>Overloading</topic><topic>Power flow</topic><topic>substation reconfiguration</topic><topic>Switches</topic><topic>Switching</topic><topic>Telecommunications</topic><topic>Topology</topic><topic>Transient analysis</topic><topic>Transmission lines</topic><topic>transmission topology control</topic><topic>Voltage control</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Babaeinejadsarookolaee, Sogol</creatorcontrib><creatorcontrib>Park, Byungkwon</creatorcontrib><creatorcontrib>Lesieutre, Bernard</creatorcontrib><creatorcontrib>DeMarco, Christopher L.</creatorcontrib><creatorcontrib>Univ. of Wisconsin, Madison, WI (United States)</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>OSTI.GOV</collection><jtitle>IEEE systems journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Babaeinejadsarookolaee, Sogol</au><au>Park, Byungkwon</au><au>Lesieutre, Bernard</au><au>DeMarco, Christopher L.</au><aucorp>Univ. of Wisconsin, Madison, WI (United States)</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Transmission Congestion Management via Node-Breaker Topology Control</atitle><jtitle>IEEE systems journal</jtitle><stitle>JSYST</stitle><date>2023-09-01</date><risdate>2023</risdate><volume>17</volume><issue>3</issue><spage>1</spage><epage>12</epage><pages>1-12</pages><issn>1932-8184</issn><eissn>1937-9234</eissn><coden>ISJEB2</coden><abstract>A novel topology control algorithm is proposed here to reduce congestion and overloads, thereby improving security margins in a power network. The proposed heuristic relies on normalized squares of the line currents as a direct indicator of transmission line loading. The sensitivity of this measure with respect to breaker positions forms the basis of the proposed heuristic to select switching actions for a reconfigured network topology that reduces the congestion and overloads while holding generation dispatch essentially fixed. While many prior works have examined this class of problem for line switching actions (i.e., topology changes that insert or remove branches), bus-bar switching actions (topology changes that merge or split nodes/buses) have received less research focus. Here, both line switching and bus-bar switching are implemented using a detailed node-breaker representation of the network. The algorithm adopts a novel form of the AC power flow that allows sparse calculation and reduced computation time. Case studies demonstrate that the proposed approach efficiently reduces congestion and overloads in the base case and in contingency situations.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSYST.2023.3241805</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0003-3189-816X</orcidid><orcidid>https://orcid.org/0000-0002-0234-8022</orcidid><orcidid>https://orcid.org/0000-0002-8817-9804</orcidid><orcidid>https://orcid.org/0000000288179804</orcidid><orcidid>https://orcid.org/0000000202348022</orcidid><orcidid>https://orcid.org/000000033189816X</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1932-8184
ispartof IEEE systems journal, 2023-09, Vol.17 (3), p.1-12
issn 1932-8184
1937-9234
language eng
recordid cdi_osti_scitechconnect_2418398
source IEEE Electronic Library (IEL)
subjects Algorithms
Computer Science
Congestion
Congestion management
Contingency
Control algorithms
Control theory
Engineering
Heuristic
Mathematical models
Network topologies
Network topology
node-breaker model
Operations Research & Management Science
Optimization
Overloading
Power flow
substation reconfiguration
Switches
Switching
Telecommunications
Topology
Transient analysis
Transmission lines
transmission topology control
Voltage control
title Transmission Congestion Management via Node-Breaker Topology Control
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T19%3A35%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Transmission%20Congestion%20Management%20via%20Node-Breaker%20Topology%20Control&rft.jtitle=IEEE%20systems%20journal&rft.au=Babaeinejadsarookolaee,%20Sogol&rft.aucorp=Univ.%20of%20Wisconsin,%20Madison,%20WI%20(United%20States)&rft.date=2023-09-01&rft.volume=17&rft.issue=3&rft.spage=1&rft.epage=12&rft.pages=1-12&rft.issn=1932-8184&rft.eissn=1937-9234&rft.coden=ISJEB2&rft_id=info:doi/10.1109/JSYST.2023.3241805&rft_dat=%3Cproquest_RIE%3E2858748381%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2858748381&rft_id=info:pmid/&rft_ieee_id=10059000&rfr_iscdi=true