Solution to security constrained unit commitment problem using genetic algorithm

摘要

In this paper Optimal Power Flow (OPF) with line flow constraint is incorporated in solving the Unit Commitment (UC) problem using Genetic Algorithm (GA). In this proposed approach the problem is solved in two phases. In the first phase unit commitment is solved with prevailing constraints, without line flow constraint by genetic algorithm. In the second phase the violations in the lines are minimized for a committed schedule using GA based OPF. The resulting solution minimizes line flow violations in the critical lines under unit's decommitted hours by adjusting the unit generations. In this paper, a 66-bus Indian utility system with 12 generating units and 93 transmission lines is considered to exhibit the effectiveness of the proposed approach.