CN106356857A - Unified power flow controller site-selecting method based on load variation rate index - Google Patents

Abstract

The invention discloses a unified power flow controller site-selecting method based on load variation rate index, comprising the steps of calculating grid base power flow according to grid generation, load, frame structure and operation mode data; counting load rate of each branch, and normalizing and calculating the load rates; calculating grid power flow after each branch experiences N-1 faults; counting load rate of each branch, and normalizing and calculating the load rates; calculating a line construction difficulty level coefficient for an area where a line locates; calculating a site selection adaptability index for each branch; ranking the site selection adaptability indexes of the branches, and using the front ones of the branches with maximum index value as recommended mounting branches. The site selection adaptability comprehensive index is acquired by using grid initial power flow and line N-1 mode power flow in connection with the line construction difficulty level for the area where the line locates, a recommended mounting site for UPFC is determined according to the magnitude of the index value, and the method has the advantages that the calculation is simple and calculation speed is high.

Description

A kind of THE UPFC site selecting method based on loading rate index

Technical field

The present invention relates to a kind of THE UPFC site selecting method and in particular to a kind of based on loading rate index THE UPFC site selecting method, belongs to flexible AC transmission technical field.

Background technology

THE UPFC (upfc) as one kind of facts, can adjusting circuit trend effectively, control node electricity Pressure, improves power system safety and stability and runs.Therefore, the site position of THE UPFC, great to effect on power system.

At present, classify according to Optimization Method for Location-Selection, the optimization method of upfc installation site can be roughly divided into: expertise Method, priority are sent out and mathematical methods；Wherein Lie group etc. (Lie group, Liu Jiankun, Wei Zhinong, Zang Haixiang, Chen Jing, Zhang Ningyu. base Upfc addressing and capacity multiple target collocation method [p] in nsga-) a kind of upfc choosing based on nsga- of disclosure of the invention Location and capacity multiple target collocation method；Zhao Yuan etc. (Zhao Yuan, Yang Xiaosong, thanks out to the sensitive analysis to electric network reliability for your .upfc And distribute [j] rationally. Automation of Electric Systems .2012,36 (1): 55-60.) using THE UPFC (upfc) power Injection model, the method determining upfc optimum installation site according to sensitivity ranking results；Old wait (Chen Jing, Zhang Ningyu, An Hai quietly Cloud etc.) a kind of method of THE UPFC addressing of disclosure of the invention, negative using the initial Load flow calculation of electrical network each bar circuit Load rate, and load factor normalization is calculated the weight coefficient as each branch road, more each bar is calculated based on branch breaking distribution factor The addressing adaptive criteria of branch road, the size sequence finally according to index value determines that the recommendation of THE UPFC is installed Point.

The most theoretical property of current site selecting method is stronger, and practical application is poor, or only considers power network topology, does not examine Consider actual power grid construction condition.

Content of the invention

In view of the shortcomings of the prior art, it is an object of the present invention to provide a kind of unification based on loading rate index is damp Stream controller site selecting method, using the trend of the initial trend of electrical network and circuit n-1 mode, meanwhile, the on-site line of combined circuit Degree-of-difficulty factor is built on road, obtains addressing adaptability aggregative indicator, the size further according to index value determines THE UPFC Recommendation infield, there is the advantages such as computational methods are simple, calculating speed is fast.

To achieve these goals, the present invention is to realize by the following technical solutions:

A kind of THE UPFC site selecting method based on loading rate index of the present invention, including following step Rapid:

(1) according to grid generation, load, grid structure, running mode data, the existing flow calculation program of application calculates Electrical network basis trend；

(2) according to step (1) result of calculation, count the load factor of each bar branch road, and load factor is normalized calculating；

(3) on the basis of step (1), after the existing flow calculation program of application calculates each bar branch road generation n-1 fault The trend of electrical network；

(4) according to step (3) result of calculation, count the load factor of each bar branch road, and load factor is normalized calculating；

(5) calculate circuit location line construction complexity coefficient；

(6) calculate the addressing adaptive criteria of each bar circuit；

(7) the addressing adaptive criteria of each branch road is ranked up, the maximum front several branch roads of index value are unified tide Branch road is installed in the recommendation of stream controller.

In step (2), for branch road i, its load factor is ai, and the initial load rate coefficient after normalization calculates is α i；Its In, the computational methods of α i are:

${\mathrm{\α}}_i=a_i/\underset{n\&element;a}{\σ}{a}_n$

Wherein, a is the set of all branch roads in electrical network,

