Scribd
Upload
10 views2 pages

Algo

The algorithm reads in data on the number of network elements and buses. It then initializes a matrix to store impedance values between buses. The algorithm then repeatedly modifies the impedance matrix based on the type of modification input: adding a new bus, adding a branch between buses, or modifying an existing branch. It counts the elements processed and prints the final impedance matrix once all elements have been processed.

Uploaded by

ShrutiPargai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

Algo

The algorithm reads in data on the number of network elements and buses. It then initializes a matrix to store impedance values between buses. The algorithm then repeatedly modifies the impedance matrix based on the type of modification input: adding a new bus, adding a branch between buses, or modifying an existing branch. It counts the elements processed and prints the final impedance matrix once all elements have been processed.

Uploaded by

ShrutiPargai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ALGORITHM:

Step 1: Read the data in number of elements and number of buses.

Step2: Initialize Zij =0

Where i = 1,2n ; j= 1,2,.n

Step 3: Set the element number counter as count =1 and random variable m=0.

Step 4: Input the impedance Zb between buses k and l and input the type modification.

Step 5: Check the type modification. If type modification is 1 go to Step6,if type modification is 2 go to
Step7, if type modification is 3 go to Step8, If type modification is 4 go to Step9.

Step 6: A branch is added between a new bus k and a reference bus

Zjk =Zkj=0 ; j=1,2,m

Zkk=Zb

m=m+1

and go to Step 10

Step 7: A branch is added between new bus k to old bus l

Zkj=Zlk ; j=1,2,..m

Zjk=Zkj ; j=1,2,..m

Zkk=Zll+Zb

m=m+1

and go to Step 10

Step 8: A branch is added between old bus k and reference bus

Zij= Zijold (Zik Zkj )/(Zkk + Zb) ; i=1, 2..m

; j=1, 2...m

and go to step 10

Step 9: A link is added between two old bus k and l

Zijnew=Zijold - (Zik-Zil)(Zkj-Zlj) /(Zb+Zkk+Zll-Zkl-Zlk) ; i=1 , 2..m

; j=1 , 2..m

And go to step 10
Step 10: Check element count.

If count>number of elements ,

then go to Step 11

else count = count + 1

go to Step 4 and repeat steps.

Step 11: Print the output matrix.

Step 12: Stop

You might also like