Summary form only given, as follows. 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 implementation is shown through tests on a realistic-sized test network
Transient security dispatch for the concurrent optimization of plural postulated contingencies / Bruno, S; DE TUGLIE, Enrico Elio; LA SCALA, Massimo. - (2002), pp. 995-995. (Intervento presentato al convegno IEEE Power-Engineering-Society Summer Meeting tenutosi a Chicago, IL nel July 21-25, 2002) [10.1109/PESS.2002.1043539].
Transient security dispatch for the concurrent optimization of plural postulated contingencies
DE TUGLIE, Enrico Elio;LA SCALA, Massimo
2002-01-01
Abstract
Summary form only given, as follows. 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 implementation is shown through tests on a realistic-sized test networkI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