Therefore, it can obtain an initial load rate α matrix, specific as follows:

$\mathrm{\α}=\left[\begin{array}{c}{a}_1/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\\ a_2/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\\ .\\ .\\ .\\ a_i/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\\ .\\ .\\ .\\ a_n/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\end{array}\right].$

In step (4), after disconnecting for branch road k, the load factor of remaining branch road i is bi-k, the load after normalization calculating Rate coefficient is β_i-k；Wherein, β_i-kComputational methods be:

${\mathrm{\β}}_{i-k}=b_{i-k}/\underset{n\&element;a}{\σ}{b}_n$

Wherein, if i=k, β_i-i=0；

Therefore, it can the load factor β matrix after obtaining a n-1, specific as follows:

$\mathrm{\β}=\left[\begin{array}{cccccc}0& b_{1-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{1-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{1-n}/\underset{n\&element;a}{\σ}{b}_n\\ b_{2-1}/\underset{n\&element;a}{\σ}{b}_n& 0& \mathrm{...}& b_{2-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{2-n}/\underset{n\&element;a}{\σ}{b}_n\\ .& .& & & & .\\ .& .& \mathrm{...}& \mathrm{...}& \mathrm{...}& .\\ .& .& & & & .\\ b_{i-1}/\underset{n\&element;a}{\σ}{b}_n& b_{i-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& 0& \mathrm{...}& b_{i-n}/\underset{n\&element;a}{\σ}{b}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{n-1}/\underset{n\&element;a}{\σ}{b}_n& b_{n-1}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{n-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& 0\end{array}\right].$

In step (5), the computational methods of circuit i location line construction complexity coefficient lambda are:

λ_i=∑ l_dl/∑l

In formula, l_dlFor the total length of this area's cable run, l is all total line lengths in this area.

In step (6), the computational methods of the addressing adaptive criteria of each bar circuit are:

1. setting γ is the unit matrix of n × 1 rank, that is,

$\mathrm{\γ}=\left[\begin{array}{c}1\\ 1\\ .\\ .\\ .\\ 1\end{array}\right]$

2. according to below equation, obtain loading transformation matrices η

$\begin{array}{c}\mathrm{\η}=\mathrm{\β}-{\mathrm{\α\γ}}^t=\left[\begin{array}{cccccc}-a_1/\underset{n\&element;a}{\σ}{a}_n& b_{1-2}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{1-i}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{1-n}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n\\ b_{2-1}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n& -a_2/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{2-i}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{2-n}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{i-1}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n& b_{i-2}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& -a_i/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{i-n}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{n-1}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& b_{n-2}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{n-i}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& -a_n/\underset{n\&element;a}{\σ}{a}_n\end{array}\right]\\ =\left[\begin{array}{cccccc}{\mathrm{\η}}_1& {\mathrm{\η}}_2& \mathrm{...}& {\mathrm{\η}}_i& \mathrm{...}& {\mathrm{\η}}_n\end{array}\right]\end{array}$

3. calculate the addressing adaptive coefficient matrix χ of circuit i

$\mathrm{\χ}=\left[\begin{array}{cccccc}(1+{\mathrm{\λ}}_1)& (1+{\mathrm{\λ}}_2)/m_{2-1}& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-1}& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-1}\\ (1+{\mathrm{\λ}}_1)/m_{1-2}& (1+{\mathrm{\λ}}_2)& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-2}& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-1}\\ .& & & .& & .\\ .& \mathrm{...}& \mathrm{...}& .& \mathrm{...}& .\\ .& & & .& & .\\ (1+{\mathrm{\λ}}_1)/m_{1-i}& (1+{\mathrm{\λ}}_2)/m_{2-i}& \mathrm{...}& (1+{\mathrm{\λ}}_i)& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-i}\\ .& & & .& & .\\ .& \mathrm{...}& \mathrm{...}& .& \mathrm{...}& .\\ .& & & .& & .\\ (1+{\mathrm{\λ}}_1)/m_{1-n}& (1+{\mathrm{\λ}}_2)/m_{2-n}& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-n}& \mathrm{...}& (1+{\mathrm{\λ}}_n)\end{array}\right]$

In formula, m is the transformer station's number between two branch roads.

In step (6), for branch road i, its addressing adaptive criteria ω is:

ω=diag (χ abs (η)).

The beneficial effect that the present invention is reached:

