Documente Academic
Documente Profesional
Documente Cultură
Open switch type loop distribution system. When expressing loads on feeders mathematically,
we have a constant P, Q model, expressing the load
Fig. 1. values at load points in terms of A.C. load flows,
and a constant current model, expressing the load
Fe-eder values at load points in terms of D.C. load flows,
and so on. Since voltage drops and phase angle
Our problem is to determine the locations of differences on feeders are small, we use a constant
section points. It involves the selection of arcs current model.
containing section points and their locations on the To illustrate our constant current model,
arcs. Since an arc comprises several segments (num- consider the arc (Ut,V) shown in Fig. 2. The arc (U,V)
bered consecutively), the location of a section point comprises four segments S1,.5., . Let the load
on an arc is represented in terms of both the segment in segment S. denote d. (A) and le t the
number and the length from one end of the segment. concentrated load d (A) be between segments S
0 ~~~~~~~~~~~~~3
For simpLicity, the location of a section point on and S4. If a section point is in segment S2, the
current profile is shown as in Fig. 4. There point
a segment is expressed in terms of relative lengths.
Let x denote the length, O< x< 1, see Fig. 2. U is the origin and arc (U,V) is the y-axis. Since
the distributions of loads in segments are uniform
or concentrated, the current profile is a piece-wise
linear function of y.
p I
!do
currenc on arc (U,V)
51 5~~2 53 SL
0~~~(U,V) with 4 seaments
Fig. 2. Arc ~~O2'
Si,
1' S SS3 an
and S 4.
Section point P is at relative distance x
from one end of S 2.
In a real system, the relations be-cween segments
and switches(section points) are classified into
three cases as shown in Fig. 3.
case 1. Automatic remote-controllable switches are
installed only at segment ends.
case 2. More than one automatic remote-controllable
is installed in a segment.
case 3. The number of segments is more than that of
switches.
case 1
k C 2 i< 3 - - -*- 4 s
4 "
0 X x K
x -x--- [
- xQ-O where
re sistance
R.
xcs reactance
Fig. 3. Segments and Switches on Arc cos 9 power factor
A : automatic remote-controllable switch
x : manual switch S. : the i-th segment
1~ defined for segment S.
149
Similarly the voltage difference betveen points P Segment Location
and V is given by
,/3{R 4(
2
d cose + d cosa + d cose (1-x) + d )
4 4 3 3 2 2
Fig. 4 , we use a variable yi defined on
As in
0 arc i instead of x. defined on a segment of the
X( 2 d sine + d sin0 + d sine (1-x) + d arc i. Then the objective (representing the sum of
4 2T 4 4 3 3 2 2 0 losses) is piecewise quadratic in yT=(y I...,
+ R ( 1 d cosO( For simplicity, we give each concentrated
Load Yn)Y
323 3 + d 2 cose 2 (1-x)) arc and consider it to be uniformly
a dummy
distributed load
- X3( - d sine on the dummy arc. Let F(y) denote the objective.
3 3 3 + d 2 sine 2 (1-x))
2T Then the following property is obtained.
+
2
1
(R cose - X sine )d (1-x)
2 2 2
(2) ~~~~~~~~~2
2 2
Note that both functions are quadratic in
Property 1. Let the i-th section point be in arc i.
x. The Then the piecewise (strictly convex) quadratic func-
sum of losses in arc (U,V) is per wire (see Appendix tion F(y) is continuous and strictly unimodal [7]
1) with respect to the vector y, see Fig. 5.
Proof. See Appendix 2.
r2d 2{(b-x) + 12
Let Ni denote the number of a segment contain-
2 1 2 ing the i-th section point. Let x* solve the
+ I r.(I. - d.I + - d (3) problem (SP) to optimality. Then Property I implies
i=1,3,4 the following. When x'.=1 (x'=O), we should replace
Ni by N.+1 (N.-I) if possible.
whe re 1 1 1
1 1 2X
F(Y)
I2 = d3 + d2(l-x) (4)
I3 = d4 + d3 + d2(1-x) + d
Suboroblem
= co
s1 s2 s3 s4 55 s
I s2 s3
3~~~~~
_30
s2
arc 2
N2 2 s1*
N2 3
N;=3 ,4=
3N4
gr sl>s2>4gC s3 s, s5 #
41=l.O xi-0.8
arc 1
x 2=0. 1 x=0.3
arc 2 Each subproblem (SP) is solved by (i) MINOS/AUG-
MENTED (version 4.0) and (ii) a recursive quadratic
programming method. The total number of iterations
Fig. 7. *: optimal solutions of the (SP) (i.e., the total number of subproblems to be solved)
*: optimal locations of open switches It takes a total of (i) 16.34
is 5, see Fig. 9.
The optimal locations of normally open switches are at seconds and (ii) 12.80 seconds of central processing
thte right-end of the 4-th segment on the arc 1 and at time on the HITAC M-200H to solve (MP) by the above
This requires about (i)
the left-end of the 2-nd segment on the arc 2, if two methods, respectively.
these locations are feasible. The optimal locations 258 kilobytes and (ii) 263 kilobytes of storage for
were obtained after solving the second (SP). two methods (i) and (ii), respectively.
151
kW ACKNOWLEDGMENT
192
The authors thank the Shikoku Electric Power Co.
190 for providing the data used in testing the proposed
algorithm. Also the authors thank Mitsuhiro Hamano
188 for helping them.
186
184
182
180 REFERENCES
Appendix 1 Appendix 2
Here we describe how to construct (3). Let: arc Here we give a proof of Property 1 and that of
(U,V) have unit length, resistance r., demand d. Property 2. Before that, we prove the following.
and the current profile shown in Fig. Al. Then ,'i'e1 I
loss in arc (U,V) is expressed by Property 3. The piece-wise quadratic function F(y)
is continuous and strictly unimodal with respect to
1 2 a single variable y..
r.(I-d.) + d.t} dt
Proof. Consider arc (U,V) consisting of n segments.
i i2 I 1 1 2
rnt d.1 I + -d.)
3 (Al) of d and ri denote the demand and the resistance
Let segment
IL i, respectively. Assume a section point
P exist on segment S , see Fig. A3. The the sum
of losses in arc (U,V) is expressed by
I
L(x p ) = i=1 [r.(d
p-1 x
_ p p
+ E P.
j=t+l d j.)2
2
r .d
I d. P1
3Ii]
(d
j=i+l d.)d.r.
- + x + +
p p i IL
+ r
p p
d2{ (x p - 21 )2 + I}
12 ( A3)
:h
t
+ Int l
[r {d (1-x ) + E =p+l k
U V r d2
+ {d (1-x ) + E t-1 d }d rt +
t
]
Fig. Al. Current profile.
s1 S
p
Fig. A3. Arc (U,V).
Let x denote the stationary point of L(x ), i.e .,
P P
d.x
dL(x )
p =
0. (A4)
dx
d.I (1 - x) p
Then we have
i=1
n
i
r
0
r.(d.x -
1 1
d.t)2
1
dt + l r.(-d.x + d.t) 2 dt
X 1 L
A(p) d Pi=l (2 E P d.1 )
j=i+l d.j (A7)
= r + 1
r.
=r.d.((x 1 2 +1 } (A2) p p 1
+
- ii -
2 12
From (Al) and (A2) we have (3).
B(p) =P+ ld k
= t t +lrt (2
=P+lt +1 + d ) (A8)
t
and
x = 1
if and only if A(p) = B(p). A
Proof. This follows from (A5) and (A6).
1 2 P 3 3' 4 41
B1 ~~~~-O-O-
-- - ~-O---O-- B2
2
c1u
A B
B(u,v) = Q +
Fig. A6. Network G'" cnunj
B1 p + cv1
* B (A20)
x
cvi
n nj
<p >
L.
Algorithm RQP
Appendix 3
We consider the solution of (SP) by a recursive Step 0. Initialize x , u
and v . Set k = 0.
quadratic programming method [lo ]. Let us rewrite k .1k k
Step 1. Solve (QP) with x = x , u = u , v v
(SP) as Let y* solve (QP) and u*, v4, 1 < i < n
be the optimal Lagrange multipliers corre-
(SP) minimize f(x) sponding to (A16), (A17), respectively.
subject to gi(x) < 0, 1 < i < n
Step 2. Set xk± Xk + y*.
h.(x)
1
< 0, 1 < i < n
Step 3. If xk+1 is optimal for (SP),, then stop.
Otherwise revise uk+ 1 u*, vk+l = v*.
r.(x) < 0, 1 < i < m.
Return to Step 1 with k = k + 1.
where
1 T T Here we have used MINOS (version 3.4) [11, 12] in
f (x) = 2~ x Qx + q x (Al3) solving (QP).
2
c x
ilxl
1
F 1(x)]
1
+ Dx d (A14)
2
-
*
gLn (x)
Lgn(X)_
c x
n n
2
h (x) c x
1F + Ex - e, (Al5)
*x
h (x)
n
c
n n
(x)
+ vg (x) y < 0, l < i < n (Al6)
where
B = V f(x) +
%i u vg2(x)
=
vV h (x) (A19)
i=l 1 1