divided into three sections by two sectionalizing switches, each of divided sections is connected to other feeder through sectionalizing switch. distribution system many feeders has sectionalizing switches, the system configuration is determined by states (opened or closed) of sectionalizing switches. tries to obtain distribution loss-minimum configuration of configuration candidates. it cult to determine the loss-minimum configuration is whether each sectionalizing is or by a In a distribution system, in order to enhance the reliability of power supply, the distribution feeder is divided into several sections by installing sectionalizing switches, and then each of sectionalized sections is connected to di ff erent feeder. For example, one feeder is divided into three sections by two sectionalizing switches, and then each of divided sections is connected to other feeder through sectionalizing switch. Since a distribution system with many feeders has many sectionalizing switches, the system configuration is determined by states (opened or closed) of sectionalizing switches. Usually, power utility tries to obtain distribution loss-minimum configuration among large numbers of configuration candidates. However, it is very di ffi cult to determine the loss-minimum configuration that the mathematical optimality is guaranteed, because it is well known that determination of distribution system’s configuration is to decide whether each sectionalizing switch is opened or closed by solving a combinatorial optimization problem. In this paper, the authors propose a determination method of loss minimum configuration which the mathematical optimality is guaranteed for a three sectionalized and three connected distribution feeder network. A problem to determine the loss minimum configuration is formulated as a combinatorial optimization problems with four operational constraints ( 1 (cid:2) feeder capacity, 2 (cid:2) voltage limit, 3 (cid:2) radial structure and 4 (cid:2) three sectionalization). In the proposed method, after picking up all partial configurations satisfied with radial structure constraint by using enumeration method, optimal combination of partial configurations is determined under the other operational constraints by using conventional optimization method. Numerical simulations are carried out for a distribution network model with 140 sectionalizing switches in order to examine the validity of the proposed algorithm in comparison with one of conventional meta-heuristics (Tabu search).
[1]
N. Bretas,et al.
Main chain representation for evolutionary algorithms applied to distribution system reconfiguration
,
2005,
IEEE Transactions on Power Systems.
[2]
V. Parada,et al.
Optimization of electrical distribution feeders using simulated annealing
,
2004,
IEEE Transactions on Power Delivery.
[3]
Ying-Tung Hsiao,et al.
Multiobjective evolution programming method for feeder reconfiguration
,
2004
.
[4]
J. Matsuki,et al.
Loss minimum configuration of distribution system considering N-1 security of dispersed generators
,
2004,
IEEE Transactions on Power Systems.
[5]
Koichi Nara,et al.
Method for Loss Minimum Re-configuration Problem of Distribution System by Tabu Search
,
2003
.
[6]
Yasuhiro Hayashi,et al.
Determination Method for Loss-minimum Distribution System Configuration Considering Disconnection of Installed Dispersed Generators
,
2002
.
[7]
I. Drezga,et al.
A heuristic nonlinear constructive method for distribution system reconfiguration
,
1999
.
[8]
R. Taleski,et al.
Distribution network reconfiguration for energy loss reduction
,
1997
.
[9]
H. Chiang,et al.
An efficient algorithm for real-time network reconfiguration in large scale unbalanced distribution systems
,
1995,
Proceedings of Power Industry Computer Applications Conference.
[10]
M. Kitagawa,et al.
Implementation of genetic algorithm for distribution systems loss minimum re-configuration
,
1992
.
[11]
S. S. Venkata,et al.
An expert system operational aid for restoration and loss reduction of distribution systems
,
1988
.
[12]
Randal E. Bryant,et al.
Graph-Based Algorithms for Boolean Function Manipulation
,
1986,
IEEE Transactions on Computers.