The method according to the invention can utilize the initial trend of electrical network, circuit n-1 trend, network topology structure parameter, with When combined circuit location line construction complexity coefficient, obtain addressing adaptability aggregative indicator, big according to index Little can Effective selection go out upfc recommendation install branch road.The addressing adaptability aggregative indicator major embodiment of present invention upfc is excellent First consider to be installed on larger to electric network influencing, and this area's conventional line builds the thought in difficulty area higher.Only by quiet The Load flow calculation of state mode can get the recommendation infield of upfc, has the advantages such as computational methods are simple, calculating speed is fast, The feasibility study of actual electric network can be applied to for facts device and Preliminary design provides reference.

Specific embodiment

Technological means, creation characteristic, reached purpose and effect for making the present invention realize are easy to understand, with reference to Specific embodiment, is expanded on further the present invention.

(1) according to grid generation, load, grid structure, running mode data, application flow calculation program calculates electrical network base Plinth trend；

(2) according to step (1) result of calculation, count the load factor of each bar branch road, and load factor is normalized calculating；

(3) on the basis of step (1), electrical network after application flow calculation program calculating each bar branch road generation n-1 fault Trend；

(4) on the basis of step (3), count the load factor of each bar branch road, and load factor is normalized calculating；

(5) calculate circuit location line construction complexity coefficient；

(6) calculate the addressing adaptive criteria of each bar circuit；

(7) the addressing adaptive criteria of each branch road is ranked up, the maximum front several branch roads of index value are unified tide Branch road is installed in the recommendation of stream controller.

For branch road i in step (2), its load factor is ai, and the initial load rate coefficient after normalization calculates is α i；Its In, the computational methods of α i are:

${\mathrm{\α}}_i=a_i/\underset{n\&element;a}{\σ}{a}_n$

Wherein, a is the set of all branch roads in electrical network.

Therefore, it can obtain an initial load rate α matrix, specific as follows:

$\mathrm{\α}=\left[\begin{array}{c}{a}_1/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\\ a_2/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\\ .\\ .\\ .\\ a_i/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\\ .\\ .\\ .\\ a_n/\underset{n\&element;a}{\mathrm{\σ}}{a}_n\end{array}\right]$

In step (4), after disconnecting for branch road k, the load factor of remaining branch road i is bi-k, the load after normalization calculating Rate coefficient is β_i-k；Wherein, β_i-kComputational methods be:

${\mathrm{\β}}_{i-k}=b_{i-k}/\underset{n\&element;a}{\σ}{b}_n$

Wherein, if i=k, β_i-i=0.

Therefore, it can the load factor β matrix after obtaining a n-1, specific as follows:

$\mathrm{\β}=\left[\begin{array}{cccccc}0& b_{1-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{1-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{1-n}/\underset{n\&element;a}{\σ}{b}_n\\ b_{2-1}/\underset{n\&element;a}{\σ}{b}_n& 0& \mathrm{...}& b_{2-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{2-n}/\underset{n\&element;a}{\σ}{b}_n\\ .& .& & & & .\\ .& .& \mathrm{...}& \mathrm{...}& \mathrm{...}& .\\ .& .& & & & .\\ b_{i-1}/\underset{n\&element;a}{\σ}{b}_n& b_{i-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& 0& \mathrm{...}& b_{i-n}/\underset{n\&element;a}{\σ}{b}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{n-1}/\underset{n\&element;a}{\σ}{b}_n& b_{n-1}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{n-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& 0\end{array}\right].$

Circuit i location line construction difficulty or ease coefficient lambda in step (5), computational methods are

λ_i=∑ l_dl/∑l

In formula, l_dlFor the total length of this area's cable run, l is all total line lengths in this area.

Step (6) addressing adaptability aggregative indicator computational methods are

1. setting γ is the unit matrix of n × 1 rank, that is,

$\mathrm{\γ}=\left[\begin{array}{c}1\\ 1\\ .\\ .\\ .\\ 1\end{array}\right]$

2. according to below equation, obtain loading rate matrix η

$\begin{array}{c}\mathrm{\η}=\mathrm{\β}-{\mathrm{\α\γ}}^t=\left[\begin{array}{cccccc}-a_1/\underset{n\&element;a}{\σ}{a}_n& b_{1-2}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{1-i}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{1-n}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n\\ b_{2-1}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n& -a_2/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{2-i}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{2-n}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{i-1}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n& b_{i-2}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& -a_i/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{i-n}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{n-1}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& b_{n-2}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{n-i}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& -a_n/\underset{n\&element;a}{\σ}{a}_n\end{array}\right]\\ =\left[\begin{array}{cccccc}{\mathrm{\η}}_1& {\mathrm{\η}}_2& \mathrm{...}& {\mathrm{\η}}_i& \mathrm{...}& {\mathrm{\η}}_n\end{array}\right]\end{array}$

3. calculate the addressing adaptive coefficient matrix χ of circuit i

$\mathrm{\χ}=\left[\begin{array}{cccccc}(1+{\mathrm{\λ}}_1)& (1+{\mathrm{\λ}}_2)/m_{2-1}& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-1}& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-1}\\ (1+{\mathrm{\λ}}_1)/m_{1-2}& (1+{\mathrm{\λ}}_2)& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-2}& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-1}\\ .& & & .& & .\\ .& \mathrm{...}& \mathrm{...}& .& \mathrm{...}& .\\ .& & & .& & .\\ (1+{\mathrm{\λ}}_1)/m_{1-i}& (1+{\mathrm{\λ}}_2)/m_{2-i}& \mathrm{...}& (1+{\mathrm{\λ}}_i)& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-i}\\ .& & & .& & .\\ .& \mathrm{...}& \mathrm{...}& .& \mathrm{...}& .\\ .& & & .& & .\\ (1+{\mathrm{\λ}}_1)/m_{1-n}& (1+{\mathrm{\λ}}_2)/m_{2-n}& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-n}& \mathrm{...}& (1+{\mathrm{\λ}}_n)\end{array}\right]$

