Transi´lent Security Idspatch for the Concurrent Optiization of Lural Postulated Contingencies

The implementation of a transient security dispatch (TSD) algorithm for real-time applications is presented. The algorithm, based on the generalized reduced gradienit (GRG) method, processes collectively a set of contingencies in order to ensure transient stability for all postulated cases. The massive computation has been decomposed on a cluster of workstations, exploiting the decoupled nature of the GRG method and the benefits of distributed computing. The feasibility of the implementation is shown through tests on a realistic-sized test network.