US 11,894,680 B2
Integrated solution techniques for security constrained unit commitment problem
Feng Pan, Sugarland, TX (US); Jesse T. Holzer, Kennewick, WA (US); Yonghong Chen, Carmel, IN (US); and Arun Veeramany, Richland, WA (US)
Assigned to Battelle Memorial Instutute, Richland, WA (US); and Midcontinent Independent System Operator, Inc., Carmel, IN (US)
Filed by Feng Pan, Sugarland, TX (US); Jesse T. Holzer, Kennewick, WA (US); Yonghong Chen, Carmel, IN (US); and Arun Veeramany, Richland, WA (US)
Filed on Mar. 15, 2019, as Appl. No. 16/355,574.
Claims priority of provisional application 62/648,659, filed on Mar. 27, 2018.
Claims priority of provisional application 62/643,843, filed on Mar. 16, 2018.
Prior Publication US 2019/0286993 A1, Sep. 19, 2019
Int. Cl. H02J 3/00 (2006.01); G06F 9/54 (2006.01); H02J 13/00 (2006.01); G06N 5/01 (2023.01)
CPC H02J 3/003 (2020.01) [G06F 9/546 (2013.01); G06N 5/01 (2023.01); H02J 3/0075 (2020.01); H02J 13/00017 (2020.01); H02J 2203/20 (2020.01)] 15 Claims
OG exemplary drawing
 
1. A method, comprising:
with a plurality of processors:
decomposing a Mixed Integer Programming (MIP) problem, the MIP problem being a Security Constrained Unit Commitment (SCUC) problem for an upcoming planning horizon of a power grid, into a plurality of subproblems; and
generating new solutions to the SCUC problem by concurrently executing a plurality of processor threads comprising at least a first thread and a second thread and sharing data generated by the concurrently executing among the threads, including having the first thread call the second thread as a subroutine to solve one of the subproblems.