1. the electric energy quality monitoring point collocation method of meter and distributed power source, comprises the following steps:
1) related notion in being distributed rationally to meter and the grid-connected electric energy quality monitoring point of distributed power source is defined;Definition meter
And " comprehensive monitoring of power distribution network " in the case of distributed power source DG, refer to that the intelligent diagnostics of electrical energy power quality disturbance event can be met
It is required that and needing the voltage and current information monitoring degree of acquisition;Define " global viewable of voltage and current ", refer to be based on matching somebody with somebody
The electric energy quality monitor PQM acquisition information of installation is put, then other are further obtained by state estimation circuit and section are not installed
The information of point so that the voltage and current information Observable of all circuits of power distribution network the whole network and node;Define " the distribution of monitoring point
Weight coefficient ", refers to that the amount capacity according to some potential monitoring point accounts for the proportion of all monitoring point rated capacity summations and obtained
The term coefficient arrived, the order of priority for potential monitoring point;Particularly meter and DG are grid-connected, when direction of tide is inverted
When so that weight coefficient order of priority changes;
2) it is defined as meeting Kirchhoff's current law (KCL) KCL minimum number NKCL, i.e. it is global that the configuration quantity of PQM meets electric current
Considerable minimum number;Define " feasible zone distributed rationally ", refer to that the installation number for distributing result rationally is no less than NKCL;KCL
Principle shows the outflow N bar circuits from a bus, and the electric current of a branch road can be calculated by other N-1 bars branch road, right
For individual node, N-1 is to avoid the indefinite PQM of branch current from least installing number;And consider that PQM is arranged on branch road
End points, i.e., just from bus separation point position, PQM monitoring ranges will include whole piece circuit;Therefore, NKCLDefinition it is as follows
<mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>K</mi>
<mi>C</mi>
<mi>L</mi>
</mrow>
</msub>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msub>
<mi>N</mi>
<mi>a</mi>
</msub>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>&beta;</mi>
</munderover>
<msub>
<mi>b</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula, NaPotential installation PQM monitorings are counted in expression system, the two ends of any bar circuit in the case of meter and distributed power source
All it is potential mount point;Bus quantity in β expression systems;I is counting variable;biIt is the determined property value of bus, works as mother
When connecting two Above Transmission Lines on line, biJudge to return to 1, otherwise return to 0;
3) voltage Observable region MRA is defined, when referring to that electrical energy power quality disturbance event occurs for system, certain monitoring point can be observed
The region of the disturbance event;The voltage observability of the whole network is realized, even if the MRA combinations of system monitoring point can cover the whole network;
Failure points use F in systemaRepresent, then the MRA of the whole nodes of system can be N with a dimensiona×FaObservable matrix MMRA
Represent, its element assignment m (di,fj) as follows
<mrow>
<mi>m</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>d</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>f</mi>
<mi>j</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>V</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>&le;</mo>
<msub>
<mi>V</mi>
<mi>t</mi>
</msub>
</mrow>
</mtd>
<mtd>
<mrow>
<mo>&ForAll;</mo>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mo>...</mo>
<mo>,</mo>
<msub>
<mi>N</mi>
<mi>a</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>V</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>></mo>
<msub>
<mi>V</mi>
<mi>t</mi>
</msub>
</mrow>
</mtd>
<mtd>
<mrow>
<mo>&ForAll;</mo>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mo>...</mo>
<mo>,</mo>
<msub>
<mi>F</mi>
<mi>a</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula, VijRepresent j-th of trouble point fjNode d during generation short troubleiMagnitude of voltage, VtFor the monitoring voltage threshold of setting
Value;WithRepresent any i and any j;As m (di,fj) it is equal to 1, represent trouble point fjBelong to node diMRA;As m (di,
fj) it is equal to 0, represent trouble point fjIt is not belonging to node diMRA;
4) binary system particle group optimizing BPSO models are improved;In BPSO after improvement, each particle is with speed ginseng
A several solutions, its particle position corresponds to NaThe vector of individual potential installation site, 1 × N of vector dimensiona, its element value is
1 or 0, indicate whether that PQM is installed, all feasible solutions constitute the location status in search space;Each particle circle in the air direction and
Distance is determined by velocity amplitude and present position values, carries out adaptive value evaluation by evaluation function, then population is in solution space
Pursue current optimal solution and carry out fast search, find out optimal particle;The iterative process of particle group optimizing PSO models includes after improvement
The iteration of particle position and speed;N-th of particle of kth time iterationVelocity amplitudeKth time iteration it is as follows:
<mrow>
<msubsup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>=</mo>
<msubsup>
<mi>&omega;v</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<msub>
<mi>c</mi>
<mn>1</mn>
</msub>
<msubsup>
<mi>r</mi>
<mn>1</mn>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>b</mi>
<mi>e</mi>
<mi>s</mi>
<mi>t</mi>
<mo>.</mo>
<mi>n</mi>
</mrow>
<mi>k</mi>
</msubsup>
<mo>-</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>c</mi>
<mn>2</mn>
</msub>
<msubsup>
<mi>r</mi>
<mn>2</mn>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>g</mi>
<mrow>
<mi>b</mi>
<mi>e</mi>
<mi>s</mi>
<mi>t</mi>
</mrow>
<mi>k</mi>
</msubsup>
<mo>-</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msubsup>
<mi>v</mi>
<mi>n</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>2</mn>
<mo>&times;</mo>
<mi>s</mi>
<mi>i</mi>
<mi>g</mi>
<mi>m</mi>
<mi>o</mi>
<mi>i</mi>
<mi>d</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mo>|</mo>
<msubsup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>|</mo>
<mo>></mo>
<mn>0.1</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>2</mn>
<mo>&times;</mo>
<msub>
<mi>r</mi>
<mn>0</mn>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mo>|</mo>
<msubsup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>|</mo>
<mo>&le;</mo>
<mn>0.1</mn>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
1
In formula, subscript n represents n-th of particle, and subscript k or k+1 represent iterations;ω is inertia weight, representation speed it is used
Property coefficient;c1And c2For accelerated factor, represent the gap of particle and current more excellent position and produce the coefficient of acceleration;r0、r1And r2
It is [0~+1] interval random real number;Individual extreme valueRepresent that n-th of particle itself of kth time iteration was currently found
Optimal location, global extremumRepresent the optimal location that all particles were currently found;OrRepresent vector v
OrI-th of element, any i=1,2 ..., Na;For intermediate variable, iterative it be divided into two by complicated and make statement apparent
Change;Wherein sigmoid () function is defined as follows
<mrow>
<mi>s</mi>
<mi>i</mi>
<mi>g</mi>
<mi>m</mi>
<mi>o</mi>
<mi>i</mi>
<mi>d</mi>
<mrow>
<mo>(</mo>
<mi>z</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mn>1</mn>
<mo>+</mo>
<msup>
<mi>e</mi>
<mrow>
<mo>-</mo>
<mi>z</mi>
</mrow>
</msup>
</mrow>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>5</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula (5), z represents aleatory variable;Speed iterative (3) expresses the characteristic that population follows current more excellent particle, repeatedly
The span of speed is converted to the successive value between [- 1~+1] with sigmoid () function for formula (4);r0Effect be anti-
Only speed level off to zero when, search for secular stagnation and be absorbed in local extremum;
N-th of particle of kth time iterationPosition iteration, it is as follows with its element representation:
<mrow>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mrow>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>+</mo>
<msubsup>
<mi>v</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>)</mo>
<mo>&le;</mo>
<mo>(</mo>
<mfrac>
<msub>
<mi>r</mi>
<mn>3</mn>
</msub>
<mn>2</mn>
</mfrac>
<mo>+</mo>
<mn>0.25</mn>
<mo>)</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>+</mo>
<msubsup>
<mi>v</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
<mo>)</mo>
<mo>></mo>
<mo>(</mo>
<mfrac>
<msub>
<mi>r</mi>
<mn>3</mn>
</msub>
<mn>2</mn>
</mfrac>
<mo>+</mo>
<mn>0.25</mn>
<mo>)</mo>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula, r3For the random real number between [0~+1];Subscript k or k+1 represent iterations;Represent+1 iteration of kth
The value of i-th of element of n-th of particle, any i=1,2 ..., Na;Rule of judgment is meant that:If kth time particle position
When being more than dynamic threshold with its speed sum, then+1 position value of kth is 1, is otherwise 0, and each element is calculated respectively;Mould
The improved purpose of type, is to make algorithm in particle iterative process, keeps the ability to currently more excellent particle direction search, overcomes two
Applicable sex chromosome mosaicism of the system computing in optimization process, and its threshold value has dynamic property, prevents from being absorbed in local convergence too early;
5) new evaluation function is built, population is substituted into constructed evaluation function calculates adaptive value, and corresponding adaptive value is smaller,
Represent that its solution is more excellent;Evaluation functionIt is made up of 4 subfunctions and its coefficient:
<mrow>
<mi>F</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>&mu;</mi>
<mn>1</mn>
</msub>
<msub>
<mi>h</mi>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>&mu;</mi>
<mn>2</mn>
</msub>
<msub>
<mi>h</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>&lambda;</mi>
<mn>1</mn>
</msub>
<msub>
<mi>g</mi>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>&lambda;</mi>
<mn>2</mn>
</msub>
<msub>
<mi>g</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula, μ1For single PQM cost factor,For weighting function;μ2Sufficient KCL principles with thumb down and the redundancy produced
The factor,For corresponding redundancy functions;λ1Penalty factor during sufficient MRA with thumb down,Judge letter to be corresponding
Number;λ2Represent blanketing fctor,For corresponding coverage function;
Wherein Section 1, weighting functionRepresent to add up to the weight that all installation PQM monitoring points are carried out, if monitoring points
Its fewer value is smaller, and its definition is as follows
<mrow>
<msub>
<mi>h</mi>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mi>a</mi>
</msub>
</munderover>
<mi>&xi;</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>8</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>&xi;</mi>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<msub>
<mi>S</mi>
<mi>i</mi>
</msub>
<mrow>
<msub>
<mi>&Sigma;S</mi>
<mi>N</mi>
</msub>
</mrow>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>9</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula, SiFor the rated capacity of i-th of mount point, Σ SNFor all rated capacity summations;ξ (i) is representedIt is corresponding to match somebody with somebody
Electric weight coefficient, its value is the positive number for being slightly less than numerical value 1;Distribution weight coefficient is that the amount capacity based on mount point accounts for total appearance
The ratio of amount, then its difference with numerical value 1 is obtained, the smaller weight for representing its priority on the contrary of the coefficient is bigger;
Wherein Section 2, redundancy functionsCalculate the redundancy for being unsatisfactory for N-1 principles and producing;
<mrow>
<msub>
<mi>h</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mo>|</mo>
<msub>
<mi>N</mi>
<mrow>
<mi>K</mi>
<mi>C</mi>
<mi>L</mi>
</mrow>
</msub>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mi>a</mi>
</msub>
</munderover>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<mo>|</mo>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>10</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein Section 3, decision functionFor determining whether to meet voltage global viewable;
<mrow>
<msub>
<mi>g</mi>
<mn>1</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<munderover>
<mo>&Pi;</mo>
<mi>j</mi>
<msub>
<mi>F</mi>
<mi>a</mi>
</msub>
</munderover>
<mi>y</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mn>0</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<munderover>
<mo>&Pi;</mo>
<mi>j</mi>
<msub>
<mi>F</mi>
<mi>a</mi>
</msub>
</munderover>
<mi>y</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
<mo>&NotEqual;</mo>
<mn>0</mn>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>11</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mrow>
<mo>&lsqb;</mo>
<mi>y</mi>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mn>1</mn>
<mo>&times;</mo>
<msub>
<mi>F</mi>
<mi>a</mi>
</msub>
</mrow>
</msub>
<mo>=</mo>
<msub>
<mrow>
<mo>&lsqb;</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mn>1</mn>
<mo>&times;</mo>
<msub>
<mi>N</mi>
<mi>a</mi>
</msub>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mrow>
<mo>&lsqb;</mo>
<msub>
<mi>M</mi>
<mrow>
<mi>M</mi>
<mi>R</mi>
<mi>A</mi>
</mrow>
</msub>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<msub>
<mi>N</mi>
<mi>a</mi>
</msub>
<mo>&times;</mo>
<msub>
<mi>F</mi>
<mi>a</mi>
</msub>
</mrow>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>12</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula, y (j) represents vector y j-th of element, the physical meaning of y (j) numerical value be trouble point by multiple monitoring points simultaneously
The number monitored;For voltage Observable matrix MMRA1 × FaDimensional vector y transition intermediate vectors;Formula (12) is with lower mark
Computing dimension has been released, ifOperation result y in exist numerical value be 0 item, show current solution at corresponding ranks
In the presence of the trouble point that can not be monitored, then the continued product condition of formula (11) will be equal to 0 so that judges that return value is equal to 1, and then touches
Send out the penalty factor λ in evaluation function formula (10)1;
Wherein Section 4, coverage functionExpress the utilization ratio of monitoring point;
<mrow>
<msub>
<mi>g</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mi>n</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>y</mi>
<mn>1</mn>
</msub>
<mo>|</mo>
<mo>|</mo>
<mo>=</mo>
<mo>|</mo>
<mo>|</mo>
<mi>y</mi>
<mo>-</mo>
<msub>
<mrow>
<mo>&lsqb;</mo>
<mn>1</mn>
<mo>&rsqb;</mo>
</mrow>
<mrow>
<mn>1</mn>
<mo>&times;</mo>
<msub>
<mi>F</mi>
<mi>a</mi>
</msub>
</mrow>
</msub>
<mo>|</mo>
<mo>|</mo>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>13</mn>
<mo>)</mo>
</mrow>
</mrow>
||y1| |=[y1(1)2+y1(2)2+…y1(Fa)2]1/2 (14)
In formula, | | y1| | vectorial y is sought in expression1Euclidean Norm,Represent 1 × FaComplete 1 vector of dimension, works as y1Euclidean Norm become
When being bordering on zero, show that all trouble points can monitor and only be measured by a monitoring point, utilization rate highest;Otherwise the norm is got over
Greatly, show there is certain block region that excessive monitoring point is coated over power distribution network;
6) initialization population position and speed, substitute into evaluation function formula by population and calculate adaptive value, and to initial extreme value
Carry out assignment;
7) according to particle position and iterative, all particles of renewal of speed;Feedback check is carried out to feasible zone, can if being unsatisfactory for
Row domain, then to a random element for the particle1 variation, then feedback check are put, until meeting feasible zone;
8) all populations are substituted into evaluation function formula again and calculates adaptive value;If the adaptive value of particle is better than individual pole before this
Value, then more new individual extreme value, otherwise constant;If optimal individual extreme value updates global extremum better than global extremum before this,
Otherwise it is constant;
9) when reaching maximum iteration, then circulation is jumped out, and export current global extremum as optimum results;Otherwise return
Step 7 continues iteration;According to global extremumMiddle value is 1 element, to determine PQM installation site, and is added up's
All elements are worth to installation total number.