 Open Access
 Total Downloads : 2
 Authors : Shruti Vig, Dr. Jayashri Vajpai
 Paper ID : IJERTCONV2IS03073
 Volume & Issue : ETRASCT – 2014 (Volume 2 – Issue 03)
 Published (First Online): 30072018
 ISSN (Online) : 22780181
 Publisher Name : IJERT
 License: This work is licensed under a Creative Commons Attribution 4.0 International License
Reconfiguration of Distribution Network using Best First Search
Shruti Vig
M.E. Scholar
M.B.M. Engineering College Jodhpur, India
vig.shruti21@yahoo.in
Dr. Jayashri Vajpai Associate Professor

Engineering College Jodhpur, India
jvajpai@gmail.com
AbstractElectrical Distribution networks are generally configured radially. The operating conditions such as, voltage, power loss etc. change with changing load profile. The operating conditions can be improved significantly by changing the status of the tieswitches (normally open) and sectionalizing switches (normally closed) while maintaining the structure radial and keeping all nodes connected. Several AI based techniques have been applied to search for optimal configuration. However, they are all computationally complex and time consuming, making them unsuitable for online applications. This paper illustrates the use of bestfirst search technique to find the optimal or near optimal configuration with minimal computational burden. Simplified Distflow equations are employed to compute the load flow. They give approximate loss calculation and are efficient in guiding the search. The proposed method has been successfully applied to IEEE16 bus system.
KeywordsReconfiguration, Bestfirst search, simplified distflow equations.

INTRODUCTION
Power Distribution Systems are formed by many interconnected feeders. Each feeder is further partitioned into many load zones along its radial structure. Distribution feeders are configured in a radial manner i.e. each load is supplied by a single source. Feeders contain a number of closed switches along its length which divide the feeder into sections, these normally closed switches are called sectionalizing switches. The feeders are separated from each other by normally open switches which are called tie switches.
Radial structure of Distribution Network can be modified from timetotime in order to achieve objectives such as loss minimization, load balancing, fault isolation, etc. This can be achieved by closing a tie switch (normally open) and opening a sectionalizing switch (normally closed) to regain the radial structure. These modifications by changing open/closed states of the switches to transfer load from one feeder to another, may significantly improve the operating conditions of the overall system. The set of these modifications is called Reconfiguration of Distribution System.
Under normal operating conditions, reconfiguration can be done for the purpose of loss reduction and load balancing. While under faulty conditions, it is performed so as to clear
the fault, thereby restoring the power to maximum number of consumers. This is called supply restoration [1].
Fig. 1 Schematic diagram of distribution system
Fig.1 shows a schematic diagram of a distribution network. The network can be reconfigured by first closing an open switch, say SW33. This closing results in the formation of a loop that consists of the branches b6, b7, b8, b9, b33, b11, b10. Say switch SW8 is opened to regain radial structure. Now feeder 1 supplies load points 6, 7 and feeder 2 supplies
load points 10, 11, 9, 8 of the formed loop. This operation relieves the overloaded feeder, while a lightly loaded feeder is given some load. This can also be seen from perspective that now the newly loaded feeder is utilizing its hardware capacity better [2]. It is essential to meet some operating constraints while performing switching exchange.
Radial Distribution Network configuration problem is a combinatorial optimization problem. It basically means to find the best possible tree that has minimized losses as well as better voltage profile amongst all possible trees for the graph while obeying radiality and reliability constraints. It is obvious that a search examining all the possible trees for a graph using an efficient load flow technique would eventually lead to the solution tree (or configuration); however, such a search would be exhaustive one and will be computationally difficult. As the search demands repetitive load flow computations, the time in which the problem
k=i+2
converges increase as the size of the network increases. A number of AI based techniques have been applied to the problem efficiently but they too need time in reaching the solution network configuration. AI as well as exhaustive
V2 = V2 2(riPi + xiQi) (3)
i+1 i
Another way to write relationship for Pi+1, Qi+1 is
search techniques are unsuitable for online purposes. Thus, there is a need of finding an optimal or near optimal solution network configuration with minimum computational burden.
Pi+1 = n Qi+1 = n
PLk QLk
(4)
(5)
k=i+2
Proposed method represents the switching options in the form of a decision tree. The best first search is used to evaluate the switching options based on some heuristic rules. Simplified Distflow equations [3] are used to carry out the load flow. They are linear equations and can be solved directly. Thus, the computational burden reduces and optimal configuration
These equations are called Simplified Distflow equations [4]. The computations are done in per unit, the loss in a particular branch can be rewritten as
(P +Q )
Z Z
Loss (it branc) = ri i i r (P2 + Q2) p.u. (6)
V
Z i i i
i
is reached in less time. The equations efficiently guide the
search process in order to reach the minimum loss configuration. The methodology has been tested for 16 bus system. The voltage profile for the initial and final network has been compared.
A number of papers have been published on distribution network reconfiguration. Civanlar, Grainger, Yin, Lee [4] proposed a simple formula to find the best switching option. Baran, Wu [3] gave two load flow methods to guide the search. Loss minimization and load balancing formed the two objectives. D. Das [5] proposed a fuzzy multiobjective approach. Chang, Kuo [6] used Simulated Annealing to solve minimum loss configuration problem. Ming, Jian and Wen Yian [7] used Genetic algorithm. They utilized the radial nature of the network to form chromosome. J. Z. Zhu [8] employed refined genetic algorithm. They coded the chromosome only with number of open switches. Batrinu, Carpaneto and Chicco [9] proposed a PSO based technique. Lu, Luo, Liu and Long [10] proposed a hierarchical structure polyparticle swarm optimization (HSPPSO) to reach the optimal configuration.
The following paper is organized in the following manner. Section II gives the problem formulation. Section III gives the proposed methodology. Finally, section IV gives the results of reconfiguration process.

