This paper illustrates a innovative proposal for electrical load shedding when there is a partial and/or total limitation in the power available from the network. The issue has been addressed through the mathematical formulation of the 0-1 Knapsack Problem and solved using three different algorithms: a heuristic Greedy, a meta-heuristic Tabu Search and a Dynamic Programming. The Matlab program that has been developed to validate the optimizing proposal is discussed, together with different simulations carried out with reference to a school building compound
An automatic load shedding in presence of partial/total limitation on the network power / Lamedica, Regina; Santini, Ezio; D., Zaccagnini Romito. - ELETTRONICO. - (2012), pp. 668-673. (Intervento presentato al convegno International Symposium on Power Electronics, tenutosi a Sorrento nel 20-22 June 2012) [10.1109/SPEEDAM.2012.6264639].
An automatic load shedding in presence of partial/total limitation on the network power
LAMEDICA, Regina;SANTINI, Ezio;
2012
Abstract
This paper illustrates a innovative proposal for electrical load shedding when there is a partial and/or total limitation in the power available from the network. The issue has been addressed through the mathematical formulation of the 0-1 Knapsack Problem and solved using three different algorithms: a heuristic Greedy, a meta-heuristic Tabu Search and a Dynamic Programming. The Matlab program that has been developed to validate the optimizing proposal is discussed, together with different simulations carried out with reference to a school building compoundI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
