Internally Induced Branch-and-Cut Acceleration for Unit Commitment Based on Improvement of Upper Bound

Abstract

In this letter, we present an internally induced acceleration method for the branch-and-cut (B&C) process of unit commitment (UC) problem on the basis of general mixed-integer programming (MIP) solvers. The B&C process is internally guided by solving a small-scale induced MIP model formulated by combining the congestion management information with global upper and lower bounds. Based on the test cases of RTS-GMLC and practical utility data, the UC calculation can be accelerated by 2.29 and 2.06 times on average, respectively, with no influence on the solution optimality.