The implementation of a transient security dispatch (TSD) algorithm for real-time applications is presented. The algorithm, based on the generalized reduced gradient (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 implementa
Transient security dispatch for the concurrent optimization of plural postulated contingencies / Bruno, S.; De Tuglie, E.; La Scala, M.. - In: IEEE TRANSACTIONS ON POWER SYSTEMS. - ISSN 0885-8950. - STAMPA. - 17:3(2002), pp. 707-714. [10.1109/TPWRS.2002.800940]
Transient security dispatch for the concurrent optimization of plural postulated contingencies
Bruno, S.;De Tuglie, E.;La Scala, M.
2002-01-01
Abstract
The implementation of a transient security dispatch (TSD) algorithm for real-time applications is presented. The algorithm, based on the generalized reduced gradient (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 implementaI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
