Transmission constrained unit commitment based on Benders decomposition

Abstract

An algorithm based on Benders decomposition is proposed for dealing with the transmission constrained unit commitment problem. Using Benders decomposition, the formulation of the unit commitment with transmission constraints is decomposed into a master problem and a subproblem. The master problem solves unit commitment without transmission constraints by augmented Lagrangian relaxation and the subproblem minimizes violations of transmission constraints by adjusting unit generation and phase shifter controls to test the feasibility of the unit commitment schedule. In the case of infeasibility in transmission flows, a proper constraint (Benders cut) is introduced based on violations in the subproblem for unit commitment rescheduling. The iterative process between the master problem and the subproblem provides a minimum production cost solution for generation scheduling while satisfying transmission constraints. A modified IEEE-30 bus system is presented to demonstrate the efficiency of the method.