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

Author

Lamedica, Regina ; Santini, Ezio ; Romito, Donatella Zaccagnini

Author_Institution

Dept. Astronaut., Electr., Energetic Engin., Sapienza Univ. of Rome, Rome, Italy

fYear

2012

fDate

20-22 June 2012

Firstpage

668

Lastpage

673

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 compound.

Keywords

dynamic programming; greedy algorithms; knapsack problems; load shedding; search problems; 0-1 Knapsack problem; Matlab program; automatic load shedding; dynamic programming; electrical load shedding; heuristic greedy algorithm; mathematical formulation; meta-heuristic tabu search algorithm; network power; partial-total limitation; school building compound; Boilers; Dynamic programming; Floors; Heuristic algorithms; Optical wavelength conversion; Switches; algorithm design and analysis; decision making; optimization methods; software development management;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM), 2012 International Symposium on

Conference_Location

Sorrento

Print_ISBN

978-1-4673-1299-8

Type

conf

DOI

10.1109/SPEEDAM.2012.6264639

Filename

6264639