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 |
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.
|