In formula, m is the transformer station's number between two branch roads

For branch road i, its addressing adaptive criteria ω is:

ω=diag (χ abs (η))

Ultimate principle and principal character and the advantages of the present invention of the present invention have been shown and described above.The technology of the industry , it should be appreciated that the present invention is not restricted to the described embodiments, the simply explanation described in above-described embodiment and description is originally for personnel The principle of invention, without departing from the spirit and scope of the present invention, the present invention also has various changes and modifications, these changes Change and improvement both falls within scope of the claimed invention.Claimed scope by appending claims and its Equivalent thereof.

Claims (6)

1. a kind of THE UPFC site selecting method based on loading rate index is it is characterised in that include following Step:

(1) according to grid generation, load, grid structure, running mode data, calculate electrical network basis trend；

(2) according to step (1) result of calculation, count the load factor of each bar branch road, and load factor is normalized calculating；

(3) on the basis of step (1), calculate the trend that each bar branch road occurs electrical network after n-1 fault；

(4) according to step (3) result of calculation, count the load factor of each bar branch road, and load factor is normalized calculating；

(5) calculate circuit location line construction complexity coefficient；

(6) calculate the addressing adaptive criteria of each bar circuit；

(7) the addressing adaptive criteria of each branch road is ranked up, the maximum front several branch roads of index value are Unified Power Flow control Branch road is installed in the recommendation of device processed.

2. the THE UPFC site selecting method based on loading rate index according to claim 1, its feature exists In in step (2), for branch road i, its load factor is ai, and the initial load rate coefficient after normalization calculates is α i；Wherein, α i Computational methods be:

${\mathrm{\α}}_i=a_i/\underset{n\&element;a}{\σ}{a}_n$

Wherein, a is the set of all branch roads in electrical network,

Therefore, it can obtain an initial load rate α matrix, specific as follows:

$\mathrm{\α}=\left[\begin{array}{c}{a}_1/\underset{n\&element;a}{\σ}{a}_n\\ a_2/\underset{n\&element;a}{\σ}{a}_n\\ .\\ .\\ .\\ a_i/\underset{n\&element;a}{\σ}{a}_n\\ .\\ .\\ .\\ a_n/\underset{n\&element;a}{\σ}{a}_n\end{array}\right].$

3. the THE UPFC site selecting method based on loading rate index according to claim 2, its feature exists In, in step (4), after disconnecting for branch road k, the load factor of remaining branch road i is bi-k, the load rate coefficient after normalization calculating For β_i-k；Wherein, β_i-kComputational methods be:

${\mathrm{\β}}_{i-k}=b_{i-k}/\underset{n\&element;a}{\σ}{b}_n$

Wherein, if i=k, β_i-i=0；

Therefore, it can the load factor β matrix after obtaining a n-1, specific as follows:

