Search NASA⌕ Search

Engineering topics

Coffrin, Carleton (ORCID:0000000332381699)

Publications and source records attributed to Coffrin, Carleton (ORCID:0000000332381699).

9 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 2

The ARPA-E Grid Optimization (GO) Competition Challenge 2, from 2020 to 2021, expanded upon the problem posed in Challenge 1 by adding adjustable transformer tap ratios, phase shifting transformers, switchable shunts, price-responsive demand, ramp rate constrained generators and loads, and fast-start unit commitment. Furthermore, Challenge 2 was a maximization problem while Challenge 1 was a minimization problem. Specifically, the economic surplus, defined as the benefit of serving load minus the cost of generation, is being maximized. It was expected that the objective value of a given solution should be positive, representing economic gain, but negative objectives from poor solutions were possible. The two code submission feature of Challenge 1 was maintained. Additionally, Divisions 3 and 4 within the competition permitted on/off switching of transmission lines (Divisions 1 and 2 did not). After the initial release of the Problem Formulation on 7/20/2020, ARPA-E Director Lane Genatowski announced Challenge 2 on 9/12/2020. The final May 31, 2021, version of the Problem Formulation was 97 pages long with 299 equations. The Challenge proceeded with 2 non-prize Events and 2 prize Events. Teams receiving Challenge 1 FOA awards and prize money were required to use the prize money to fund their Challenge 2 efforts (Georgia Institute of Technology, Global Optimal Technology, Inc., Lawrence Livermore National Laboratory, Lehigh University, Northwestern University, Artelys, Columbia, Pearl Street Technologies, Pennsylvania State University, and University of Colorado Boulder). For more information on the competition and challenge 2 see the "GO Competition Challenge 2 Information" resource below. Challenge 1 and Challenge 3 information can be found in the resources linked below.

ACOPF↗
DOE OSTI2024

On the emerging potential of quantum annealing hardware for combinatorial optimization

Abstract Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 3

Synthetic Input Data and Team Results for the GO Competition Challenge 3 for Events 1 - 4 and the Sandbox, along with problem and format descriptions and code to validate data and solutions, are available here. Data for industry scenarios will not be made public. 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. 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. In Event 4, whose submission window was August 31-September 4, 2023, 14 teams solved for the objective values of 669 scenarios (39 scenarios required solutions both with and without line switching being allowed). The 591 synthetic scenarios from 9 network models (3.6 GB) are available here. Ten teams were funded to participate and 7 won prizes totaling $2,400,000. The largest prize ($550,000) went to Mississippi State University. An additional $600,000 was awarded in Event 3 (6/15-16/2023). No prizes were awarded in Events 1 (1/25-27/2023) or 2 (4/13-14/2023). For more information on the competition and challenge see the "GO Competition Challenge 3 Information" resource below.

ACOPF↗
DOE OSTI2020

The potential of quantum annealing for rapid solution structure identification

Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.

97 MATHEMATICS AND COMPUTING↗