Challenge 3
The Grid Optimization (GO) Competition Challenge 3 started on December 8, 2022, with the opening of Sandbox submissions of S0 datasets. The first Event took place at the end of January 2023, the second Event took place in April 2023, the third Event took place in June 2023, and the fourth and final Event took place in September 2023. Prizes were awarded in Events 3 and 4.
The Grid Optimization (GO) Competition Challenge 3 focused on the security-constrained optimal power flow (SCOPF) problem. It is part of a continuing effort begun with Challenges 1 and 2, to successfully discover, develop, and test innovative and disruptive software solutions for critical energy challenges and to overcome existing barriers. The broader goal of the of the GO Competition is to accelerate the development of transformational and disruptive methods for solving problems related to the electric power grid and to provide a transparent, fair, and comprehensive evaluation of new solution methods. In particular, the GO Competition seeks to identify innovative power system optimization and control methods that will accelerate the development and adoption of emerging technologies. Innovative solutions that are identified by the GO Competition will enable increased grid flexibility, reliability, and resilience while also significantly increasing energy security, providing greater energy efficiency, and substantially reducing the costs of integrating emerging technologies and resources into the electric power system in the United States.
Challenge 3 used multiperiod dynamic markets, including advisory models for extreme weather events, day-ahead markets, and the real-time markets with an extended look-ahead. These problems included active bid-in demand and topology optimization.
Problem Overview
-
Multiperiod security constrained AC unit commitment
- Applications
- Real Time look ahead UC (Scoring Division 1; 10-minute compute time limit)
- 1 to 8 hour horizon
- 5 minute to 1 hour periods
- Day ahead UC (Scoring Division 2; 120-minute compute time limit)
- 24 to 48 hour horizon
- 15 minute to 1 hour periods
- Week ahead planning UC (Scoring Division 3; 240-minute compute time limit)
- 24 to 168 hour horizon
- 1 to 6 hour periods
- Only a single, 64-core node will be used during Challenge 3. See the Evaluation Platform page for details.
- Real Time look ahead UC (Scoring Division 1; 10-minute compute time limit)
- Base case plus credible contingencies
- Nonlinear AC power flow and balance in base case
- Real and reactive power production, consumption, balance at each bus
- Voltage magnitude and angle at each bus
- Limits on bus voltage magnitude and branch apparent power flow
- Continuous approximation of transformer winding ratio and phase difference
- Discrete treatment of shunt steps
- Topology optimization
- Branch contingencies use a linear real power flow and balance model
- Security to generator contingencies and ramping events handled by a suite of reserve products
- Detailed modeling of dispatchable device characteristics
- Generator startup and shutdown
- Reactive power capability modeled with linear constraints depending on real power
- Flexible consumption modeled with same features as generators
Papers
-
GO Competition Challenge 3: Problem, Solvers, and Solution Analysis; Oh, Holzer, Mittelmann, O'Neill, and Elbert
-
Average Incremental Cost Pricing for the AC Unit Commitment Problem; Garcia and O'Neill