PROBLEM FORMULATION
Fig. 2 shows a schematic representation of a single line diagram.
Fig.2 Single line diagram for radial network
Pi+1 = Pi PLi+1 (1)
Qi+1 = QiQLi+1 (2)
the initial voltage is considered to be 1 p.u.
The sum of the losses in all the branches of the radial network is
i=O i i
Loss(total) = n1 ri (P2 + Q2) p.u. (7)
Simplified Distflow equations are used to compute the load flow of the network. They are linear and can be solved directly. They give approximate loss profile but it will not degrade the quality of the solution of the minimal loss configuration problem. The computation time is reduced using the equations.
.

PROPOSED METHODOLOGY
The switching options are represented in the form of a decision tree. The switching options are generated by exchangig the tie switch with sectionalizing switch on its left and right.
Fig. 3 Initial configuration
The available switching possibilities out of base configuration of IEEE 16 bus system are represented in the fig. 3. The infeasible options are eliminated as possible switching options. Any switching that result in isolation of
any load point is considered infeasible. The best first search technique is used to evaluate the options using the following heuristic rules:
Rule 1 Keep the options that transfer the load from higher voltage drop side to lower voltage drop side.
Rule 2 Implement the switching option that has maximum Vtie .
According to rule 1, the valid switching options left would be C4O6, C11O5 and C13O9. Rest of them are eliminated as possibilities. Then, using voltage at the nodes of the tie switch Vtie is computed. According to rule 2, the switch with maximum Vtie is the candidate switch to be implemented. After applying both the rules, C13O9 is selected for implementation.
The configuration of the network is altered. The load flow is carried out to compute the new loss and new voltage profile. Fig. 4 gives the possible switching
Fig.3 Switching possibilities from base configuration
Fig 4.Tree growth after implementing Close 13, Open 9
Fig. 5 Tree after implementing Rule 1
Search process is continued until the switching results in loss reduction.

Algorithm
Steps involved in the search process are summarized in the following steps:
Step 1 Read Network data.
Step 2 Identify the set of possible switching options.
Step 3 Apply Rule 1 to prune out switching options.
Step 4 Apply Rule 2 to find the tie switch with Vtie (max).
Step 5 Implement the switching option, update the network configuration. Carry out the load flow.
Step 6 Repeat steps 14 until switching results in loss reduction.

