DYNAMIC SECURITY CONSTRAINED MULTIAREA UNIT COMMITMENT

The paper presents a new approach for multi-area unit commitment which takes power system dynamic stability limit into account. In the proposed dynamic security constrained commitment method, dynamic programming is first employed to perform unit commitment on the whole system. The eigenvalues for the resultant hourly generation schedules are examined to see if they satisfy the prespecified dynamic security criterion. If the dynamic security requirement is not met at certain hours, an iterative algorithm is employed to reduce the inter-area line flows gradually and to perform area redispatch and, if necessary, area unit commitment, in order for the resultant generation schedule to satisfy the dynamic security requirement. The goal of the presented approach is to achieve a multi-area generation schedule which not only meets the conventional requirements of having lowest fuel costs with the spinning reserves and steady-state transmission capacity limits satisfied, but also offers good dynamic performance through the enforcement of dynamic security constraint. The effectiveness of the proposed approach is demonstrated by unit commitment of a utility system.