$\mathrm{\β}=\left[\begin{array}{cccccc}0& b_{1-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{1-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{1-n}/\underset{n\&element;a}{\σ}{b}_n\\ b_{2-1}/\underset{n\&element;a}{\σ}{b}_n& 0& \mathrm{...}& b_{2-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{2-n}/\underset{n\&element;a}{\σ}{b}_n\\ .& .& & & & .\\ .& .& \mathrm{...}& \mathrm{...}& \mathrm{...}& .\\ .& .& & & & .\\ b_{i-1}/\underset{n\&element;a}{\σ}{b}_n& b_{i-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& 0& \mathrm{...}& b_{i-n}/\underset{n\&element;a}{\σ}{b}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{n-1}/\underset{n\&element;a}{\σ}{b}_n& b_{n-2}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& b_{n-i}/\underset{n\&element;a}{\σ}{b}_n& \mathrm{...}& 0\end{array}\right]$

4. the THE UPFC site selecting method based on loading rate index according to claim 3, its feature exists In, in step (5), the computational methods of circuit i location line construction complexity coefficient lambda are:

λ_i=∑ l_dl/∑l

In formula, l_dlFor the total length of this area's cable run, l is all total line lengths in this area.

5. the THE UPFC site selecting method based on loading rate index according to claim 4, its feature exists In, in step (6), the computational methods of the addressing adaptive criteria of each bar circuit are:

1. setting γ is the unit matrix of n × 1 rank, that is,

$\mathrm{\γ}=\left[\begin{array}{c}1\\ 1\\ .\\ .\\ .\\ 1\end{array}\right]$

2. according to below equation, obtain loading transformation matrices η

$\begin{array}{c}\mathrm{\μ}=\mathrm{\β}-{\mathrm{\α\γ}}^t=\left[\begin{array}{cccccc}-a_1/\underset{n\&element;a}{\σ}{a}_n& b_{1-2}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{1-i}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{1-n}/\underset{n\&element;a}{\σ}{b}_n-a_1/\underset{n\&element;a}{\σ}{a}_n\\ b_{2-1}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n& -a_2/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{2-i}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{2-n}/\underset{n\&element;a}{\σ}{b}_n-a_2/\underset{n\&element;a}{\σ}{a}_n\\ .& .& & & & .\\ .& .& \mathrm{...}& \mathrm{...}& \mathrm{...}& .\\ .& .& & & & .\\ b_{i-1}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n& b_{i-2}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& -a_i/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{i-n}/\underset{n\&element;a}{\σ}{b}_n-a_i/\underset{n\&element;a}{\σ}{a}_n\\ .& .& & .& & .\\ .& .& \mathrm{...}& .& \mathrm{...}& .\\ .& .& & .& & .\\ b_{n-1}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& b_{n-2}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& b_{n-i}/\underset{n\&element;a}{\σ}{b}_n-a_n/\underset{n\&element;a}{\σ}{a}_n& \mathrm{...}& -a_n/\underset{n\&element;a}{\σ}{a}_n\end{array}\right]\\ =\[\begin{array}{cccccc}{\mathrm{\η}}_1& {\mathrm{\η}}_2& \mathrm{...}& {\mathrm{\η}}_i& \mathrm{...}& {\mathrm{\η}}_n\end{array}\]\end{array}$

3. calculate the addressing adaptive coefficient matrix χ of circuit i

$\mathrm{\χ}=\left[\begin{array}{cccccc}(1+{\mathrm{\λ}}_1)& (1+{\mathrm{\λ}}_2)/m_{2-1}& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-1}& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-1}\\ (1+{\mathrm{\λ}}_1)/m_{1-2}& (1+{\mathrm{\λ}}_2)& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-2}& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-1}\\ .& & & & & .\\ .& \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...}& .\\ .& & & & & .\\ (1+{\mathrm{\λ}}_1)/m_{1-i}& (1+{\mathrm{\λ}}_2)/m_{2-i}& \mathrm{...}& (1+{\mathrm{\λ}}_i)& \mathrm{...}& (1+{\mathrm{\λ}}_n)/m_{n-i}\\ .& & & & & .\\ .& \mathrm{...}& \mathrm{...}& \mathrm{...}& \mathrm{...}& .\\ .& & & & & .\\ (1+{\mathrm{\λ}}_1)/m_{1-n}& (1+{\mathrm{\λ}}_2)/m_{2-n}& \mathrm{...}& (1+{\mathrm{\λ}}_i)/m_{i-n}& \mathrm{...}& (1+{\mathrm{\λ}}_n)\end{array}\right]$

In formula, m is the transformer station's number between two branch roads.

6. the THE UPFC site selecting method based on loading rate index according to claim 5, its feature exists In in step (6), for branch road i, its addressing adaptive criteria ω is:

ω=diag (χ abs (η)).