IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i6p1997-2014.html
   My bibliography  Save this article

Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

Author

Listed:
  • Ignacio Aravena

    (Lawrence Livermore National Laboratory, Livermore, California 94550; Teamgollnlp)

  • Daniel K. Molzahn

    (Georgia Institute of Technology, Atlanta, Georgia 30332; TeamGO-SNIP)

  • Shixuan Zhang

    (Brown University, Providence, Rhode Island 02903; Team GMI-GO)

  • Cosmin G. Petra

    (Lawrence Livermore National Laboratory, Livermore, California 94550; Teamgollnlp)

  • Frank E. Curtis

    (Lehigh University, Bethlehem, Pennsylvania 18015; TeamGO-SNIP)

  • Shenyinying Tu

    (Northwestern University, Evanston, Illinois 60208; TeamGO-SNIP)

  • Andreas Wächter

    (Northwestern University, Evanston, Illinois 60208; TeamGO-SNIP)

  • Ermin Wei

    (Northwestern University, Evanston, Illinois 60208; TeamGO-SNIP)

  • Elizabeth Wong

    (University of California, San Diego, La Jolla, California 92093; TeamGO-SNIP)

  • Amin Gholami

    (Georgia Institute of Technology, Atlanta, Georgia 30332; Team GMI-GO)

  • Kaizhao Sun

    (Alibaba Group (U.S.) Inc., Bellevue, Washington 98004; Team GMI-GO)

  • Xu Andy Sun

    (Masachusetts Institute of Technology, Cambridge, Massachusetts 02142; pTeam GMI-GO)

  • Stephen T. Elbert

    (Pacific Northwest National Laboratory, Richland, Washington 99352; Grid Optimization Competition Organization Team)

  • Jesse T. Holzer

    (Pacific Northwest National Laboratory, Richland, Washington 99352; Grid Optimization Competition Organization Team)

  • Arun Veeramany

    (Pacific Northwest National Laboratory, Richland, Washington 99352; Grid Optimization Competition Organization Team)

Abstract

The optimal power-flow problem is central to many tasks in the design and operation of electric power grids. This problem seeks the minimum-cost operating point for an electric power grid while satisfying both engineering requirements and physical laws describing how power travels through the electric network. By additionally considering the possibility of component failures and using an accurate alternating current (AC) power-flow model of the electric network, the security-constrained AC optimal power flow (SC-AC-OPF) problem is of paramount practical relevance. To assess recent progress in solution algorithms for SC-AC-OPF problems and spur new innovations, the U.S. Department of Energy’s Advanced Research Projects Agency–Energy organized Challenge 1 of the Grid Optimization (GO) competition. This special issue includes papers authored by the top three teams in Challenge 1 of the GO Competition (Teams gollnlp, GO-SNIP, and GMI-GO). To introduce these papers and provide context about the competition, this paper describes the SC-AC-OPF problem formulation used in the competition, overviews historical developments and the state of the art in SC-AC-OPF algorithms, discusses the competition, and summarizes the algorithms used by these three teams.

Suggested Citation

  • Ignacio Aravena & Daniel K. Molzahn & Shixuan Zhang & Cosmin G. Petra & Frank E. Curtis & Shenyinying Tu & Andreas Wächter & Ermin Wei & Elizabeth Wong & Amin Gholami & Kaizhao Sun & Xu Andy Sun & Ste, 2023. "Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition," Operations Research, INFORMS, vol. 71(6), pages 1997-2014, November.
    • Handle: RePEc:inm:oropre:v:71:y:2023:i:6:p:1997-2014
    DOI: 10.1287/opre.2022.0315
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.0315
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.0315?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:71:y:2023:i:6:p:1997-2014. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.