Manbir Kaur Objectives • To assemble Bus impedance matrix using building algorithm.
05-02-2019 EIED TIET Patiala 2
ZBUS Building Algorithm It is a step by step procedure, in which the elements are added as a branch or as a link in a partial network. There are four types of modifications • Type 1: Addition of element of impedance 𝑧𝑏 between new node and reference node. This is equivalent to addition of a branch and dimension of zbus gets increased by 1. • Type 2: Addition of element of impedance 𝑧𝑏 between new node and old node. This is equivalent to addition of a branch and dimension of zbus gets increased by 1. • Type 3: Addition of element of impedance 𝑧𝑏 between old node and reference node. This is equivalent to addition of a link and dimension of zbus remains unchanged. • Type 4: Addition of element of impedance 𝑧𝑏 between two old nodes. This is equivalent to addition of a link and dimension of zbus remains unchanged.
05-02-2019 EIED TIET Patiala 3
Background for building algorithm • Assume there is partial network of n buses and in matrix form it will be 𝑉1 𝑍11 𝑍12 𝑍1𝑖 𝑍1𝑗 𝑍1𝑛 𝐼1 𝑉2 𝑍21 𝑍22 𝑍2𝑖 𝑍2𝑗 𝑍2𝑛 𝐼2 ⋮ ⋮ 𝑉𝑖 𝐼𝑖 = 𝑍𝑖1 𝑍𝑖2 𝑍𝑖𝑖 𝑍𝑖𝑗 𝑍𝑖𝑛 𝑉𝑗 𝐼𝑗 ⋮ 𝑍𝑗1 𝑍𝑗2 𝑍𝑗𝑖 𝑍𝑗𝑗 𝑍𝑗𝑛 ⋮ . . 𝑉𝑛 𝑍𝑛1 𝑍𝑛2 𝑍𝑛𝑖 𝑍𝑛𝑗 𝑍𝑛𝑛 𝐼𝑛 05-02-2019 EIED TIET Patiala 4 Algorithm for Z-bus assembly Step1: Read input data: no of elements NE, number of buses NB Step 2: Initialise 𝑍𝑖𝑗 = 0; 𝑖 = 1,2 … 𝑁𝐵; 𝑗 = 1,2 … 𝑁𝐵 Step 3: Set the element number counter count=1 , bus index n=0 Step 4: Input the impedance 𝑧𝑏 between nodes k and j and type modification TM. Step 5: Check Type modification TM If (Type modification) is 1; go to step 6 If (Type modification) is 2; go to step 7 If (Type modification) is 3; go to step 8 If (Type modification) is 4; go to step 9 Step 6: Type modification 1 means a branch is added between new node k and reference node 𝑍𝑘𝑚 = 𝑍𝑚𝑘 = 0; 𝑚 = 1,2, . . 𝑛 𝑍𝑘𝑘 = 𝑧𝑏 Modify 𝑛 = 𝑛 + 1 . Go to step 10. Step 7: Type modification 2 means a branch is added between new node (say k) and old node (say j) 𝑍𝑘𝑙 = 𝑍𝑗𝑚 ; 𝑚 = 1,2, . . 𝑛 𝑍𝑙𝑘 = 𝑍𝑚𝑗 ; 𝑚 = 1,2, . . 𝑛 𝑍𝑘𝑘 = 𝑍𝑗𝑗 + 𝑧𝑏 Modify 𝑛 = 𝑛 + 1 . Go to step 10. Step 8: Type modification 3 means a link is added between old node (say 𝑗) and reference node 𝑛𝑒𝑤 𝑜𝑙𝑑 𝑍𝑚𝑗 𝑍𝑗𝑙 𝑍𝑚𝑙 = 𝑍𝑚𝑙 − ; 𝑙 = 1,2, . . 𝑛. 𝑚 = 1,2, . . 𝑛 𝑍𝑗𝑗 +𝑧𝑏 Go to step 10. Step 9: Type modification 4 means a link is added between two old nodes (say 𝑖 𝑎𝑛𝑑 𝑗) 𝑛𝑒𝑤 𝑜𝑙𝑑 (𝑍𝑚𝑖 −𝑍𝑚𝑗 )×(𝑍𝑖𝑙 −𝑍𝑗𝑙 ) 𝑍𝑚𝑙 = 𝑍𝑚𝑙 − ; l = 1,2, . . 𝑛. 𝑚 = 1,2, . . 𝑛 𝑍𝑖𝑖 +𝑍𝑗𝑗 −2𝑍𝑖𝑗 +𝑧𝑏 Go to step 10. Step 10: Check if count ≥ 𝑁𝐸. If ‘YES’, Go to step 11, else increment element counter; count = count + 1. go to step 4. 9Step 11: Print the result Z EIED TIET Patiala 5 Example: Assemble Z bus for given data