Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids
Tie-line scheduling (TS) becomes a practical need for growing interconnection of regional power grids and the increasing integration of renewable energy. In electricity markets without a coordination organization, TS should be handled in a fully decentralized manner, where the impact of contingencie...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on power systems 2017-01, Vol.32 (1), p.354-367 |
|---|---|
| Hauptverfasser: | , , , , |
| 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 | 367 |
|---|---|
| container_issue | 1 |
| container_start_page | 354 |
| container_title | IEEE transactions on power systems |
| container_volume | 32 |
| creator | Zhigang Li Wenchuan Wu Bo Zeng Shahidehpour, Mohammad Boming Zhang |
| description | Tie-line scheduling (TS) becomes a practical need for growing interconnection of regional power grids and the increasing integration of renewable energy. In electricity markets without a coordination organization, TS should be handled in a fully decentralized manner, where the impact of contingencies should also be considered for operational reliability. In this paper, the contingency-constrained TS (CCTS) problem is formulated using a two-stage robust optimization (RO) scheme to consider the N-k security criterion. This robust model is decomposed and handled by the alternating direction multiplier method (ADMM) in a fully decentralized way, where the column-and-constraint generation (C&CG) is incorporated to solve the regional robust subproblems. Three computational strategies are also developed to enhance the computation efficiency of the decentralized algorithm. Numerical simulations are given to study the computational performance, the solution quality, and scalability of the proposed method. |
| doi_str_mv | 10.1109/TPWRS.2016.2539278 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TPWRS_2016_2539278</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7438936</ieee_id><sourcerecordid>1856391791</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-77dfb051ebe821dbfd01513a4281873be905554cc0cc48144c9c3c55553001443</originalsourceid><addsrcrecordid>eNo9UF1LwzAUDaLgnP4BfSn4nHnTNG3yOKZOYeJwFR9Dm95qRm1n0iLz15u54dM993zcC4eQSwYTxkDd5Mu3l9UkBpZOYsFVnMkjMmJCSApppo7JCKQUVCoBp-TM-zUApEEYkfwWDba9Kxr7g1U069retu_Ymi0N2AfBtoHPLdJFQNHKfGA1NMET1Z2Lnoamt3TqsIiW3Te6aO5s5c_JSV00Hi8Oc0xe7-_y2QNdPM8fZ9MFNbESPc2yqi5BMCxRxqwq6wqYYLxIYslkxktUIIRIjAFjEsmSxCjDTaAEBwgrH5Pr_d2N674G9L1ed4Nrw0vNpEi5YpliwRXvXcZ13jus9cbZz8JtNQO9a0__tad37elDeyF0tQ9ZRPwPZAmXiqf8F98gavo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1856391791</pqid></control><display><type>article</type><title>Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids</title><source>IEEE Electronic Library (IEL)</source><creator>Zhigang Li ; Wenchuan Wu ; Bo Zeng ; Shahidehpour, Mohammad ; Boming Zhang</creator><creatorcontrib>Zhigang Li ; Wenchuan Wu ; Bo Zeng ; Shahidehpour, Mohammad ; Boming Zhang</creatorcontrib><description>Tie-line scheduling (TS) becomes a practical need for growing interconnection of regional power grids and the increasing integration of renewable energy. In electricity markets without a coordination organization, TS should be handled in a fully decentralized manner, where the impact of contingencies should also be considered for operational reliability. In this paper, the contingency-constrained TS (CCTS) problem is formulated using a two-stage robust optimization (RO) scheme to consider the N-k security criterion. This robust model is decomposed and handled by the alternating direction multiplier method (ADMM) in a fully decentralized way, where the column-and-constraint generation (C&CG) is incorporated to solve the regional robust subproblems. Three computational strategies are also developed to enhance the computation efficiency of the decentralized algorithm. Numerical simulations are given to study the computational performance, the solution quality, and scalability of the proposed method.</description><identifier>ISSN: 0885-8950</identifier><identifier>EISSN: 1558-0679</identifier><identifier>DOI: 10.1109/TPWRS.2016.2539278</identifier><identifier>CODEN: ITPSEG</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Computational modeling ; Constraints ; Contingency ; Contingency scheduling ; Convergence ; distributed optimization ; Electric power grids ; Mathematical models ; Multi-area power grid ; Optimization ; Power system reliability ; Regional development ; Robustness ; Robustness (mathematics) ; Scheduling ; Security ; security-constrained economic dispatch ; tie-line scheduling</subject><ispartof>IEEE transactions on power systems, 2017-01, Vol.32 (1), p.354-367</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-77dfb051ebe821dbfd01513a4281873be905554cc0cc48144c9c3c55553001443</citedby><cites>FETCH-LOGICAL-c295t-77dfb051ebe821dbfd01513a4281873be905554cc0cc48144c9c3c55553001443</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7438936$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7438936$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhigang Li</creatorcontrib><creatorcontrib>Wenchuan Wu</creatorcontrib><creatorcontrib>Bo Zeng</creatorcontrib><creatorcontrib>Shahidehpour, Mohammad</creatorcontrib><creatorcontrib>Boming Zhang</creatorcontrib><title>Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids</title><title>IEEE transactions on power systems</title><addtitle>TPWRS</addtitle><description>Tie-line scheduling (TS) becomes a practical need for growing interconnection of regional power grids and the increasing integration of renewable energy. In electricity markets without a coordination organization, TS should be handled in a fully decentralized manner, where the impact of contingencies should also be considered for operational reliability. In this paper, the contingency-constrained TS (CCTS) problem is formulated using a two-stage robust optimization (RO) scheme to consider the N-k security criterion. This robust model is decomposed and handled by the alternating direction multiplier method (ADMM) in a fully decentralized way, where the column-and-constraint generation (C&CG) is incorporated to solve the regional robust subproblems. Three computational strategies are also developed to enhance the computation efficiency of the decentralized algorithm. Numerical simulations are given to study the computational performance, the solution quality, and scalability of the proposed method.</description><subject>Algorithms</subject><subject>Computational modeling</subject><subject>Constraints</subject><subject>Contingency</subject><subject>Contingency scheduling</subject><subject>Convergence</subject><subject>distributed optimization</subject><subject>Electric power grids</subject><subject>Mathematical models</subject><subject>Multi-area power grid</subject><subject>Optimization</subject><subject>Power system reliability</subject><subject>Regional development</subject><subject>Robustness</subject><subject>Robustness (mathematics)</subject><subject>Scheduling</subject><subject>Security</subject><subject>security-constrained economic dispatch</subject><subject>tie-line scheduling</subject><issn>0885-8950</issn><issn>1558-0679</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9UF1LwzAUDaLgnP4BfSn4nHnTNG3yOKZOYeJwFR9Dm95qRm1n0iLz15u54dM993zcC4eQSwYTxkDd5Mu3l9UkBpZOYsFVnMkjMmJCSApppo7JCKQUVCoBp-TM-zUApEEYkfwWDba9Kxr7g1U069retu_Ymi0N2AfBtoHPLdJFQNHKfGA1NMET1Z2Lnoamt3TqsIiW3Te6aO5s5c_JSV00Hi8Oc0xe7-_y2QNdPM8fZ9MFNbESPc2yqi5BMCxRxqwq6wqYYLxIYslkxktUIIRIjAFjEsmSxCjDTaAEBwgrH5Pr_d2N674G9L1ed4Nrw0vNpEi5YpliwRXvXcZ13jus9cbZz8JtNQO9a0__tad37elDeyF0tQ9ZRPwPZAmXiqf8F98gavo</recordid><startdate>201701</startdate><enddate>201701</enddate><creator>Zhigang Li</creator><creator>Wenchuan Wu</creator><creator>Bo Zeng</creator><creator>Shahidehpour, Mohammad</creator><creator>Boming Zhang</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>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope><scope>L7M</scope></search><sort><creationdate>201701</creationdate><title>Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids</title><author>Zhigang Li ; Wenchuan Wu ; Bo Zeng ; Shahidehpour, Mohammad ; Boming Zhang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-77dfb051ebe821dbfd01513a4281873be905554cc0cc48144c9c3c55553001443</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Computational modeling</topic><topic>Constraints</topic><topic>Contingency</topic><topic>Contingency scheduling</topic><topic>Convergence</topic><topic>distributed optimization</topic><topic>Electric power grids</topic><topic>Mathematical models</topic><topic>Multi-area power grid</topic><topic>Optimization</topic><topic>Power system reliability</topic><topic>Regional development</topic><topic>Robustness</topic><topic>Robustness (mathematics)</topic><topic>Scheduling</topic><topic>Security</topic><topic>security-constrained economic dispatch</topic><topic>tie-line scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhigang Li</creatorcontrib><creatorcontrib>Wenchuan Wu</creatorcontrib><creatorcontrib>Bo Zeng</creatorcontrib><creatorcontrib>Shahidehpour, Mohammad</creatorcontrib><creatorcontrib>Boming Zhang</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>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on power systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhigang Li</au><au>Wenchuan Wu</au><au>Bo Zeng</au><au>Shahidehpour, Mohammad</au><au>Boming Zhang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids</atitle><jtitle>IEEE transactions on power systems</jtitle><stitle>TPWRS</stitle><date>2017-01</date><risdate>2017</risdate><volume>32</volume><issue>1</issue><spage>354</spage><epage>367</epage><pages>354-367</pages><issn>0885-8950</issn><eissn>1558-0679</eissn><coden>ITPSEG</coden><abstract>Tie-line scheduling (TS) becomes a practical need for growing interconnection of regional power grids and the increasing integration of renewable energy. In electricity markets without a coordination organization, TS should be handled in a fully decentralized manner, where the impact of contingencies should also be considered for operational reliability. In this paper, the contingency-constrained TS (CCTS) problem is formulated using a two-stage robust optimization (RO) scheme to consider the N-k security criterion. This robust model is decomposed and handled by the alternating direction multiplier method (ADMM) in a fully decentralized way, where the column-and-constraint generation (C&CG) is incorporated to solve the regional robust subproblems. Three computational strategies are also developed to enhance the computation efficiency of the decentralized algorithm. Numerical simulations are given to study the computational performance, the solution quality, and scalability of the proposed method.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPWRS.2016.2539278</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0885-8950 |
| ispartof | IEEE transactions on power systems, 2017-01, Vol.32 (1), p.354-367 |
| issn | 0885-8950 1558-0679 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TPWRS_2016_2539278 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Computational modeling Constraints Contingency Contingency scheduling Convergence distributed optimization Electric power grids Mathematical models Multi-area power grid Optimization Power system reliability Regional development Robustness Robustness (mathematics) Scheduling Security security-constrained economic dispatch tie-line scheduling |
| title | Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T00%3A49%3A00IST&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=Decentralized%20Contingency-Constrained%20Tie-Line%20Scheduling%20for%20Multi-Area%20Power%20Grids&rft.jtitle=IEEE%20transactions%20on%20power%20systems&rft.au=Zhigang%20Li&rft.date=2017-01&rft.volume=32&rft.issue=1&rft.spage=354&rft.epage=367&rft.pages=354-367&rft.issn=0885-8950&rft.eissn=1558-0679&rft.coden=ITPSEG&rft_id=info:doi/10.1109/TPWRS.2016.2539278&rft_dat=%3Cproquest_RIE%3E1856391791%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=1856391791&rft_id=info:pmid/&rft_ieee_id=7438936&rfr_iscdi=true |