Unit Commitment Solution by Branch and Bound Algorithm

Abstract

For a short period, to obtain a secured economic dispatch of power generation, Security Constrained Unit Commitment (SCUC) is programmed to commit the units by minimizing the operating costs while maintaining the balance between supply and demand in a deregulating environment. This paper discusses a vivid planning horizon of three and six periods distributed in a day taking into account the fixed cost, variable cost, start-up and shut-down cost, ramping up and down limits, minimum and maximum power bounds, spinning reserve constraints of the units and line load abilities which are all modelled to commit the generators in binary digits only. The proposed approach applies the Branch and Bound algorithm to test the system. The iterative process will converge, if the optimal solution exists. In this paper three and six bus systems are analyzed to prove the effectiveness of this model which can be extended for larger systems too.