Flowchart
The following figure illustrates the best first search process implementation to the Reconfiguration problem.
Start
Read Network data
Identify the set of possible switching options
Update the decision tree
Feasibility No
constraints satisfied for all possibilities?
Yes
process. The loss of the system reduced when best switching option is performed. The mean voltage of the network also improved.
The loss profile and voltage profile are given in the table I and table II. The final configuration is given in figure 8.
Fig.8 Final configuration.
Configuration
Loss(approx.)
Initial
.5114 MW
After Closing 13, Opening 9
.4663 MW
After Closing 4, Opening 6
.4498 MW
TABLE I. LOSS PROFILE
Apply Rules 12
No
Loss reduced?
Yes
Stop
TABLE II. VOLTAGE PROFILE(IN PER UNIT)
Implement the switching option
Carry out load flow of the updated network
Node no.
Initial voltage
Intermediate voltage
Final voltage
4
0.9907
0.99078
0.99083
5
0.9878
0.98791
0.98803
6
0.9860
0.98613
0.98618
7
0.9849
0.98504
0.98509
8
0.9791
0.98179
0.98190
9
0.9711
0.97398
0.97402
10
0.9769
0.98955
0.98955
11
0.9710
0.97386
0.98800
12
0.9693
0.97220
0.97224
13
0.9944
0.99238
0.99238
14
0.9948
0.99032
0.99032
15
0.9918
0.98976
0.98976
16
0.9913
0.98924
0.98924
Fig.7 Flow chart representation of the search process


RESULTS
The search process is successfully applied to the IEEE16 bus system [11]. The data is given in table IV.
The simplified Distflow equations are used to carry out the load flow [4]. They give approximate loss and voltage calculations but are efficient in the guiding the search
Mean Voltage
0.9837
0.98484
0.98596
REFERENCES
The methodology proposed is able to reach the same optimal configuration with minimized computation as compared to method employing global optimal search technique with iterative load flow process.
The results have been compared with ref [8].
TABLE III. RESULT COMPARISON

CONCLUSION

Reconfiguration of distribution networks can improve overall operating conditions of the system. It results in better load distribution, reduced power losses and improved voltage profile of the system. Simplified equations avoided the iterative process, this reduced the computational burden. Reconfiguration using Best first search and Simplified Distflow equations can be applied for real time applications because of minimized time in reaching optimal solution configuration with satisfactory accuracy.

A. Botea, J. Rintanen, and D. Banerjee Optimal Reconfiguration for Supply Restoration with Informed A* Search in IEEE Transactions On Smart Grid, Vol. 3, No. 2, June 2012.

T. Taylor and D. Lubkeman Implementation of Heuristic Search Strategies for Distribution Feeder Reconfiguration in IEEE Transactions on Power Delivery, Vol. 5, No. I , January 1990

M. E. Baran and F. F. Wu Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing in IEEE Transactions on Power Delivery, Vol. 4, No. 2, April 1989..
RADIAL NETWORK
INITIAL CONFIG.
FINAL CONFIG. REF[8]
FINAL CONFIG. PROPOSED
OPEN SWITCHES
4
6
6
11
9
9
13
11
11
POWER LOSS
(MW)
.5114
.4661
.4498

S. Civanlar J.J. Grainger H. Yin S.S.H. Lee Distribution Feeder Reconfiguration for Loss Reduction in IEEE Transactions on Power Delivery, Volume 3, No. 3, July 1988.

D. Das Reconfiguration of distribution system using fuzzy multi objective approach in Electrical Power and Energy Systems 28 (2006) 331338.

H. C. Chang and C. C. Kuo Network Reconfiguration in Distribution Systems using Simulated Annealing in Electric Power Systems Research, 29(1994)227238.

Z. Ming, B. Pengxiang, L. Jian and Z. Wen Yian An Improved Genetic Algorithm for Distribution System Reconfiguration IEEE 2002.

J.Z. Zhu Optimal reconfiguration of electrical distribution network using the refined genetic algorithm in Electric Power Systems Research 62 (2002) 37

F. Batrinu, E. Carpaneto and G. Chicco A Novel Particle Swarm Method for Distribution System Optimal Reconfiguration. Power Tech, 2005 IEEE Russia

L. Lu, Q. Luo, J. Y. Liu, C. Long An Improved Particle Swarm Optimization for Reconfiguation of Distribution Network in Fourth International Conference on Natural Computation, 978076953304 9/08 $25.00 Â© 2008 IEEE.

Jizhong Jhu Optimization of Power System Operation A JOHN WILEY & SONS, INC., PUBLICATION
TABLE IV IEEE 16 BUS SYSTEM DATA [11]