Algorithm 1: Load shedding node(s) selection
1. System initialization
2. Read the node load 𝑃(𝑖) and required load shedding 𝑃𝑙𝑠
3.
Evaluate the node’s security margin (𝛼); 𝛼(𝑖) = (
4.
5.
6.
7.
8.
9.
10.
11.
Arrange 𝛼(𝑖) from largest →→ smallest
Initialize 𝑖 = 1.
if 𝑃(𝑖) ≥ 𝑃𝑙𝑠 then,
𝑖 is load shedding node
else 𝑖 = 𝑖 + 1
until ∑𝑛𝑖 𝑃(𝑖) ≥ 𝑃𝑙𝑠
end
return node(s), 𝑖.
𝑉𝑖𝑛𝑖𝑡𝑖𝑎𝑙 (𝑖)− 𝑉𝑐𝑟𝑖𝑡 (𝑖)
𝑉𝑐𝑟𝑖𝑡 (𝑖)
) × 100