Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms
This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algo...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on power systems 2012-08, Vol.27 (3), p.1459-1466 |
|---|---|
| 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 | 1466 |
|---|---|
| container_issue | 3 |
| container_start_page | 1459 |
| container_title | IEEE transactions on power systems |
| container_volume | 27 |
| creator | Marano-Marcolini, Alejandro Capitanescu, Florin Martinez-Ramos, Jose Luis Wehenkel, Louis |
| description | This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algorithm thanks to a more efficient identification of binding contingencies and allows improving the objective by an appropriate choice of a limited number of corrective actions for each contingency. The proposed approach is illustrated on five test systems of 60, 118, 300, 1203, and 2746 buses. |
| doi_str_mv | 10.1109/TPWRS.2012.2186469 |
| format | Article |
| fullrecord | <record><control><sourceid>liege_RIE</sourceid><recordid>TN_cdi_ieee_primary_6165680</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6165680</ieee_id><sourcerecordid>oai_orbi_ulg_ac_be_2268_111427</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-fcf851f13251c8f44109aefa9b394839fc588962fbcbc4add32930cf77f1d05f3</originalsourceid><addsrcrecordid>eNo9kF9PwjAUxRujiYh-AX3pFxj2z9q1j2SCkpBABOJjs5V21Ay6dJPgt7c4wtM9Off-bnIOAM8YjTBG8nW9_PpcjQjCZESw4CmXN2CAGRMJ4pm8BQMkBEuEZOgePLTtN0KIx8UAbCanpvauc4cKdjsDN62B3sK3HK7yxXIKx00T_Mnti875A-w8nO2jcTRw1pkQzajG19u68sF1u337CO5sUbfm6TKHYDOdrPOPZL54n-XjeaIpY11itRUMW0wJw1rYNI1RCmMLWVKZCiqtZkJITmypS50W2y0lkiJts8ziLWKWDgHt_9bOVEb5UDp1JMoXrtc_daUKrUqjCOFCYYxTkkWK9JQOvm2DsaoJMWH4VRipc53qv051rlNd6ozQSw85Y8wV4JgzLhD9A3spcKs</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms</title><source>IEEE Electronic Library (IEL)</source><creator>Marano-Marcolini, Alejandro ; Capitanescu, Florin ; Martinez-Ramos, Jose Luis ; Wehenkel, Louis</creator><creatorcontrib>Marano-Marcolini, Alejandro ; Capitanescu, Florin ; Martinez-Ramos, Jose Luis ; Wehenkel, Louis</creatorcontrib><description>This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algorithm thanks to a more efficient identification of binding contingencies and allows improving the objective by an appropriate choice of a limited number of corrective actions for each contingency. The proposed approach is illustrated on five test systems of 60, 118, 300, 1203, and 2746 buses.</description><identifier>ISSN: 0885-8950</identifier><identifier>EISSN: 1558-0679</identifier><identifier>DOI: 10.1109/TPWRS.2012.2186469</identifier><identifier>CODEN: ITPSEG</identifier><language>eng</language><publisher>IEEE</publisher><subject>Approximation algorithms ; Benchmark testing ; Contingency filtering ; DC approximation ; Electrical & electronics engineering ; energy ; Engineering, computing & technology ; Generators ; Ingénierie électrique & électronique ; Ingénierie, informatique & technologie ; Iterative algorithms ; Linear programming ; mixed-integer linear programming ; mixed-integer linear programming (MILP) ; nonlinear programming ; Power systems ; security-constrained optimal power flow ; security-constrained optimal power flow (SCOPF)</subject><ispartof>IEEE transactions on power systems, 2012-08, Vol.27 (3), p.1459-1466</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-fcf851f13251c8f44109aefa9b394839fc588962fbcbc4add32930cf77f1d05f3</citedby><cites>FETCH-LOGICAL-c355t-fcf851f13251c8f44109aefa9b394839fc588962fbcbc4add32930cf77f1d05f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6165680$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,776,780,792,881,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6165680$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Marano-Marcolini, Alejandro</creatorcontrib><creatorcontrib>Capitanescu, Florin</creatorcontrib><creatorcontrib>Martinez-Ramos, Jose Luis</creatorcontrib><creatorcontrib>Wehenkel, Louis</creatorcontrib><title>Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms</title><title>IEEE transactions on power systems</title><addtitle>TPWRS</addtitle><description>This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algorithm thanks to a more efficient identification of binding contingencies and allows improving the objective by an appropriate choice of a limited number of corrective actions for each contingency. The proposed approach is illustrated on five test systems of 60, 118, 300, 1203, and 2746 buses.</description><subject>Approximation algorithms</subject><subject>Benchmark testing</subject><subject>Contingency filtering</subject><subject>DC approximation</subject><subject>Electrical & electronics engineering</subject><subject>energy</subject><subject>Engineering, computing & technology</subject><subject>Generators</subject><subject>Ingénierie électrique & électronique</subject><subject>Ingénierie, informatique & technologie</subject><subject>Iterative algorithms</subject><subject>Linear programming</subject><subject>mixed-integer linear programming</subject><subject>mixed-integer linear programming (MILP)</subject><subject>nonlinear programming</subject><subject>Power systems</subject><subject>security-constrained optimal power flow</subject><subject>security-constrained optimal power flow (SCOPF)</subject><issn>0885-8950</issn><issn>1558-0679</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF9PwjAUxRujiYh-AX3pFxj2z9q1j2SCkpBABOJjs5V21Ay6dJPgt7c4wtM9Off-bnIOAM8YjTBG8nW9_PpcjQjCZESw4CmXN2CAGRMJ4pm8BQMkBEuEZOgePLTtN0KIx8UAbCanpvauc4cKdjsDN62B3sK3HK7yxXIKx00T_Mnti875A-w8nO2jcTRw1pkQzajG19u68sF1u337CO5sUbfm6TKHYDOdrPOPZL54n-XjeaIpY11itRUMW0wJw1rYNI1RCmMLWVKZCiqtZkJITmypS50W2y0lkiJts8ziLWKWDgHt_9bOVEb5UDp1JMoXrtc_daUKrUqjCOFCYYxTkkWK9JQOvm2DsaoJMWH4VRipc53qv051rlNd6ozQSw85Y8wV4JgzLhD9A3spcKs</recordid><startdate>20120801</startdate><enddate>20120801</enddate><creator>Marano-Marcolini, Alejandro</creator><creator>Capitanescu, Florin</creator><creator>Martinez-Ramos, Jose Luis</creator><creator>Wehenkel, Louis</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>Q33</scope></search><sort><creationdate>20120801</creationdate><title>Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms</title><author>Marano-Marcolini, Alejandro ; Capitanescu, Florin ; Martinez-Ramos, Jose Luis ; Wehenkel, Louis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-fcf851f13251c8f44109aefa9b394839fc588962fbcbc4add32930cf77f1d05f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Approximation algorithms</topic><topic>Benchmark testing</topic><topic>Contingency filtering</topic><topic>DC approximation</topic><topic>Electrical & electronics engineering</topic><topic>energy</topic><topic>Engineering, computing & technology</topic><topic>Generators</topic><topic>Ingénierie électrique & électronique</topic><topic>Ingénierie, informatique & technologie</topic><topic>Iterative algorithms</topic><topic>Linear programming</topic><topic>mixed-integer linear programming</topic><topic>mixed-integer linear programming (MILP)</topic><topic>nonlinear programming</topic><topic>Power systems</topic><topic>security-constrained optimal power flow</topic><topic>security-constrained optimal power flow (SCOPF)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Marano-Marcolini, Alejandro</creatorcontrib><creatorcontrib>Capitanescu, Florin</creatorcontrib><creatorcontrib>Martinez-Ramos, Jose Luis</creatorcontrib><creatorcontrib>Wehenkel, Louis</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>Université de Liège - Open Repository and Bibliography (ORBI)</collection><jtitle>IEEE transactions on power systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Marano-Marcolini, Alejandro</au><au>Capitanescu, Florin</au><au>Martinez-Ramos, Jose Luis</au><au>Wehenkel, Louis</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms</atitle><jtitle>IEEE transactions on power systems</jtitle><stitle>TPWRS</stitle><date>2012-08-01</date><risdate>2012</risdate><volume>27</volume><issue>3</issue><spage>1459</spage><epage>1466</epage><pages>1459-1466</pages><issn>0885-8950</issn><eissn>1558-0679</eissn><coden>ITPSEG</coden><abstract>This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algorithm thanks to a more efficient identification of binding contingencies and allows improving the objective by an appropriate choice of a limited number of corrective actions for each contingency. The proposed approach is illustrated on five test systems of 60, 118, 300, 1203, and 2746 buses.</abstract><pub>IEEE</pub><doi>10.1109/TPWRS.2012.2186469</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0885-8950 |
| ispartof | IEEE transactions on power systems, 2012-08, Vol.27 (3), p.1459-1466 |
| issn | 0885-8950 1558-0679 |
| language | eng |
| recordid | cdi_ieee_primary_6165680 |
| source | IEEE Electronic Library (IEL) |
| subjects | Approximation algorithms Benchmark testing Contingency filtering DC approximation Electrical & electronics engineering energy Engineering, computing & technology Generators Ingénierie électrique & électronique Ingénierie, informatique & technologie Iterative algorithms Linear programming mixed-integer linear programming mixed-integer linear programming (MILP) nonlinear programming Power systems security-constrained optimal power flow security-constrained optimal power flow (SCOPF) |
| title | Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T11%3A51%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-liege_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Exploiting%20the%20Use%20of%20DC%20SCOPF%20Approximation%20to%20Improve%20Iterative%20AC%20SCOPF%20Algorithms&rft.jtitle=IEEE%20transactions%20on%20power%20systems&rft.au=Marano-Marcolini,%20Alejandro&rft.date=2012-08-01&rft.volume=27&rft.issue=3&rft.spage=1459&rft.epage=1466&rft.pages=1459-1466&rft.issn=0885-8950&rft.eissn=1558-0679&rft.coden=ITPSEG&rft_id=info:doi/10.1109/TPWRS.2012.2186469&rft_dat=%3Cliege_RIE%3Eoai_orbi_ulg_ac_be_2268_111427%3C/liege_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6165680&rfr_iscdi=true |