An automatic load shedding in presence of partial/total limitation on the network power

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.