Optimal Reconfiguration of Distribution

King Saud University
College of Engineering
Electrical Engineering Department
Optimal Reconfiguration of
Distribution Networks Using Ant
Colony Method
A thesis By
Abdullah M. Alshehri
Submitted in Partial Fulfillment of the Requirement for the Master's
Degree in the department of Electrical Engineering at the College of
Engineering King Saud University.
Supervised by
Prof. Hossam Talaat and
Prof. Saad Alghuwainem
RIYADH
Jumada AlAwla, 1428 H
June , 2007
PDF created with pdfFactory trial version www.pdffactory.com

Optimal Reconfiguration of Distribution Networks
Using Ant Colony Method
A thesis By
Abdullah M. Alshehri
This thesis was discussed on 25 th of Jumada AlAwla 1428H ( 11th of June
2007 G) and was accepted.
Committee Members:
Advisor: Prof. Hossam Talaat
Co-advisor: Prof. Saad Alghuwainem
Examiner: Prof. Abdulrahman Al-Orainy
Examiner: Prof. Abdulhameed Al-Ohaly
Examiner: Prof. Waheed Ghareeb

‫‪‬‬
‫ﻤﻠﺨﺹ‬
‫ﺍﻟﺘﺸﻜﻴل ﺍﻷﻤﺜل ﻟﺸﺒﻜﺎﺕ ﺍﻟﺘﻭﺯﻴﻊ ﺒﺎﺴﺘﺨﺩﺍﻡ ﻁﺭﻴﻘﺔ ﻤﻤﻠﻜﺔ ﺍﻟﻨﻤل‬
‫ﺘﻤﺘﻠﻙ ﺃﻨﻅﻤﺔ ﺘﻭﺯﻴﻊ ﺍﻟﻁﺎﻗﺔ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﻤﻔﺎﺘﻴﺢ ﺭﺒﻁ ﻭﻓﺼل ﺘﺤﺩﺩ ﺸﻜل ﺸﺒﻜﺎﺕ‬
‫ﺍﻟﺘﻭﺯﻴﻊ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ‪ .‬ﻴﻌﺎﺩ ﺘﺸﻜﻴل ﺸﺒﻜﺎﺕ ﺍﻟﺘﻭﺯﻴﻊ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﻤﻥ ﺨﻼل ﺘﺸﻐﻴل ﻤﻔﺎﺘﻴﺢ‬
‫ﺍﻟﺭﺒﻁ ﻭﺍﻟﻔﺼل ﺒﺎﻟﺘﺒﺎﺩل‪ .‬ﻓﺸﺭﻜﺎﺕ ﺘﻭﺯﻴﻊ ﺍﻟﻁﺎﻗﺔ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﺘﺴﻌﻰ ﻟﻠﺤﺼﻭل ﻋﻠﻰ‬
‫ﺃﻓﻀل ﺸﻜل ﻟﺘﺸﻐﻴل ﺸﺒﻜﺎﺕ ﺍﻟﺘﻭﺯﻴﻊ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﻤﻥ ﺨﻼل ﺘﻘﻠﻴل ﺍﻟﻔﻘﺩ ﻓﻲ ﺍﻟﻁﺎﻗﺔ‬
‫ﻭﻤﻭﺍﺯﻨﺔ ﺍﻷﺤﻤﺎل ﻤﻤﺎ ﻴﺤﻘﻕ ﺘﺭﺸﻴﺩ ﻓﻲ ﺍﻟﻁﺎﻗﺔ ﻭﻴﺤﺴﻥ ﺃﺩﺍﺀ ﺍﻟﻨﻅﺎﻡ ﺍﻟﻜﻬﺭﺒﺎﺌﻲ‪.‬‬
‫ﻋﺎﺩﺓ ﻴﺘﻡ ﺼﻴﺎﻏﺔ ﻤﺴﺄﻟﺔ ﺇﻋﺎﺩﺓ ﺘﺸﻜﻴل ﺍﻟﺸﺒﻜﺔ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﻜﺩﺍﻟﺔ ﺘﺤﻘﻴﻕ ﺍﻟﻤﺜﺎﻟﻴﺔ‬
‫ﺫﺍﺕ ﻫﺩﻑ ﻤﻔﺭﺩ ﺒﻘﻴﻭﺩ ﻤﺘﻌﺎﺩﻟﺔ ﻭﻤﺘﺭﺍﺠﺤﺔ‪ .‬ﺘﻌﺘﺒﺭ ﻤﺴﺄﻟﺔ ﺇﻋﺎﺩﺓ ﺘﺸﻜﻴل ﺍﻟﺸﺒﻜﺔ ﻫﻲ‬
‫ﻤﺴﺄﻟﺔ ﺘﺤﻘﻴﻕ ﺍﻟﻤﺜﺎﻟﻴﺔ ﺍﻟﻤﻌﻘﺩﺓ ﻭﺍﻟﻤﺩﻤﺠﺔ ﻟﻭﺠﻭﺩ ﻗﻴﻭﺩ ﻻ ﻴﻤﻜﻥ ﺘﺠﺎﻭﺯﻫﺎ ﻋﻨﺩ ﺇﻴﺠﺎﺩ‬
‫ﺤل ﻤﺜﺎﻟﻲ ﺃﻭ ﺸﺒﻪ ﻤﺜﺎﻟﻲ ﻟﻠﻤﺴﺄﻟﺔ‪ ،‬ﻭﻨﺘﻴﺠﺔ ﻟﺫﻟﻙ ﻴﺘﻁﻠﺏ ﻁﺭﻕ ﺫﺍﺕ ﻜﻔﺎﺀﺓ ﻋﺎﻟﻴﺔ‬
‫ﻟﻠﺘﻌﺎﻤل ﻤﻊ ﻫﺫﺍ ﺍﻟﻨﻭﻉ ﻤﻥ ﺍﻟﻤﺴﺎﺌل‪.‬‬
‫ﺨﻼل ﻫﺫﻩ ﺍﻟﺭﺴﺎﻟﺔ ﺍﻟﻌﻠﻤﻴﺔ‪ ،‬ﺘﻡ ﺍﺴﺘﺨﺩﺍﻡ ﻁﺭﻴﻘﺔ ﺫﻜﻴﺔ ﻭﻗﻭﻴﺔ ﺘﺩﻋﻰ ﻤﻤﻠﻜﺔ‬
‫ﻫﺫﻩ ﺍﻟﻁﺭﻴﻘﺔ ﺘﻌﺘﻤﺩ ﻋﻠﻰ‬ ‫ﺍﻟﻨﻤل ﻟﺤل ﻤﺴﺄﻟﺔ ﺇﻋﺎﺩﺓ ﺘﺸﻜﻴل ﺍﻟﺸﺒﻜﺔ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ‪.‬‬
‫ﻤﺠﻤﻭﻋﺎﺕ ﻤﻥ ﺍﻟﻨﻤل ﺘﺴﺘﺨﺩﻡ ﺍﻟﺒﺤﺙ ﺍﻟﺴﺭﻴﻊ ﻭﺍﻟﻤﻜﺜﻑ ﻭﺍﻷﺜﺭ ﺍﻟﺭﺠﻌﻲ ﺍﻟﻤﻭﺠﺏ ﻓﻲ‬
‫ﺍﻻﺴﺘﻜﺸﺎﻑ‪.‬‬
‫ﺍﻟﻁﺭﻴﻘﺔ ﺍﻟﻤﻘﺘﺭﺤﺔ ﺍﺴﺘﻭﺤﻴﺕ ﻤﻥ ﺍﻟﺴﻠﻭﻙ ﺍﻟﻁﺒﻴﻌﻲ ﻟﻠﻨﻤل ﻓﻲ ﺇﻴﺠﺎﺩ ﺍﻟﻘﻭﺕ‬
‫ﻭﺠﻠﺒﻪ ﺇﻟﻰ ﺍﻟﻤﺴﺘﻌﻤﺭﺓ ﺘﺎﺭﻜﺔ ﺍﺜﺭ ﻓﻲ ﻁﺭﻴﻘﻬﺎ ﺘﺘﺒﻌﻪ ﺍﻟﻤﺠﻤﻭﻋﺎﺕ ﺍﻷﺨﺭﻯ‪،‬ﺤﻴﺙ ﻴﻤﺘﻠﻙ‬
‫ﺍﻟﻨﻤل ﺍﻟﻘﺩﺭﺓ ﻟﻠﺒﺤﺙ ﻋﻥ ﺃﻓﻀل ﻭﺍﻗﺼﺭ ﻤﺴﺎﺭ ﻟﻠﺤﺼﻭل ﻋﻠﻰ ﺍﻟﻘﻭﺕ ﻤﻥ ﺨﻼل ﺇﻓﺭﺍﺯ‬
‫ﻤﻭﺍﺩ ﻜﻴﻤﻴﺎﺌﻴﺔ ﻓﻲ ﺍﻟﻤﺴﺎﺭ ﺍﻟﺫﻱ ﺘﺴﻠﻜﻪ‪.‬‬
‫‪PDF created with pdfFactory trial version www.pdffactory.com‬‬

‫ﻟﻴﺱ ﻫﻨﺎﻙ ﺨﻭﺍﺭﺯﻡ ﻭﺤﻴﺩ ﻟﻁﺭﻴﻘﺔ ﻤﻤﻠﻜﺔ ﺍﻟﻨﻤل‪ ،‬ﻓﺨﻼل ﻫﺫﻩ ﺍﻟﺭﺴﺎﻟﺔ ﺍﻟﻌﻠﻤﻴﺔ‬
‫ﺍﺴﺘﺨﺩﻤﺕ ﺨﻭﺍﺭﺯﻡ ﺠﺩﻴﺩ ﺘﻡ ﺘﻤﺜﻴﻠﻪ ﻓﻲ ﺒﺭﻨﺎﻤﺞ ﺒﺎﺴﺘﺨﺩﺍﻡ "ﻤﺎﺘﻼﺏ" ﻭﻤﻥ ﺜﻡ ﺘﻁﺒﻴﻘﻪ‬
‫ﻋﻠﻰ ﻤﺴﺄﻟﺔ ﺇﻋﺎﺩﺓ ﺘﺸﻜﻴل ﺍﻟﺸﺒﻜﺎﺕ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﻟﺘﺤﻘﻴﻕ ﺤل ﻤﺜﺎﻟﻲ ﻟﺩﺍﻟﺘﻲ ﻫﺩﻑ‪.‬‬
‫ﺘﻡ ﺘﻘﻭﻴﻡ ﺃﺩﺍﺀ ﺍﻟﺸﺒﻜﺎﺕ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﺍﻟﺜﻼﺙ ﺫﺍﺕ ﺍﻷﺤﺠﺎﻡ ﺍﻟﻤﺨﺘﻠﻔﺔ ﺒﺎﺴﺘﺨﺩﺍﻡ‬
‫ﺒﺭﻨﺎﻤﺞ "ﻤﺎﺘﻼﺏ" ﻻﺨﺘﺒﺎﺭ ﻤﺩﻯ ﺠﺩﻭﻯ ﻭﻜﻔﺎﺀﺓ ﺍﻟﻁﺭﻴﻘﺔ ﺍﻟﻤﻘﺘﺭﺤﺔ‪،‬ﻭﻜﺫﻟﻙ ﺘﻡ ﻤﺤﺎﻜﺎﺓ‬
‫ﺍﻟﺸﺒﻜﺎﺕ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ ﺍﻟﺘﻲ ﺃﺠﺭﻴﺕ ﻋﻠﻴﻬﺎ ﺍﻟﺩﺭﺍﺴﺔ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺒﺭﻨﺎﻤﺞ "ﺒﺎﻭﺭ ﻭﺭﻟﺩ"‬
‫ﻟﻠﺘﺤﻘﻕ ﻤﻥ ﺍﻟﻨﺘﺎﺌﺞ ﺍﻟﺘﻲ ﺘﻡ ﺍﻟﺤﺼﻭل ﻋﻠﻴﻬﺎ ﺒﺎﺴﺘﺨﺩﺍﻡ " ﺍﻟﻤﺎﺘﻼﺏ" ﻭﺘﻤﺜﻴل ﺍﻟﻨﺘﺎﺌﺞ‬
‫ﺒﺄﺴﻠﻭﺏ ﺁﺨﺭ‪.‬‬
‫ﻤﻥ ﺨﻼل ﺍﻟﻨﺘﺎﺌﺞ ﺍﻟﺘﻲ ﺘﻡ ﺍﻟﺤﺼﻭل ﻋﻠﻴﻬﺎ ﺘﺒﻴﻥ ﺃﻥ ﺍﻟﻁﺭﻴﻘﺔ ﺍﻟﻤﻘﺘﺭﺤﺔ ﻭﺍﻋﺩﺓ‬
‫ﻓﻲ ﺘﻁﺒﻴﻘﺎﺕ ﺇﻋﺎﺩﺓ ﺘﺸﻜﻴل ﺍﻟﺸﺒﻜﺎﺕ ﺍﻟﻜﻬﺭﺒﺎﺌﻴﺔ‪.‬‬
‫‪PDF created with pdfFactory trial version www.pdffactory.com‬‬

ABSTRACT
Power distribution systems have tie and sectionalizing switches whose states
determine the configuration of the network. Reconfiguration of distribution network
is achieved through switching operation on switches of distribution network branches.
Power companies are interested in finding the most efficient configuration for
minimization of real power losses and load balancing among distribution feeders to
save the energy and enhance the operation performance of distribution system.
The objective of this thesis is to show that the ant colony optimization
algorithm can be used successfully in the reconfiguration of electrical distribution
networks to minimize the power losses of the system and to balance the loading of the
feeders. This work is to provide a basis for power companies to use it in the
reconfiguration of the distribution networks to reduce the operational costs and to
enhance the performance of their networks.
The network reconfiguration problem is usually formulated as a single
objective optimization problem with equality and inequality constraints. The network
reconfiguration is a complex combinatorial optimization problem. This is because
there are multiple constraints which must not to be violated while finding an optimal
or near optimal solution to the distribution network reconfiguration problem. As a
result, more efficient approaches are required to handle this combinatorial problem.
In this thesis, a new and powerful intelligent evolution method, called ant colony
optimization (ACO) is adopted for solving the optimization problem. It is a
population based approach that uses the exploration of positive feedback as well as
greedy search. The proposed method was inspired from natural behavior of the ant
colonies on how they find the food source and bring them back to their nest by
building the unique trail formation. Artificial ants are able to search for the
successively shorter feasible route by using information accumulated in the form of a
pheromone trail deposited on the edge of their traveling path. The algorithm required
for carrying out the steps of the ACO is not unique. In this research, a new algorithm

for ACO has been proposed. The proposed algorithm is coded using MATLAB.
Then, ACO algorithm has been applied to the distribution system reconfiguration
through the optimization of two objective functions. The performance of three
distribution networks of different sizes has been evaluated using MATLAB to test the
effectiveness and validity of the proposed algorithm. Also, the studied distribution
networks have been simulated using the PowerWorld simulator to verify the
MATLAB results in addition to perform other evaluation tools. The obtained results
reveal that the proposed method is promising in distribution system reconfiguration.

Table of Contents
Chapter One: Introduction………………………………….………………………1
Chapter Two: Literature Review………………………….……………………..…3
2.1 Introduction……………………….……………..………………..……………….3
2.2 Heuristic Optimization Methods……………….…….…………..……………….4
2.3 Evolutionary Algorithms………………..………………………………………13
2.3.1 Genetic Algorithm(GA)………………………………………………………. 13
2.3.2 Fuzzy Logic…………………………………………………………………....16
2.3.3 Artificial Neural Network (ANN)…………………………………………..…17
2.3.4 Expert System (ES)………………………………………………………….…17
2.3.5 Particle Swarm…………………………………………………………………17
2.3.6 Tabu Search (TS)……………………………………………………………....17
2.3.7 Simulated Annealing (SA)…………………………………………………..…18
2.3.8 Evolutionary Programming(EP)…………………………………………….....19
2.3.9 Ant Colony Optimization (ACO)…………………………………………...….20
Chapter Three: Proposed Methodology………………………………..…………22
3.1 Problem Fromulation……………………………………………………...…….22
3.1.1 Mathematical Model…………………………………………………….…22
3.1.2 Objective Function………………………...………………………………23
3.1.3 Constraints………………………………………….……………………...24
3.2 Optimization Methods……………………………………………….………….25
3.3 Ant Colony Optimization(ACO)…………………………….…………………..27
3.3.1 Background….……………………………………………….…………….27
3.3.2 Characteristics of ACO method…………………………….……………...28
3.3.3 Differences between Real and Artificial Ants……………………………..29

3.3.4 Applications………………………………………………….…………..29
3.3.5 General Description of ACO……………………………………….……30
3.4 Proposed ACO Algorithm…………………………………………………..…31
Chapter Four: Developed Program and System Simulator……………………..36
4.1 Role of MATLAB Program and PowerWorld Simulator……………………….36
4.2 Developed MATLAB Program………………………………………………….36
4.2.1 Introduction………………………………………………………………..36
4.2.2 MATLAB System…………………………………………………………37
4.2.3 MATLAB Program of Proposed Algorithm……………………………….38
4.2.4 Program Flow Chart……………………………………………………….39
4.3 PowerWorld Simulation……………………………………………………...…40
4.3.1 Main Features……………………………………………………….……..40
4.3.2 Implementation of Studied Systems………………………………………40
Five Chapters: Application of Proposed Algorithms………………………..…..46
5.1 Introduction…………………………………………………………………….46
5.2 Test System 1:Baran and Wu System………………………………………….46
5.2.1 System Description……………………………………………..…………..46
5.2.2 Optimal Reconfiguration based on Power Loss Minimization…………..…48
5.2.3 Optimal Reconfiguration based on Load Balancing……………………..…49
5.2.4 Objective Function Comparison………………………………..….………49
5.2.5 Contours……………………………………………………………………51
5.2.5.1 Bus Voltage Contour……………………………………...……..…51
5.2.5.2 Power Loss Contour……………………………………….……….53
5.2.5.3 Line Current Contour……………………………………………....55
5.3 Test System 2:Taiwan System………………………………………………...57

5.3.1 System Description……………………………………………..………….57
5.3.2 Optimal Reconfiguration based on Power Loss Minimization……………59
5.3.3 Optimal Reconfiguration based on Load Balancing………………………60
5.3.4 Objective Function Comparison…………………………………………..61
5.3.5 Contours…………………………………………………………………..62
5.3.5.1 Bus Voltage Contour……………………………………………...62
5.3.5.2 Power Loss Contour……………………………………………....65
5.3.5.3 Line Current Contour……………………………………………..67
5.4 Test System 3:SEC System…………………………………...……………..69
5.4.1 System Description……………………………………….……………...69
5.4.2 Optimal Reconfiguration based on Power Loss Minimization………….71
5.4.3 Optimal Reconfiguration based on Load Balancing……….……………72
5.4.4 Objective Function Comparison………………………………………...73
5.4.5 Contours…………………………………………………………………74
5.4.5.1 Bus Voltage Contour……………………………………….....…74
5.4.5.2 Power Loss Contour……………………………………………..75
5.4.5.3 Line Current Contour…………………………………………....77
Chapter Six: Conclusion……………………………………………………….79
References………………………………………………………………………81
Appendix A: System Data .……...………………………………………………93
Appendix B: Single Line Diagram……………………………………………....102
Appendix C: MATLAB Program………..………………………………………106

List of Figures
Figure 3.1: Basic principle of Ant Colony Optimization…………………………28
Figure 3.2: Flow chart of the proposed algorithm…………………...……………35
Figure 4.1: Developed optimization program……………………………………..39
Figure 4.2: Opening a new case……………………………………………..…….40
Figure 4.3: Selecting components…………………………………………..……..41
Figure 4.4: Selected components values…………………………………………..41
Figure 4.5: Setting parameters of buses……………………………………………42
Figure 4.6: Setting parameters of lines……………………………………………42
Figure 4.7: Setting parameters of generator………………………………………42
Figure 4.8: Setting parameters of load…….………………………………………42
Figure 4.9: Setting the base power…………………………………………………43
Figure 4.10: Setting the base power value…………………………………………43
Figure 4.11: The final network…………………………………………...………..44
Figure 4.12: Running and solving the network…………………………………….44
Figure 4.13: Selection of the solution to be displayed………………………….….45
Figure 4.14: The solution values to be displayed………………………………….45
Figure 5.1: Baran and Wu system for test case 1………………………………….47
Figure 5.2: Evaluation of Baran and Wu system configurations……….…………50
Figure 5.3: Bus voltage of Baran and Wu system of the initial configuration……51
Figure 5.4: Bus voltage of Baran and Wu system of the optimal configuration for
power loss minimization……………………………………………..52
Figure 5.5: Bus voltage of Baran and Wu system of the optimal configuration for
load balancing…………………………………….…………………..52
Figure 5.6: MW loss of Baran and Wu system of the initial configuration……….53

Figure 5.7: MW loss of Baran and Wu system of the optimal configuration for
power loss minimization……………………………………………...54
Figure 5.8: MW loss of Baran and Wu system of the optimal configuration for
load balancing……………………………………………………...….54
Figure 5.9: Line current of Baran and Wu system of the initial configuration…….56
Figure 5.10: Line current of Baran and Wu system of the optimal configuration for
power loss minimization………………………………………………56
Figure 5.11: Line current of Baran and Wu system of the optimal configuration for
load balancing……………………………………….……………..…57
Figure 5.12: Taiwan distribution system for test case 2…….…………………..…58
Figure 5.13: Evaluation of Taiwan network configurations…………….…..…..…62
Figure 5.14: Bus voltage of Taiwan network of the initial configuration…………63
Figure 5.15: Bus voltage of Taiwan network of the optimal configuration for
Figure 5.16: Bus voltage of Taiwan network of the optimal configuration for
load balancing……………………………………….………………...64
Figure 5.17: MW loss of Taiwan network of the initial configuration………..…...65
Figure 5.18: MW loss of Taiwan network of the optimal configuration for
Figure 5.19: MW loss of Taiwan network of the optimal configuration for
load balancing………………………………………….……………...66
Figure 5.20: Line current of Taiwan network of the initial configuration…………68
Figure 5.21: Line current of Taiwan network of the optimal configuration for
power loss minimization……………………………………………..68

Figure 5.22: Line current of Taiwan network of the optimal configuration for
load balancing……………………………………….………………..69
Figure 5.23: SEC distribution system………………………..……………………70
Figure 5.24: Bus voltage of SEC network of the initial configuration……...….…74
Figure 5.25: Bus voltage of SEC network of the optimal configuration……...…..74
Figure 5.26: MW loss of SEC network of the initial configuration…..….…...……75
Figure 5.27: MW loss of SEC network of the optimal configuration………...……76
Figure 5.28: Line current of SEC network of the initial configuration…….…...…77
Figure 5.29: Line current of SEC network of the optimal configuration…….… ..77

List of Tables
Table 3.1: Analogy between Real and Artificial Ants…………………………….…29
Table 5.1: Meshed loops of Baran and Wu system………………………….………48
Table 5.2: Results for power loss minimization of Baran and Wu system………….48
Table 5.3: Results for load balancing of Baran and Wu system…………………….49
Table 5.4: Meshed loops of Taiwan system……………………...………….………59
Table 5.5: Results for power loss minimization of Taiwan system………….………60
Table 5.6: Results for load balancing of Taiwan system……………………...…….61
Table 5.7: Meshed loops of SEC system…………………………………....……….71
Table 5.8: Results for power loss minimization of SEC system………………..…...72
Table 5.9: Results for load balancing of SEC system……………….………..….….73

List of Symbols
t: Network Configuration………….…………….……………………………...……22
C(x,ti): Objective Function…………………………………...…..……………..……22
x: Operating State…………………………...………………………………………..22
n: Number of Nodes…………………………….…………………………….….…..22
F(x,ti): Equality Constraint Variable………………………….………………….….23
G(x,ti): Inequality Constraints Variable………...…………………………………....23
P: Branch Active Power……………….……………………………………………..23
Q: Branch Reactive Power…………………………………………………………...23
V: Voltage Magnitude……………….………………………………………………23
C1(x,ti): Power Loss Minimization……..……………………………………………23
i: A branch………………...………………………………………………………....23
Ii: Branch Current………………………………………….…………...……………23
Ri: Branch Resistance………………………………………………………………..23
m: Number of Network Branches……………………………………………….…...23
C2(x,ti): Load Balancing Index…….………………...………………………………24
C3(x,ti): Voltage Deviation Index…………………...……………………………….24
N: Total Number of Nodes………………………………………..…………………24
Imax: Maximum Branch Current……………………………..……….……………..24
Visp: Specified Voltage Magnitude…………………………………………..………24
Vimax: Maximum Voltage Magnitude………………………………………..………25
Vimin: Minimum Voltage Magnitude………………………………………..……….25
Si: Branch Complex Power………………………………………………………….25
ß: Heuristic Parameter Importance…………………………………………………..32
α: Pheromone Parameter Importance……………………………………………….32

ρ: Pheromone Evaporation Parameter for Local Updating ………………………….32
μ: Pheromone Evaporation Parameter for Global Updating ………………………...32
Sk(i,j): Antk State Selection……………………………… ………………………….32
S1 and S2: Antk State Selection of Random Number…………………………… …..32
τ (i , j ) : Deposited Pheromone …………………………………………….………...32
η (i , j ) : Heuristic information …………………………………………….………..32
k: An ant ……….…………………………………….……………………………....32
q: Random Number Uniformally Distributed [0,1] ………………………………….32
q0: Random Parameter between [0,1] ………………...……………………………...32
i and j : Current and Next State Selected by Ants ………………………...………..32
Nk(i): Tabu List…………………………………………………….………………...32
C0: Random Parameter between [0,0.4] ………………..………….………………...33
C1: Random Parameter between [0.8,1] ………………...…………………………..33
n0 and n1: Iteration Frequency……... ………………...…………...………………..33
nmax: Maximum Iteration Frequency ………………...………….…………………..33
τ o : Initial Pheromone……………… ………………...……………………………..33
Q : Constant between 1 and 10,000……………………...…………………………..34
Lk: Best Objective Function ………………...……………………………………….34
∆τ (i , j ) : Change in Pheromone ………………...……………………...…………..34
m: Number of States………………. ………………...…………………….………..34

CHAPTER ONE
INTRODUCTION
In the past decades, there have been many advances in communications and data
processing. There is an increasing trend to automate the distribution system. The
automation can improve the reliability, efficiency and service quality of the system. It
has become possible to install distribution operating center to monitor and control the
distribution networks as well as reconfiguring the distribution system to reduce the
power losses and balance loads under normal operating conditions.
Distribution networks have two types of switches, sectionalizing switches that are
normally close and tie switches that are normally open. The distribution system has
multi substations and multi feeders, so that any load in the system can be supplied
more than one route. Accordingly, the distribution system can be reconfigured by
changing the status of sectionalizing and tie switches. The reconfiguration is applied
to achieve the following:
• Power loss reduction.
• Load balancing.
• Service restoration after fault occurrence.
• Voltage deviation minimization.
The goal of this research is to optimize the configuration of distribution system for
power loss minimization and load balancing by using the ant colony optimization
(ACO) method. The developed algorithm is applied to three distribution systems
having different scales among them is a part of the Saudi Electric Company system
(SEC).

Network reconfiguration is a combinatorial optimization problem. So, a method is
needed to quickly find the network reconfiguration which minimizes the total real
power losses of the network and balances loading which satisfying all of the system
constraints. Several methods have been applied to solve this problem with varying
degree of success. Some methods find suboptimal solution rapidly and other find
optimal solution with more computation time.
Through this thesis an approach based on ant colony optimization has been used to
solve the reconfiguration problem. This thesis consists of five chapters that discuss
the topic. A literature review about optimization methods has been discussed in
chapter Two. In chapter Three the reconfiguration problem is formulated as single
objective optimization problem with equality and inequality constraints as well as a
comparative study among optimization methods has been done and the proposed
method has been selected. Also, it presents a background about the proposed method
and discusses solution algorithm. A computer program to solve the reconfiguration
problem using the proposed method and the simulator software have been discussed
in chapter Four. In chapter Five the proposed method is tested on three distribution
systems and numerical results are discussed. Finally, the conclusions are presented in
chapter Six. At the end of the research, three appendices are attached.

CHAPTER TWO
LITERATURE REVIEW
2.1 Introduction
Distribution automation is one of the hot issues in power systems. The distribution
systems are automated to improve their reliability, efficiency, and service quality.
The explosive growth in the field of computer microprocessors and
telecommunication technologies provide opportunities for advanced control of
electrical power system, particularly in the field of distribution system automation. It
is possible to install distribution operation center when the network is constantly
monitored and control actions can be made remotely. One of the actions that can
benefit from distribution automation is the network reconfiguration that can be
oriented to different objectives.
In a distribution system, each feeder has a different mixture of commercial,
residential, and industrial type loads. These load types have different daily patterns
which make the peak load of feeders occur at different times. In normal operating
conditions, part of loads can be transferred from heavily loaded to relatively less
heavily loaded feeders by network reconfiguration.
Distribution feeders contain number of switches that are normally closed
(sectionalized switches) and switches that are normally open (tie switches).
Distribution network reconfiguration is the process of altering the topological
structure of distribution network by closing the open/ close status of sectionalizing
and tie switches. When the operation conditions change, network reconfiguration is
performed by the opening / closing of the network switches under the constraints of

transformer capacity, feeder thermal capacity, voltage drop and radiality of the
network. Network is reconfigured for the following objectives:
• Reducing power losses.
• Relieving overload (balance loading).
• Reducing voltage deviations.
• Restoring the system.
The distribution network reconfiguration is a complex combinatorial optimization
problem. This is because there are multiples of constraints which must not be
violated while finding an optimal or near optimal solution to that problem.
2.2 Heuristic optimization methods
Several methods have been proposed to solve the reconfiguration problem. In
1975, Merlin and Back [1] proposed a branch and bound type heuristic method to
determine the network configuration for minimum line losses. Its solution scheme
starts with a meshed network by initially closing all switches in the network. The
switches are then opened one at a time until a new radial configuration is reached. In
this process the switch to be opened at each stage is selected in order to minimize line
losses of the resulting network. The principal advantages of this method are:
• The final network configuration is independent of the initial stage of
the network switches.
• The solution process leads to the optimum or near optimum
The major drawbacks are:
• Loads are assumed purely active and are represented by current
sources that are fixed regardless of the changing network
configuration.
• Network voltage angles are assumed negligible.

• Network constraints are neglected.
Shirmomohammadi and Hong [2] improved the method of Merlin and Back. As a
result, it shares the two principle benefits of that methodology, convergence to the
optimum or near optimum solution and the independent of the final solution from the
initial status of the network switches. At the same time, this method avoids all the
major drawbacks of Merlin and Back.
Civanlar [3] developed a branch exchange method. In this method, loss reduction
is achieved by exchange operation corresponds to the selection of a pair of switches,
one for opening and the other for closing so that the resulting network has lower line
losses while remaining connected and radial. The major drawbacks of this method
are:
• The final network reconfiguration is dependent on the initial state of
the network switches.
• Optimum solution is not guaranteed.
• Selection of each switches exchange operation becomes very time
consuming.
Baran and Wu [4] presented a heuristic reconfiguration methodology based on the
branch exchange to reduce losses and balance the loads in the feeders. To assist in the
search, two approximated load flows for radial networks with different degrees of
accuracy are used. They are simple Dist flow method and back and forward update of
Dist flow method. The method is very time consuming due to the complicated
combinations in large scale system and converges to a local optimum solution, that is,
convergence to the global optimum is not guaranteed.
Glamocanin [5] formulated the reconfiguration problem as transshipment with
quadratic costs using the quadratic simplex method. The network starts with just the

distribution substations and the feeder segments are switched in one at a time. Of the
segment available to switch in, the one with minimum unit transshipment cost is
chose first. The linearlized transshipment cost was defined as the segment capacity
times resistance, so it does not depend on load. Then, of the other segment available
to serve that new load point, the chosen segment is checked to make sure it results in
minimum increase in losses. This search does not necessary guarantee global optima.
Safri and Chikhani [6] defined a new set of heuristic rules for distribution system
reconfiguration problem. The rules have been developed with the objective of
reducing losses directly and make an effort quantize the suitability of switching
options. The proposed method serves as a preprocessor to a reconfiguration algorithm
removing undesirable switching options without the need to perform a complex load
flow analysis.
Peponis [7] used a combined method the switch exchange (SEM) and sequential
switch opening method (SSOM) for reconfiguration of the network for loss reduction.
Its two main advantages are:
• Optimum or near optimum configuration is obtained using one
of the two basic methods, SEM where closing switch and
opening another in the loop formed. SSOM where all ties
switches are initially closed and an optimal load flow is
obtained. The system is returned to a radial configuration by
successive opening of the switches having the least current
flow until network radiality is obtained.
• Optimum capacity size and location are determined by using a
method based on dynamic programming technique.

SEM requires less computation time and SSOM is independent from the initial
configuration and thus more likely leads to the actual optimum.
Broadwater and Khan [8] suggested a reconfiguration algorithm calculates switch
patterns as a function of time. Either seasonal or daily time studies may be
performed. Both manual and automatic switches are used to reconfigure the system
for seasonal studies where as only automatic switches are considered for daily studies.
Such a continuous reconfiguration is allowed by today's distribution automation,
information technology and equipment. It is shown that switching at the system peak
can reduce losses but cause a marginal increase in system peak. The practical aspects
of such an optimization remain to be carefully analyzed through costs, transient effect
and influence to system reliability.
Chiang and Darling [9] proposed an efficient algorithm for real network
reconfiguration on large unbalanced distribution networks where the aim is to change
the network topology as needed for loss reduction and load balancing in response to
system and load variations.
Safri [10] proposed an algorithm that is based on network portioning into groups of
load buses such that the line section losses between the groups of nodes are
minimized, the proposed method overcomes the size restriction imposed by
reconfiguration techniques. By dividing the distribution network into groups of
buses, the combinatorial nature of reconfiguration problem is overcome while
simultaneously minimizing losses.
Bouchard and Salma [11] represented the distribution system buses and sections as
adjacency and incidence matrices. Three algorithms are used for reconfiguration.
The first determines the admittance matrix for a feeder. The second algorithm
performs a brand exchange between two feeders ensuring no loads are left

disconnected from the system and that the system's radial configuration is minimized.
The third updates system data from the new configuration.
Fan and Zhang [12] attempted to provide an analytical description and a systematic
understanding about the single loop optimization approach via qualitative analysis. It
formulates the problem of network reconfiguration for minimum loss as an integer
optimization problem with a quadratic objective function, 0-1 type state variables can
linear constraints equation with sate dependent formulas. This non-linear integer
programming problem, if it linearlized, could be approximately represented by an
integer linear programming (LP) problem. This leads to the consideration of applying
the concept of simplex method normally used for solving LP problems which in turns
lead to the direct deviation of the single loop optimization approach. In addition, an
efficent and simple scheme to calculate load flow and loss change in the network after
a switch exchange in a loop is presented. A heuristic procedure is then developed to
obtain the optimal switch plan by eliminating those unnecessary switch operations
during the iterative solution procedure of the single loop optimization approach to
accomplish the transition from the initial configuration to the optimal configuration.
Borozan [13] analyzed the influence of load imbalances on the minimum loss
configuration solution for that purpose; a heuristic method for reconfiguration of
unbalanced distribution networks in order to reduce their resistive line losses is
developed. The method is direct extension of the improved method for loss reduction
in distribution networks by Borozan[ 14 ] from single to three phases.
Rudnick [15] modified the solution method proposed by Baran and Wu where
requires a large amount of load flow calculations, and due to the great computation
effort. In this method a simplified non iterative calculation method that allows
calculating the power flows and the bus voltage with reasonable accuracy, reducing

the computation effort. This method called simplified power summation method.
Zhou described a new feeder reconfiguration algorithm for the purpose of reducing
the operating cost in the real time operation environment. The methodology
developed is a heuristic based approach. It focuses on minimizing the cost of
operation over a specified period rather than simply reducing losses for a fixed
operating point.
Taleski [16] proposed a heuristic minimal loss method based oriented ordering of
elements, statistical representation of load variations and energy summation of loss
evaluation, all together combined in the energy summation method for computation of
energy losses. Basically, the method belongs to the branch exchange techniques.
Possible loops in the network are analyzed and reconfigured one at a time. The
reconfiguration is performed by closing the open tie switch that defines the loop and
opening the switch in the branch that produces maximum savings in energy losses.
The candidate branch to be opened is chosen using a similar approximate technique
by Civanlar but applied to energy losses rather than the power losses. The order by
which the loops are analyzed and reconfigured is determined by heuristic rules.
Zhou [17] provided a real time operation decision support tool using a combination
of optimization techniques with heuristic rules and the fuzzy logic approach to obtain
an efficent and robust performance.
Lin and Chin [18] developed a new approach for the distribution network
reconfiguration to minimize losses. The algorithm adopts a switching index to get a
proper set of switching operations. Switching indices were defined by using branch
voltage drops and line constraints. In normal operational state, switches with the
largest index in each loop are considered for switching.

Kashem [19] proposed distance measurement technique (DMT) based on branch
exchange algorithm for load balancing. The method is based on two stages. Initially
a graphical representation is used to determine the loop that gives the maximum
improvements in load balancing. Then, the switching operation can be executed in
that loop to get the maximum improvements in load balancing. Using the proposed
technique the optimal or near optimal solution is achieved with improved load
balancing and reduced computation effort.
McDermott [20] presented a heuristic constructive algorithm that starts with all
operable switches open and at each step closes the switch that results in the least
increase in the objective function. The objective function is defined as incremental
losses divided by incremental load served. A simplified loss formula is used to screen
candidate switch but a full load flow after each actual switch closing maintains
accurate loss and constraint information. A back tracking option mitigrates the
algorithm's greedy search to avoid local minima. This algorithm takes more
computation time but it models the constraints and control action more accurately.
Kashem [21] proposed a new algorithm for enhancing the voltage stability by
network reconfiguration. Initially, a certain number of switching combinations is
generated using the combination of tie and its two neighboring switches at the best
combination of switching for maximizing the voltage stability in the network among
them is determined. This search is extended by considering the branches next to the
open branches of the beat configuration only by one to check whether there is any
other switching combination available which give further improvements in voltage
stability.
Kashem [22] proposed an efficient method (novel method or switching algorithm)
to identify the optimum configuration for loss minimization. At the beginning of the

proposed method, all possible switching options obtained from the combination of the
tie switch and its two neighbors are selected and the infeasible combinations in the
selection are omitted. The minimum loss configuration in the selected combinations
is identified. Finally, an exhaustive search is carried out by changing the switching
status one at a time, by either moving to left or to the right of the open branch in the
configuration obtained and the configuration with maximum loss reduction is
determined.
Mortan and Marlees [23] suggested a brute force algorithm for determining a
minimal loss radial configuration using an exhaustive search algorithm. The graph
theory involving semi sparse transformations of a current sensitivity matrix were used
which guaranteed a globally optimal solution but needed an exhaustive search.
Delbem [24] presents the graph chain representation to reduce significantly the
number of reconfigurations that a reconfiguration algorithm would have to analyze.
Ebrahimi and Mohseni [25] proposed a heuristic fuzzy reasoning based method for
multipurpose reconfiguration. One of the difficulties that appear in this method is to
distinguish and choose configurations representing the radial feeders.
Ramos [26] proposed new solution takes into account the status of all branches in
the network and at the same time introduces some approximations to reduce
computation times. The main idea consists of defining binary variables to model the
network topology incorporating them into the optimization problem. No load flow
solution is required throughout the process since branch losses are taken into account
by means of well established simplified expressions.
Radha [27] presented an integration of two algorithms; a network topology based
three phase distribution power flow algorithm and an algorithm for determining
power loss of a radial configuration of power distribution network [14].

Wu and Zhang [28] introduced a loop flow analysis when a novel concept of
optimal matching loop flow, which is firmly based on loop analysis in basic circuit
theory, is developed and used to reconfigure distribution network. Based on this
concept an efficient algorithm is proposed. It is based on closing all tie switches to
form a meshed network first, and then calculating the optimal matching loop flows to
produce a radial network with minimum losses. The solution method can consider the
interaction between loops and therefore it is very efficient.
Buen and Cavellucci [29] presented a methodology considered the variable
demand to discuss the loss reduction during the planning period. Their contributions
are a careful analysis of the loss reduction problem with variable demands and two
heuristics approach to solve the problem considering an unchanged configuration
during the whole planning period.
Wu and Yu [30] presented a global optimization method for solving the snapshot
and time varying reconfiguration problem for large scale electronic power distribution
network. The snapshot reconfiguration problem using single snapshot of the network
loading condition is solved using two steps: firstly, search for the local optimum by
Dijkstrass shortest path algorithm and form core schema chromosome by core schema
algorithm. Secondly, search possible core schema chromosome for the global
optimization by employing genetic algorithm.
Lorenzeti and Castro [31] proposed a heuristic method to improve voltage stability
constraints for reconfiguration of distribution system. The effectiveness of the
candidate switching options is evaluated through the voltage stability index
calculation proposed by Gubinc and Strmcnic. A back and forward sweep load flow
method is used for computing the network operating state after switching operation
candidate is selected and taken into effect. Also, an approximate voltage update

method is used to evaluate the effectiveness of each switching candidate during the
reconfiguration process. The use of these methods guarantees a very good
performance in terms of computation effort and precision.
Gomes and Garcia [32] proposed a heuristic method based on optimal power flow
in which the branch switches status is represented by continuous functions. The
proposed method starts with a meshed distribution system obtained by considering all
switches closed. Then, the switches are opened successively to eliminate the loss.
Those methods above discussed solving the reconfiguration problem to achieve
various objectives. They are either heuristics with fast and local optimum solution or
a blend of heuristics and optimizations guarantee the global optimum with much
computation time.
2.3 Evolutionary Algorithms
2.3.1 Genetic Algorithm (GA)
Nara [33] used the genetic algorithm (GA) which is a search algorithm based on
the mechanism of natural selection and natural genetics. It combines the adaptive
nature of the natural genetics or the evolution procedure of organs with functional
optimization. The simple feature of GA makes it suitable for different multiobjectives
optimization problem. The principle problem in using GA rests on an efficient coding
and decoding mechanism of the chromosome representing the distribution network
and the structure of fitness function.
Fudou and Fukuyama [34] presents a GA using three phases unbalanced load flow.
A proper string representation for loads and power supplies is devised and a method
to yield a good problem dependent initial string population is presented. A repair
operator which modifies the string so as to improve the objective function of the
problem and to satisfy the radial network constraints. A modification to the fitness

function is made to reinforce the satisfaction of the power source limits and voltage as
well as current constraints.
Zhou [35] refined the GA method by modifying the string structure and fitness
function is approximated fitness function which leads directly to unreliable solutions.
Some improvements are made on chromosome coding (real coding), fitness function
and mutation patterns. Among these improved features, an adaptive process of
mutation is developed not only to present premature convergence but also to produce
smooth convergence.
Lin and Cheng [36] proposed a refined GA (RGA) that takes advantage of the
optimal flow pattern [2], GA and the Tabu search (TS). Cross over and mutation
were combined in RGA.
Xiaming and Xiangen [37] used the loop coding technique to reduce the length of
chromosome and the tree decoding used for back suppressor power flow algorithm to
get the lose of net.
Ming and Pengxiang [38] proposed an improved GA which making use of the
feature of radial distribution system, a chromosome coding method and gene
operation strategies were developed. Cross over operations were defined as to
exchange between templates which mutation operations and inversion operations are
restricted in templates. Above strategies greatly reduce the infeasible solution which
produces during gene operations. Further, a simplifying power distribution method
was also proposed to reduce the length of the chromosome and reciprocal value of the
active power losses to be fitness function.
Yu and Wu [39] proposed an efficient global optimization algorithm for large scale
distribution network reconfiguration problems named core schema genetic shortest
path (CSGSA) is proposed. CSGSA changes from branches combination to loads

combination. CSGSA has a powerful global optimum rapidly using core schema
algorithm.
Huang [40] proposed an enhanced GA based on fuzzy multiobjectives approach
maximizing the fuzzy satisfaction allows the operator to simultaneously consider the
multiple objectives of the network reconfiguration to minimize the power loss,
deviation of voltage and current constraints as well as switching number, which
subject to a radial network structure in which all loads must be energized.
Radha [41] proposed real coded GA using a fixed cross over probability of 0.7 and
adaptive mutation probability.
Radha and King [42] solved the problem with implementation simplicity,
computation efficiency, solution feasibility and optimality a modified GA with real
valued genes and adaptive mutation rate is proposed. This approach obtains global
optimum solution in less time than exhaustive search (brute force) followed by
heuristic method. The genetic string is in a shortened format to minimize the required
memory and to ensure search efficency.
Wang and Li [43] proposed a kind of GA aiming at power system i.e. predigest ion
of distribution networks, chromosome encoding strategy and improved clonal GA
based on the main genetic operator of clonal GA and its nature. It can be used to
reduce the unsolvable code of the distribution system reconfiguration to enhance the
rate of the solvable code and to accelerate the calculating process.
Parsad and Ranjan [44] proposed an improved GA where efficient and improved
coding and decoding technique for the chromosome representing the network. The
attractive feature is the application of standard genetic operators i.e. crossover and
mutation does not destroy the radial property of the chromosome (network) and much
computation time is served in the process. As efficient search of the global search

space is done by a suitably designed fitness function to satisfy the network
constraints.
2.3.2 Fuzy Logic Method
King and Radha [45] used a fuzzy logic controller to adapt the cross over and
mutation probabilities based on the fitness function. The main advantages of fuzzy
control system over the conventional method are: ability of modeling the quantitive
aspects of human knowledge and reasoning process, model free estimator, robustness,
and easy implementation. The fuzzy logic controlled GA always finds the global
optimum and has proved to have faster convergence than a GA using fixed cross over
and adaptive mutation.
Parsad and Ranjan [46] presented efficient coding and decoding chromosome
which represented the network. The advantage of this coding and decoding scheme is
that at every stage of genetic operations, then network remain radial and islanding of
load points are prevented. Also, fuzzy modeling of mutation probability in the
genetic paradigm.
Hong and Ho [47] presented a method based on integration of both GA and fuzzy
multiobjectives programming for network reconfiguration. A node encoding based on
Prufer number in GA is addressed for obtaining a radial structure in the distribution
system. The Prufer number encoding can avoid the tedious “mesh check” algorithm.
It can be proved that the prufer number encoding requires only (N-2) bits for encoding
which is less than that required by the traditional branch encoding methods.
Parsad and Ranjan [48] proposed a fuzzy mutated GA which overcomes the
combination nature of the reconfiguration problem and deals with non continous
multiobjectives optimization. The attractive features of the algorithm are:
presentation of radial property the network without islanding any load points by an

elegant coding scheme and an efficient convergence characteristics attributed to a
controlled mutation using fuzzy logic.
2.3.3 Artificial Neural Network
Kim [49] presented the strategy of feeder reconfiguration to reduce the power loss
by artificial neural (ANN) network. This approach developed is basically different
where are the aspects that the load transfer and the corresponding load flow solution
during the search process are not required. The training set of ANN is the optimal
system topology corresponding to various load patterns which minimizes the load
under given conditions.
Bouchard and Chikhani [50] presented a Hopfield neural network for optimization
problem because the solution is determined collectively is very short time by a large
number of neurons. The results show the network did not converge to a valid solution
for the network.
2.3.4 Expert System
Taylor and Lubkeman [51] presented an expert system using heuristic rules to
shrink the search space for reducing the computation time. However, only a feasible
solution can be obtained for knowledge based method.
Lin [52] presented a rule based expert system with a colored perti net (CPN)
algorithm for load balancing of distribution system. CPN models of the distribution
components such as four ways line switches are proposed to derive the proper
switching operation.
2.3.5 Particle Swarm Method
Jin and Zhao [53] presented method based on binary particle swarm optimum for
load balancing. It is inspired by the social behavior of a flock of migrating birds
trying to reach an unknown destination. Each solution is a ‘bird’ in the flock and is

referred as a ‘particle’. A particle is analogous to a chromosome in GA. The method
is efficient in searching for the optimal solution.
2.3.6 Tabu Search Method
Li and Chen [54] introduced an efficient and robust method based on tabu search
(TS) technique which is a recent member in the family of modern heuristics methods
to solve the problem of network reconfiguration in distribution system to reduce the
line losses under normal operating conditions. TS is a heuristic optimization
technique obtains the optimal solution of combinatorial optimization problem. The
novel variable “upward node expression” approach is adopted and an efficient scheme
is integrated to restrict each trial solution in radial network formats (speeding up).
The other components of TS are neighborhood design, evaluation function design and
tabu list.
Mori and Ogita [55] proposed parallel TS to reduce the computation effort and
enhance the solution accuracy by the TS. A couple of strategies are introduced into
TS. One is to decompose the solution neighborhood of TS into the
subneighbourhood. The other is to consider different tabu lengths that make solution
more diverse.
Fukuyama [56] proposed the reactive TS to solve the problem of a parameter
tuning of conventional Meta heuristics like GA, SA, and TS. RTS proposes the
introduction of feedback (reactive) schemes in heuristics of discrete optimization
problem. RTS is one of the RS methods and it has feedback based tuning mechanism
of tabu length and automated balance mechanism of diversification and
intensification.

2.3.7 Simulated Annealing Method
Chiang and Jumeu [57], [58] proposed a two solution algorithm for general
combinatorial optimization problem for reconfiguration. The first stage is to find a
global no inferior point by applying the modified simulated annealing (SA) technique
for the multiobjectives problem. The second stage applies the € constraint method to
find accessible non inferior solution by adjusting the €’s according to the global non
inferior point obtained from stage one and a trade off choice made by the designer.
To speed up the computation time the appropriate calculation is explored and
incorporated into the solution algorithm by employing two efficient load flow
methods with different degree of accuracy.
Jeon and Kim [59] proposed simulated annealing (SA) for solving combinatorial
optimization problem because SA can avoid local minima but an excessive
computation time is required. To overcome this major limitation of SA, a modified
SA and cost function with penalty factor are used.
Carpento and Chicco [60] proposed SA algorithm to perform global optimization
but high computation time limits their acceptability for the optimization of real
distribution system.
Gracia and Lopez [61] proposed and evaluated the reconfiguration problem for
minimum loss using SA and a radial load flow. The proposed technique has an ability
to avoid becoming trapped at local minimum. The SA algorithm does not require or
deduce derivative information it merely needs to be supplied with an objective
function for each trial solution it generates.
2.3.8 Evolutionary Programming
Song and Wang [62] presented a fuzzy controlled evolutionary programming
method (FCEP) to overcome the shortcomings caused by the fixed mutation rate in

the evolutionary programming (EP). This method improves the performance of EP.
First, a FCEP based on heuristic information is proposed. The designed mutation
fuzzy controller adaptively adjusts the mutation rate during the evolutionary process.
Then, status of each switch in distribution system is normally represented by a binary
controlled parameter 0 or 1. The length of string is much shorter than the one in GA
[33]. In addition, a chain table and depth breadth search strategy is employed to
further speed up the optimization process. The equality and inequality constraints are
inserted in the fitness function by some penalty factors to guarantee the optimal
solution by the FCEP feasible.
Hsiao and Chien [63] developed a fuzzy satisfied method based on EP to solve the
constrained multi-objectives problem. The proposed algorithm enables the optimal
feeder reconfiguration problems to be treated with multi-objectives to obtain the
optimal solution.
Su and Lee [ 64] proposed improved mixed integer hybrid differential evolution
(MIHD) to improve the migration operators by applying acceleration and migration
which lead to a smaller population for the solution search with global optimum and
less computation time.
Hsiao [65] modeled the multiple objectives such as power loss, voltage quality,
reliability and number of switching using fuzzy sets to evaluate their imprecise nature
and for ease of integration. Then, EP method is used to solve the constrained
multiobjectives problem.
Chiou and chang [66] proposed variable scaling hybrid differential evolution
(VSHDE) to overcome the fixed and random scaling factor which lead to a faster
convergence with a high probability of obtaining the global optimum.

Delbem and Bretas [67] proposed a new tree encoding based graph chains to
improve the performance of evolutionary algorithms.
2.3.9 Ant Colony Optimization Method
Carpento and Chicco [68] presented a new application of ant colony search
algorithm to the optimal reconfiguration of distribution systems with the objective of
minimizing the distribution system losses in the presence of operational constraints.
Ahuja and Pahwa [69] presented the use of ant colony optimization for solving
feeder reconfiguration problem for loss minimization. This method has proved to be
an efficient technique for solving combinatorial optimization problem such as
traveling salesman problem and sequential ordering problem. Also, they found that
the method is well suited for network reconfiguration.
Su, Chung and Chiou [70] proposed a method employing the ant colony search
algorithm to solve the network reconfiguration problems. The merit of the algorithm
is parallel search and optimization capabilities. They found that this method is better
than SA and GA comparing with the same system used with the two methods.
Charles, Khan and Rarichandrson [71] proposed a new methodology based on ant
colony system algorithm for the network reconfiguration. The method is very flexible
and global optimum in presence of constraints. It has some good characteristics such
as positive feedback, distributed computation and greedy heuristic that make the
algorithm to be the best suitable method for network reconfiguration.

CHAPTER THREE
PROPOSED METHDOLOGY
3.1 Problem Formulation
The main objective of network reconfiguration is to find the network which is
having economical losses during any desirable conditions exists in the network. Each
configuration of the distribution system is defined by the status of switches.
Let t denotes the current configuration of distribution system when operating
state is specified by x and C(x,t) be the objective function. A configuration t is a valid
solution to the problem if it satisfies certain constraints. The corresponding state x
must be satisfied these constraints:
• Electrical constraints that includes Kirchhoff’s current and voltage
laws.
• Operational constraints that includes the physical limitation of
network components.
• Load constraints that require maintaining the voltage within
appropriate bounds.
The objective function is to find a network configuration t which minimizes
C(x,t) while satisfying all of the above constraints.
3.1.1 Mathematical Model
Given a distribution network with n nodes. The problem is a combinatorial non
linear optimization consists on finding an optimal radial network t* among all possible
radial networks ti generated with the switch condition changes that minimizes the
objective function without violation of the constraints. The mathematical model can
be expressed as

min C ( x, t i ) (3-1)
subject to
F ( x,t i ) = 0 (3-2)
G ( x,t i ) ≤ 0 (3-3)
x = ( P , Q, V ) (3-4)
where
C(x,ti) is the objective function
F(x,ti) is the vector of equality constraints and represents the load flow equations.
G(x,ti) is the vector of inequality constraints and corresponds to certain constraints
for the network.
P and Q represent the active and reactive power of the receiving end of the branch in
the network.
V corresponds to the magnitude of the voltage of the system’s nodes.
3.1.2 Objective Function
i) Minimization of Real Power Losses
This objective of the model describing the studied problem is to minimize the
system power losses subject to operating constraints under a certain load pattern.
This model can be expressed as follows:
m
C1 ( x, t i ) = ∑ I i2 ⋅ Ri (3-5)
i =1
where
i is any feeder branch.

m is the number of network branches.
Ri is the resistance of branch i.
Ii is the current magnitude flows in branch i.
ii) Load Balancing
The objective function is formulated as minimization of branch load balancing to
avoid heavy loading of any part of the electrical distribution system. The branch
current index is good measures of load balancing and defined as
m
I i2
C 2 ( x, t i ) = ∑ 2
(3-6)
i =1 I max
Where
Ii is the current flowing through the branch i.
Imax is the maximum capacity or rating of branch i.
m is the number of network branches.
iii) Minimization of Voltage Deviation
In order to quantify the extent of violation of limits imposed on voltages (Vi) at all
buses in an electrical distribution system, the system voltage deviation index is
defined as
N
C 3 ( x, t i ) = ∑ Vi − Vi sp (3-7)
i =1
Where
N is the total number of nodes.
Visp is the specified voltage of bus i and is taken as 1.0 per unit in this study.
3.1.3 Constraints
The objective function is subjected to the following constraints:
• Radiality which means that no loops are allowed in the network.

• The loads must not be isolated without output supply from any feeder.
• Operating voltage at each node must be in safety range
Vi min ≤ Vi ≤ Vi max (3-8)
• Power flow at each node must be kept in balance and power flow at
each branch must be less than or equal its maximum capacity.
S i ≤ S imax (3-9)
3.2 Optimization Methods
Several methods have been proposed to solve the reconfiguration problem
i) Heuristic Methods
Many papers used this technique to solve the reconfiguration problem to different
objective functions. The solution process leads to the optimum or near optimum in
less computation time.
ii) Fuzzy Logic
It uses the logic rules and does not require load flow solution. This method can
solve a multiobjevtive optimization problem. The global optimal solution can be
obtained with fast time. There is a difficulty in maintaining the radiality.
iii) Genetic Algorithm
It is a search based on the mechanism of natural selection and natural genetics. It
can be used to solve the multiobjective optimization problem. This method depends
on the efficient coding and decoding of the chromosome and the structure of the
fitness function. It converges smoothly to global optimum with less time computation
and the radiality is maintained.

iv) Artificial Neural Network method
This approach is different where the aspects that the load transfer and the
corresponding load flow solution during the search process are not required. It needs
a large number of neurons and leads to divergent solution in the large system.
v) Expert System
The search space is shrunk using heuristic rules to reduce the computation time.
Only a feasible solution can be obtained for knowledge based method.
vi) Tabu Search
It enhances the solution accuracy to get the global optimal with less computation
effort. It is an efficient and robust method and can be implanted in parallel.
vii) Simulated Annealing
This method can avoid local optima but requires an excessive computation time.
viii) Evolutionary Programming
This method uses a fixed mutation rate that leads the convergence to local optima.
ix) Ant Colony Method
It is a recent method for solving hard combinatorial optimization problems. It
mimics the behavior of real ants. It uses the heuristic information of the problem and
the pheromone trails to build the solution and guides the search.
In this research, the ant colony optimization method is used for the application of
optimal reconfiguration of distribution system. The next section introduces a
comprehensive description of this optimization method.

3.3 Ant Colony Optimization
3.3.1 Background
The ant colony optimization (ACO) method was introduced by Marco Dorigo in
his doctoral thesis in 1992 [72]. It models the living style of ant, mimicking how ants
find their way to a food source from their colony and back again. It was first applied
to traveling salesman problem (TSP). [ 73-79]
Ants are social insects living in colonies with interesting foraging behavior. In
particular, an ant can find shortest paths between food sources and a nest while
walking from food sources to the nest and vice versa, ants deposit on the ground a
chemical substances called pheromone smelled by other ants to choose path marked
by strong pheromone concentration. This behavior is explained in Figure 3.1 [73-79]
In Figure 3.1.a, ants walk between two points via unobstacled path. When an
obstacle breaks the path (Figure 3.1.b) ants try to get around the obstacle randomly
choosing either way. If the two paths encircling the obstacle have the different length,
more ants pass the shorter route on their continuous pendulum motion between the
nest points in particular time interval. While each ant keeps marking its way by
pheromones the shorter route attracts more pheromone concentrations and
consequently more and more ants choose this route. This feedback leads soon to final
stage in Figure 3.1.c, where entire ant colony uses the shortest path. [73]

Figure 3.1: Basic principle of Ant Colony Optimization.(depicted from reference[73]).
3.3.2 Characteristics of the proposed method [87]
a) Positive Feedback
It reinforces good solution directly by pheromone accumulation.
b) Negative Feedback
It avoids premature convergence (stagnation) by pheromone evaporation.
c) Cooperation
It explores different solutions, where multiple ants exploring solution space and
pheromone trial reflecting multiple perspective on solution space.

3.3.3 Differences between Real and Artificial Ants
Table 3.1 illustrates a comparison between the real and artificial ants to construct
the ant colony optimization method. [77-79]
Table 3.1 Analogy between real and artificial ants
Real Ant Artificial Ant
Ants move in their environment in Ants are synchronized where they follow
asynchronous way. the same path back to the nest at each
iteration.
The foraging behavior is based on an They evaluate a solution with respect to
implicit evaluation of a solution, where some quality measure which is used to
the shorter paths will be completed earlier determine the strength of pheromone
than longer ones. reinforcement that the ants perform
during their return trip to the nest.
They leave pheromone on the ground They only deposit pheromone on their
where ever they move. way back to the nest.
3.3.4 Applications
There are many researches have applied ant colony optimization algorithm in
various applications [68-71],[73] and [80-86]. Some of those applications are written
below.
• Network Reconfiguration.
• System Restoration.
• Network Routing.
• Power Distribution Network.
• Traveling Salesman Problem.
• Graph Coloring.
• Vehicle Routing.
• Job Shop Scheduling.
• Time Tabling.

3.3.5 General Description of ACO
Ant Colony Optimization (ACO) is a recently proposed metaheuristic
approach for solving hard combinatorial optimization problems. The inspiring source
of ACO is the pheromone trail laying and following behavior of real ants which use
pheromone as a communication medium. In analogy to the biological example, ACO
is based on the indirect communication of a colony of sample agents, called artificial
ants, mediated by artificial pheromone trails. The pheromone trails in ACO serve as
distributed, numerical information which the ants use to probabilistically construct
solutions to the problem being solved and which the ants adapt during the algorithm’s
execution to reflect their search experience. [74-79]
Artificial ants used in ACO are stochastic solution construction procedures
that probabilistically build a solution by iteratively adding solution components to
partial solution by taking into account (i) heuristic information on the problem
instance being solved and (ii) artificial pheromone trails which change dynamically at
run time to reflect the agents’ acquired search experience. [74-79]
Informally, the behavior of ants in an ACO algorithm can summarized as
follows. Acolony of ants concurrently and asynchronously move through adjacent
states of the problem by building paths on the graph(G). They move by applying a
stochastic local decision policy that makes use of pheromone trails and heuristic
information. By moving, ants incrementally build solutions to the optimization
problem. Once an ant has built a solution, or while the solution is being built, the
ant evaluates the solution and deposits pheromone trails on the connections it used.
This pheromone information will direct the search of the future ants. [74-79]
Besides ants’activity, an ACO algorithm includes two more procedures:

pheromone trail evaporation and daemon actions (this last component being optional).
Pheromone evaporation is the process by means of which the pheromone trail

intensity on the components decreases over time. It is needed to avoid a too rapid
convergence of the algorithm towards a sub-optimal region. It implements a useful
form of forgetting favoring the exploration of new areas of the search space. Daemon
actions can be used to implement centralized actions which can not be performed by
single agents. Examples are the activation of a local optimization procedure, or the
collection of global information that can be used to decide whether it is useful or not
to deposit additional pheromone to bias the search process from a non local
perspective. As a practical example, the daemon can observe the path found by each
ant in the colony and choose to deposit extra pheromone on the components used by
the ant that built the best solution. Pheromone updates performed by the daemon are
called off-line pheromone updates.[74-79]
3.4 Proposed ACO Algorithm
The concept of ACO is clear but the algorithm is not unique [74-79] and [86-87].
The model of selection of a proper algorithm depends on the application [68-71], [73]
and [80-87]. The proposed ACO algorithm that is introduced here is shown in the
flow chart of figure 3.2. The following steps give explanations to the flow chart of
figure 3.2.
1) Close all the tie and sectionalizing switches in the network to construct
meshed loops. The number of meshed loops equal the number of tie switches.
2) Generate the number of artificial ants arbitrary.
3) Initialize the parameters, heuristic parameter (ß), pheromone parameter (α),
evaporation parameter (ρ) for local updating rule, evaporation factor (μ) for
global updating rule, and initial pheromone values for each switch.
4) State transition rule:
Ants select their next state (switch) according to this rule given by (3-10)
S k (i , j ) = { S1 if q ≤qo
S 2 otherwise } (3-10)
S 1 = arg max [τ (i , j )] • [η (i , j )] 

α β
(3-11)
 

where
Sk(i,j) is the state (switch) that antk chooses in its next move.
k is the ant
i and j are the current and next state respectively
S1 and S2 are random variables represent the state (switch) that antk selects
according to transition state transition rule.
τ (i , j ) is the pheromone deposited by ants during move.
q is a random number uniformly distributed in [0,1].
qo is a parameter between 0 and 1( 0 ≤ q o ≤ 1 ) according to equation (3-13).
η (i , j ) is the heuristic information of the problem.
α is a parameter represents the importance of pheromone.
ß is a parameter represents the importance of heuristic.
S2 is selected according to a pseudo random rule or a pseudo random
proportional rule given by (3-12)
S2 =
[τ (i, j )]α • [η (i, j )]β if j ∈ N k (i ) (3-12)
∑ [τ (i, l )]α • [η (i, l )]β
l∈Nk ( i )
 c1 if 0 ≤ cycle ≤ no
q o =  co if no ≤ cycle ≤ n1 (3-13)
c1 if n1 ≤ cycle ≤ n max
Where
N k (i ) is the set of states (switches) that selected by ant k that is called tabu
list.
n0 and n1 are iteration frequency.
nmax is maximum iteration frequency.
c0 is a parameter its value between 0 and 0.4.

c1 is a parameter its value between 0.8 and 1.
5) Objective function calculation:
After ants finish from selecting the switches (states), the objective function is
calculated as given in equations in (3-5) and (3-6)
6) Local updating pheromone rule:
While constructing a solution each ant modifies the pheromone by this rule
given by (3-14).
τ (i , j ) = (1 − ρ ) • τ (i , j ) + ρ • τ o (3-14)
Where
τ o is the initial value of pheromone.
ρ is a heuristically defined parameter.
The local updating rule shuffles the search process
7) Global updating pheromone rule:
When all ants complete their tour (an iteration), this rule is applied to the
states (switches) belonging to the best solution. This rule provides a great
amount of pheromone to best solution and is given by (3-15)
m
τ (i , j ) = (1 − µ ) • τ (i , j ) + µ ∑ ∆τ (i , j ) (3-15)
k =1
Q
if ant k selects the edge or state (i,j)
∆τ (i , j ) =  Lk (3-16)

 0 otherwise
Where
∆τ (i , j ) is the change in the pheromone.
µ is the pheromone evaporation factor.
Q is a constant between 1 and 10,000.
Lk is the best objective function solved by antk.

m is the number of states
8) Repeat step 4 to step 6 continuously until satisfying the condition of abort
iteration.
9) Up to abort iteration, the solution of minimum objective function in all local
optimum solution is global optimum solution.

Start
Read System
Data
Form the meshed loops and make all switches

closed.
Iteration N=0
Solve load flow for the system and compute the

objective function.
Generate the number of ants and initialize its

parameters.
Select state (switch) according to state

transition rule
Estimate the objective function for each ant.
Update Local Pheromone

N=N+1
Update Global Pheromone
Yes
N< Nmax
End
Figure 3.2 : Flow chart of the proposed algorithm

CHAPTER FOUR
DEVELOPED PROGRAM AND SYSTEM SIMULATOR
4.1 Role of MATLAB Program and Power Simulator
The proposed method (ACO) is coded using MATLAB to solve the
reconfiguration problem. By running this program, the optimal solution ( best
configuration) is obtained. The PowerWorld simulator is used to evaluate different
configurations and verifies the validity of MATLAB program.
4.2 Developed MATLAB Program
The ACO algorithm adopted in this research has been coded using MATLAB. A
brief description of MATLAB is given in the following sections. Then, the
description of the developed code is introduced.
4.2.1 Introduction
MATLAB is a high-performance language for technical computing. It integrates
computation, visualization, and programming in one environment where problems
and solutions are expressed in familiar mathematical notation.
The name MATLAB stands for matrix laboratory. MATLAB was originally
written to provide easy access to matrix software developed by the LINPACK and
EISPACK projects. Today, MATLAB engines incorporate the LAPACK and BLAS
libraries, embedding the state of the art in software for matrix computation.
It is an interactive system whose basic data element is an array that does not
require dimensioning. This allows you to solve many technical computing problems,
especially those with matrix and vector formulations.

4.2.2 MATLAB System
The MATLAB system consists of five main parts:
Development Environment: this is the set of tools and facilities that help using
MATLAB functions and files. Many of these tools are graphical user interfaces.
The MATLAB Mathematical Function Library: this is a vast collection of
computational algorithms ranging from elementary functions, complex arithmetic, to
more sophisticated functions like matrix inverse, matrix eigenvalues, and fast Fourier
transforms.
The MATLAB Language: this is a high-level matrix/array language with control
flow statements, functions, data structures, input/output, and object-oriented
programming features.
Graphics: MATLAB has extensive facilities for displaying vectors and matrices as
graphs, as well as annotating and printing these graphs. It includes high-level
functions for two-dimensional and three-dimensional data visualization, image
processing, animation, and presentation graphics.
The MATLAB Application Program Interface (API): this is a library that allows
you to write C and Fortran programs that interact with MATLAB. It includes facilities
for calling routines from MATLAB (dynamic linking), calling MATLAB as a
computational engine, and for reading and writing MAT-files.
4.2.3 MATLAB Program of Proposed Algorithm
The program incorporates two main subprograms. The first is used to solve the
load flow problem of the system, and hence, determines the bus voltage and the
current and power losses in branches.

This subprogram is available for free downloading from one of the internet web
sites. This program is valid where it is tested on different power systems given good
results.
The load flow program consists of the following files [ 88 ]:
• A file (datanew.m) defines the system data , buses and lines.
• A file (calc.m) calculates power mismatch and check convergence.
• A file (ybus.m) forms the Jacobian matrix.
• A file (loadflow.m) solves the load flow equations using Newton-
Raphson method.
The second subprogram (attached in Appendix C), which is coded in this
thesis is dedicated for applying the proposed optimization algorithm in selecting
the best configuration of the distribution network. The developed optimization
program consists of the following:
• A file (main2.m) to call the load flow subprogram (loadflow.m) to
determine the objective function.
• A file (ant7mod.m) to change parameters of proposed method and call
the other files to complete the problem solution.
• A file to form the system loops (callos.m) and to determine the
pheromone on branches.
• A file ( antselection.m, switchopening.m) calculates the state transition
rule.
• A file ( localphermoneupdate.m) calculates the local updating rule.
• A file (globalphermoneupdate.m) calculates the global updating rule.

4.2.4 Program Flow Chart
The MATLAB program is developed as in flow chart in figure 4.1
Proposed Method Program
Input System Data
Define System Loops, initialize

Parameters and calculate
heuristic factor
Apply State Transition Rule
Run Load Flow Program

(Objective Function)
Apply Local Updating Rule
Apply Global Updating Rule
No IF NO. of
Iterations
abort
Yes
Optimal Solution
Figure 4.1: Developed Optimization Program

4.3 Power World Simulator
4.3.1 Introduction
Power World Simulator is a power system simulation package capable to solve
most of the power system operation problems through an interactive and graphical
interface. The simulator consists of a number of integrated products. At its core is a
comprehensive, robust Power Flow Solution engine capable of efficiently solving
systems of up to 100,000 buses. The simulator also contains all the tools necessary to
perform integrated economic dispatch, short circuit analysis, and contingency
analysis. All of the above features and tools are easily accessible through a
consistent and colorful visual interface.
4.3.2 Implementation of Studied Systems
The PowerWorld simulator is used as an evaluation tools for the alternative
configurations of the studied systems. The results obtained for the developed
MATLAB program is used here for verifications. The steps for implementing the
studied systems are described in the following paragraphs.
In‘edit mode’, a new case is to be opened as shown in figure 4.2
Figure 4.2: Opening new case
From the menu in ‘insert’, the components, buses, generator, lines and loads
are selected to build the distribution network as shown in figure 4.3

Figure 4.3: Selecting components
From the menu in ‘case information’, the parameters of selected components are
set as shown in figures 4.4,4.5, 4.6, 4.7&4.8
Figure 4.4 : Selected components values

Figure 4.5: Setting parameters of buses
Figure 4.6: Setting parameters of lines
Figure 4.7: Setting parameters of generator
Figure 4.8: Setting parameters of load
From the menu in ‘options’, ‘simulator options, ’general’ the base power is set as
shown in figures 4.9 & 4.10

Figure 4.9: Setting the base power
Figure 4.10 :Setting the base power value
Finally, the network is finished as shown in figure 4.11. Then, the mode is
switched into the ‘Run Mode’ and from ‘Simulation’ select ‘ solve and animate’ to
calculate the power loss, bus voltage and branch current as shown in figure 4.12.
To show the result, In ’Edit Mode’ ‘case information’, the power loss, bus voltage,
and branch current is displayed from ‘Line and Transformer’ as shown in figures 4.13
& 4.14

Figure 4.11: The final network
Figure 4.12: Rrunning and solving the network

Figure 4.13: Selection of the solution to be displayed
Figure 4.14: The solution values to be displayed

CHAPTER FIVE
Application of Proposed Algorithm
5.1 Introduction
This chapter discusses the results obtained by applying the proposed method (ACO) to
three distribution systems of different sizes. The proposed method is implemented using
MATLAB and run on a Pentium III 1.6 GHz computer. Also, the PowerWorld Simulator
is used to test the three studied distribution systems to evaluate the results of MATLAB
program. The systems are represented in the simulator as shown in figures B.1, B.2 and
B.3 (Appendix B). To evaluate the proposed method three indices are used. These
indices are system power loss, load balancing index and voltage deviation index. The
indices are defined in chapter three in equations (3-5), (3-6) and (3-7).
5.2 Test System 1: Baran and Wu System
5.2.1 System Description
The first example which is used to test the proposed reconfiguration algorithm is
Baran and Wu test system, which is shown in Figure 5.1. It consists of a feeder, 33
buses, 32 normally closed switches (sectionalizing switches), and 5 normally open
switches (tie switches). The system is a three phase system, 12.6 KV and whose input
data is shown in table A.1(Appendix A). The system loads are assumed constant and
Sbase is 100MVA. As explained in chapter 3 (section 3.4, figure 3.2) the proposed
method requires dividing this network into five meshed loops as shown in table 5.1.

Figure 5.1: Baran and Wu system for test case 1

Table 5.1: The meshed loops of Baran and Wu system
Loop No. Switches

L1 S15 S16 S17 S25 S26 S27 S28 S29 S30 S31 S32 S36
L2 S2 S3 S4 S5 S6 S7 S18 S19 S20 S33
L3 S8 S9 S10 S11 S21 S35
L4 S12 S13 S14 S34
L5 S22 S23 S24 S37
The proposed method (ACO) is applied to this system by assuming two objective
functions. The power loss minimization has been defined in equation (3-5) and load
balancing has been defined in equation (3-6). Throughout this study, the values of
number of ants, α, ß, μ and ρ are selected based on trial and error approach.
5.2.2 Optimal reconfiguration based on Power Loss Minimization
The objective function in equation (3-5) is used here. The proposed algorithm in
section 3.4 is applied. A group of five ants are generated to construct the feasible
solution of the system in each iteration. All the switches are initialized with a
pheromone of 0.5. The parameters of the proposed method are set as α=1, ß= 0.1,
ρ=0.9 and μ=0.9. The results are summarized in table 5.2
Table 5.2: The results for power loss minimization of Baran and Wu system
System Status Open Power Loss Load Voltage

Switches (MW) Balancing Deviation
Index Index
Initial S33 S34 S35 0.20235 2.6258 1.7002
Configuration S36 S37
(Original)
Final S32 S7 S9 S14 0.13935 1.8285 1.1469
Configuration S37
(Optimal)
Improvement (%) 31.13 30.36 32.54

It is observed that solving the problem for power loss minimization leads to
significant reduction in losses. Also, there is an improvement in both of the voltage
deviation index and the load balancing.
5.2.3 Optimal reconfiguration based on Load Balancing
section 3.4 is applied. A group of five ants are generated to construct the feasible
solution of the system at each iterations. All the switches are initialized with a
pheromone of 0.5. The maximum branch current is assumed 250 Amp for all
branches. The parameters of the proposed method are set as α=1, ß=0.5, ρ=0.9 and
μ=0.9. The results are summarized in table 5.3
Table 5.3: The results for load balancing of Baran and Wu system
System Status Open Switches Power Loss Load Voltage

(MW) Balancing Deviation
Index Index
Initial S33 S34 S35 0.20235 2.6258 1.7002
Configuration S36 S37
(Original)
Final S31 S7 S9 S14 0.14244 1.7526 1.2518
Configuration S37
(Optimal)
Improvement (%) 29.57 33.25 26.37
It is observed that solving the problem for load balancing improves significantly
loading distributions on lines. Also, there is an improvement in both of the voltage
deviation and power losses.
5.2.4 Objective Functions Comparison
In the test system in case 1 (Baran and Wu), the proposed method (ACO) is used to
solve the reconfiguration problem for two objective functions. These objective
functions are power loss minimization and load balancing. Throughout this section,
the comparison between the two configurations obtained from minimization of two

objective functions is performed by representing the data of results in table 5.1 and
5.2 in a form of bar chart as shown in figure 5.2. It is observed from the bar charts in
figure 5.2(a) and 5.2(b) that the power loss minimization is the best for power loss
and voltage deviation index whereas in figure 5.2(c) the load balancing is the best for
the load balancing index.
Figure 5.2: Evaluation of Baran & Wu system configurations

5.2.5 Contours
PowerWorld Simulator can create a contour map of various system quantities, such
as voltage magnitudes and angles, MW transactions, transmission loading, and real
and reactive load. Such displays resemble a contour map of temperatures like one
might see shown on a weather forecast. Contouring can significantly improve
understanding of a large interconnected system, helping identity congestion pockets
and MVar-deficient regions. It also provides an overview of how power system
quantities such as power loss, voltage profile and line current can flow through the
bulk power system.
5.2.5.1 Bus Voltage Contour
The test system in case one (Baran and Wu ) is represented in contouring to
illustrate the bus voltage profile in the initial configuration and the optimal
configurations by studying the system for power loss minimization and load
balancing. The following figures 5.3, 5.4, and 5.5 illustrate the bus voltage contour
for the considered network configurations.
Figure 5.3: Bus voltage of Baran and Wu System of the

initial configuration

Figure 5.4: Bus voltage of Baran and Wu system of the
optimal configuration for power loss minimization
Figure 5.5: Bus voltage of Baran and Wu system of the optimal

configuration for load balancing

In the initial configuration, figure 5.3, one can observe a bold blue zone where the
voltage decreases to a value less than 0.95 p.u.
In the optimal configuration for power loss minimization, figure 5.4, one can
observe a remarkable part of the bold blue zone changed to light blue zone illustrating
a significant improvement in the voltage profile.
In the optimal configuration for load balancing, figure 5.5, a little part of the bold
blue zone changed to light blue zone illustrating little improvement in the voltage.
5.2.5.2 Power Loss Contour
illustrate the power loss in the initial configuration and the optimal configurations by
studying the system for power loss minimization and load balancing. The following
figures 5.6, 5.7, and 5.8 illustrate the power loss contour for the considered network
configurations.
Figure 5.6: MW Loss of Baran and Wu system of the initial

Configuration

Figure 5.7: MW loss of Baran and Wu system of the optimal
configuration for power loss minimization
Figure 5.8: MW loss of Baran and Wu system of the optimal


In the initial configuration, figure 5.6, there are four branches in the red zone have
a high power loss. Three branches in the green zone have a fair power loss. Also, a
branch in the light blue zone has a little power loss.
In the optimal configuration for power loss minimization, figure 5.7, two branches
in the red zone changed to light green showing a high decrease in power loss and one
branch changed to yellow showing a fair decrease in the power loss. Three branches
in the green zone changed to bold blue showing a high decrease in power loss. Also,
a branch in the light blue zone changed to bold blue showing a little decrease in power
loss.
In the optimal configuration for load balancing, figure 5.8, three branches in the
red zone changed to light green showing a high decrease in power loss. Two branches
in the green zone changed to bold blue showing a high decrease in power loss and one
branch changed to light blue zone showing a fair decrease in power loss. Also, a
branch in the light blue zone changed to bold blue showing a little decrease in power
loss.
5.2.5.3 Line Current Contour
illustrate the line current in the initial configuration and the optimal configurations by
figures 5.9, 5.10, and 5.11 illustrate the line current contour for the considered
network configurations

Figure 5.9: Line current of Baran and Wu system of the initial
configuration
Figure 5.10: Line current of Baran and Wu system of the optimal

configuration for power loss minimization

Figure 5.11: Line current of Baran and Wu system of the optimal
In the initial configuration, figure 5.9, one can observe bad distributions where
some zones (red) are heavily loaded and the other zones (blue) are lightly loaded.
In the optimal configuration for power loss minimization, figure 5.10, there is a
fair improvement in distributions where the bold zones get lighter.
In the optimal configuration for load balancing, figure 5.11, there is a significant
improvement where the bold zones get lighter clearly given a good distribution.
5.3 Test System 2: Taiwan System
The second example is a practical distribution network of a Taiwan Power
Company . Its conductor mainly employ both overhead lines ACSR 477 KCM and
under ground lines copper conductors 500 KCM. The system is shown in Figure 5.12
and the relating data are shown in table A.2 (Appendix A). It is a three phase, 11.4
KV system. The system consists of 83 normally closed sectionalizing switches, and
13 normally open tie switches. Three phase balance and constant loads are assumed

and Sbase is 100 MVA. As explained in chapter 3 (section 3.4, figure 3.2) the
proposed method requires dividing this network into thirteen meshed loops as shown
in table 5.4. It is should be noted that the nodes A, B, C, D, E, F, G, H,I ,J ,K and L
are connected to different transformers. In this thesis, it will be assumed that all these
nodes are connected to a single bus. This bus is selected as the slack bus.
Figure 5.12: Taiwan distribution system for test case 2

Table 5.4: The meshed loops of Taiwan system
Loop No. Switches

L1 S2 S3 S4 S5 S54 S55 S84
L2 S6 S7 S57 S58 S59 S60 S85
L3 S48 S49 S50 S51 S52 S53 S61 S62 S63 S64 S96
L4 S12 S13 S88 S74 S75 S76
L5 S14 S16 S17 S18 S89
L6 S66 S67 S68 S69 S70 S71 S72 S87
L7 S19 S20 S79 S80 S81 S82 S83 S91
L8 S26 S90
L9 S27 S28 S31 S32 S92
L10 S35 S36 S37 S38 S39 S29 S93
L11 S40 S41 S42 S95
L12 S33 S34 S43 S44 S45 S46 S94
L13 S86
section 3.4 is applied. A group of five ants is generated to construct the feasible
solution of the system at each iteration. All the switches are initialized with a
pheromone of 0.5. The parameters of the proposed method are set as α=1, ß=0.1 ,
ρ=0.9 and μ=0.9. The results are summarized in table 5.5

Table 5.5: The results for power loss minimization of Taiwan system
System Open Switches Power Loss Load Voltage

Status (MW) Balancing Deviation
Index Index
Initial S84 S85 S86 S87 S88 0.53048 3.7044 2.5588
Configuration S89 S90 S91 S92 S93
(Original) S94 S95 S96
Final S84 S63 S7 S72 S13 0.46991 3.5890 2.3349
(Optimal) S42 S34 S86
Improvement (%) 11.42 3.12 8.75
significant reduction in losses. Also, there is a slight improvement in the load
balancing and a fair improvement in the voltage deviation because of unloading the
system.
branches. The parameters of the proposed method are set as α=1 ,ß=0.5 , ρ=0.6 and
μ=0. 1. The results are summarized in table 5.6.

Table 5.6: The results for load balancing of Taiwan system
System Status Open Power Loss Load Voltage

Switches (MW) Balancing Deviation
Index Index
Initial S84 S85 S86 0.53048 3.7044 2.5588
Configuration S87 S88 S89
(Original) S90 S91 S92
S93 S94 S95
S96
Final S54 S63 S7 S72 0.47835 3.4542 2.3185
Configuration S88 S89 S82
S42 S34 S86
Improvement (%) 9.83 6.75 9.39
It is observed that solving the problem for load balancing improves slightly
loading distributions on lines because of unloading the system. Also, there is a fair
improvement in both of the voltage deviation and power losses.
In the test system in case two (Taiwan), the proposed method (ACO) is used to
solve the reconfiguration problem for two objective functions. These objective
functions are power loss minimization and load balancing. Throughout this section,
the comparison between the two configurations obtained from minimization of two
objective functions is performed by representing the data of results in table 6.5 and
6.6 in a form of bar chart as shown in figure 5.13. It is observed from the bar charts
in figure 5.13(a) that the power loss minimization is the best for the power loss
whereas in figure 5.13(b) and figure 5.13(c) the load balancing is the best for the load
balancing index and voltage deviation index.

Figure 5.13: Evaluation of Taiwan system configurations
5.3.5 Contours
The test system in case two (Taiwan ) is represented in contouring to illustrate the
bus voltage profile in the initial configuration and the optimal configurations by
figures 5.14, 5.15, and 5.16 illustrate the bus voltage contour for the considered
network configurations.

56
47
55
0 MW
0 Mvar
8 0 MW
0 Mvar
slack
F 1 2 3 4 5 6 7 9 0 MW 54
0 Mvar
29 MW 0 MW 0 MW 0 MW 0 MW 0 MW 0 MW 48
0 Mvar 0 Mvar 0 Mvar 0 Mvar 1 MW 0 Mvar 0 Mvar
22 Mvar 1 Mvar
10
0 MW
0 Mvar 53 52 51 50 49
64
1 MW
0 MW 1 Mvar 0 MW
0 MW 0 MW 0 Mvar 0 Mvar
0 Mvar 0 Mvar
63 62 61 60 59 58 57
0 MW
0 MW 0 MW 0 Mvar 0 MW 1 MW 0 MW
0 Mvar 0 Mvar 0 Mvar 0 Mvar 0 Mvar
65
12 72
11 13
1 MW 0 MW
1 Mvar 0 Mvar
1 MW
1 Mvar
71 70 69 68 67 66
14 2 MW 0 MW 0 MW
2 Mvar 0 Mvar 0 Mvar
1 MW
0 Mvar
15 16 17 18 19 20 21 22 24 76 75 74
0 MW 0 MW 1 MW 1 MW 0 MW 0 MW 0 MW 0 MW 1 MW
0 Mvar 0 Mvar 0 Mvar 1 Mvar 0 Mvar 0 MW 0 Mvar 23 0 Mvar 0 Mvar 1 Mvar
0 Mvar
83 0 MW 82 81 80 79 78
0 Mvar
2 MW
0 MW 0 MW 0 MW 0 MW 1 Mvar 0 MW
40
25 26 27 28 29 39
0 MW
0 MW 0 MW 0 MW 2 MW 0 MW 0 MW 0 Mvar
0 Mvar 0 Mvar 0 Mvar 1 Mvar 0 Mvar 0 Mvar
30 31 32 33 34 35 36 37 38 41 42
0 MW
2 MW 0 MW 0 Mvar 1 MW 0 MW 0 MW 0 MW 0 MW 0 MW 0 MW
2 Mvar 0 Mvar 1 Mvar 0 Mvar 0 Mvar 0 Mvar 0 Mvar 0 Mvar 0 Mvar
43
44 45 46
1 MW 0 MW
0 MW 1 Mvar 0 Mvar
0 Mvar
73
77
Figure 5.14: Bus voltage of Taiwan network of the initial configuration
5 6
47
5 5
0 MW
0 Mvar
8 0 MW
0 Mvar
slack
F 1 2 3 4 5 6 7 9 0 MW 54
0 Mvar
2 9 MW 0 MW 0 MW 0 MW 0 MW 0 MW 0 MW 4 8
2 2 Mvar 1 Mvar
10
0 MW
0 Mvar
53 52 5 1 5 0 49
6 4 1 MW
0 MW 1 Mvar 0 MW
0 Mvar 0 Mvar
6 3 62 61 60 5 9 5 8 57
0 MW
65
1 2 7 2
11 13
1 MW 0 MW
1 Mvar 0 Mvar
1 MW
1 Mvar
71 70 6 9 6 8 67 66
14 2 MW 0 MW 0 MW
1 MW
0 Mvar
15 1 6 1 7 1 8 1 9 20 2 1 22 2 4 76 75 7 4
0 Mvar 0 Mvar 0 Mvar 1 Mvar 0 Mvar 0 MW 0 Mvar 0 Mvar 0 Mvar 1 Mvar
0 Mvar 23
0 MW
8 3 0 Mvar 8 2 81 80 79 7 8
2 MW
4 0
25 26 2 7 28 29 39
0 MW
3 0 31 3 2 3 3 34 35 36 37 38 41 42
0 MW
43
44 4 5 4 6
1 MW 0 MW
0 MW 1 Mvar 0 Mvar
0 Mvar
73
77
Figure 5.15: Bus voltage of Taiwan network of the optimal configuration for power
loss minimization

56
47
55
0 MW
0 Mvar
8 0 MW
0 Mvar
slack
F 1 2 3 4 5 6 7 9 0 MW 54
0 Mvar
29 MW 0 MW 0 MW 0 MW 0 MW 0 MW 0 MW 48
22 Mvar 1 Mvar
10
0 MW
0 Mvar 53 52 51 50 49
64 1 MW
0 MW 1 Mvar 0 MW
0 Mvar 0 Mvar
63 62 61 60 59 58 57
0 MW
65
12 72
11 13
1 MW 0 MW
1 Mvar 0 Mvar
1 MW
1 Mvar
71 70 69 68 67 66
14 2 MW 0 MW 0 MW
1 MW
0 Mvar
15 16 17 18 19 20 21 22 24 76 75 74
0 Mvar 0 Mvar 0 Mvar 1 Mvar0 Mvar 0 MW 0 Mvar 23 0 Mvar 0 Mvar 1 Mvar
0 Mvar
83 0 MW 82 81 80 79 78
0 Mvar
2 MW
40
25 26 27 28 29 39
0 MW
30 31 32 33 34 35 36 37 38 41 42
0 MW
43
44 45 46
1 MW 0 MW
0 MW 1 Mvar 0 Mvar
0 Mvar
73
77
Figure 5.16: Bus voltage of Taiwan network of the optimal configuration for load
balancing
In the initial configuration, figure 5.14, one can observe a bold blue zone where the
In the optimal configuration for power loss minimization, figure 5.15, a
remarkable part of the bold blue zone changed to light blue zone illustrating an
improvement in the voltage. Also, the light blue zone changed to light green showing
an improvement in the voltage profile.
In the optimal configuration for load balancing, figure 5.16, a little part of the bold
blue zone changed to light blue zone illustrating an improvement in the voltage. Also,
the light blue zone changed to light green showing an improvement in the voltage.

The test system in case two (Taiwan) is represented in contouring to illustrate the
power loss in the initial configuration and the optimal configurations by studying the
system for power loss minimization and load balancing. The following figures 5.17,
5.18, and 5.19 illustrate the power loss contour for the considered network
configurations.
Figure 5.17: MW loss in line of Taiwan network of the initial configuration

Figure 5.18: MW loss in line of Taiwan network of the optimal configuration for
power loss minimization
Figure 5.19: MW loss in line of Taiwan network of the optimal configuration for load
balancing

In the initial configuration, figure 5.17, there are thirteen branches in the red zone
have a high power loss.
In the optimal configuration for power loss minimization, figure 5.18, five
branches in the red zone changed to light green showing a high decrease in power loss
and two branches changed to bold green showing a very high decrease in the power
loss, two branches changed to yellow showing a fair decrease in power loss and one
branch changed to orange showing a little decrease in the power loss.
In the optimal configuration for load balancing, figure 5.19, three branches in the
red zone changed to light green showing a high decrease in power loss, two branches
changed to yellow showing a fair decrease in power loss, one branch changed to bold
blue showing a very high decrease in the power loss and one branch changed to
orange showing a little decrease in the power loss.
illustrate the line current in the initial configuration and the optimal configurations by
figures 5.20, 5.21, and 5.22 illustrate the line current contour for the considered
network configurations.

Figure 5.20: Line current of Taiwan network of the initial configuration
Figure 5.21: Line current of Taiwan network of the optimal configuration for power
loss minimization

Figure 5.22: Line current of Taiwan network of the optimal configuration for load
balancing
In the initial configuration, figure 5.20, one can observe bad distributions where
In the optimal configuration for power loss minimization, figure 5.21, there is a
fair improvement in distributions where the bold zones get lighter.
In the optimal configuration for load balancing, figure 5.22, there is a remarkable
improvement where the bold zones get lighter clearly given a good distribution.
5.4 Test System 3: Saudi System (SEC)
The third example is a practical distribution network of a Saudi Electrical
Company [SEC]. Its conductor mainly employs XLPE copper cable 185 mm2 and it
is assumed the same impedance for all branches. The system is shown in Figure 5.23
and the relating data are shown in table A.3 (Appendix A). It is a three phase, 13.8
KV system. The system consists of 149 normally closed sectionalizing switches, and

13 normally open tie switches. Three phase balance and constant loads are assumed
and Sbase is 100 MVA. As explained in chapter 3 (section 3.4, figure 3.2) the
proposed method requires dividing this network into thirteen meshed loops as shown
in table 5.7. It is should be noted that the nodes 201, 202, 203, 204, 205, 206, 207,
208, 209, 210, 211, 212, 213 and 214 are connected to different transformers. In this
thesis, it will be assumed that all these nodes are connected to a single bus. This bus
is selected as the slack bus.
Figure 5.23: SEC distribution system

Table 5.7: The meshed loops of SEC system
Loop No. Switches

L1 S2 S3 S4 S5 S6 S7 S8 S9 S10 S11 S12 S13 S14 S16 S17
S18 S19 S20 S21 S22 S151
L2 S24 S25 S26 S27 S28 S29 S30 S31 S32 S33 S34 S35 S36
S37 S38 S150
L3 S50 S51 S52 S53 S54 S55 S153
L4 S39 S40 S41 S42 S43 S44 S45 S46 S47 S48 S73 S74 S75
S76 S152
L5 S57 S58 S59 S60 S61 S62 S63 S64 S65 S154
L6 S78 S79 S80 S81 S82 S83 S84 S86 S87 S88 S89 S90 S156
L7 S66 S67 S68 S69 S70 S71 S91 S92 S93 S155
L8 S95 S96 S97 S98 S99 S100 S101 S102 S103 S104 S106 S107
S108 S109 S158
L9 S110 S111 S112 S113 S114 S157
L10 S115 S117 S118 S119 S120 S121 S160
L11 S123 S124 S125 S126 S127 S128 S129 S130 S131 S132 S159
L12 S135 S136 S137 S161
L13 S138 S139 S140 S141 S142 S143 S144 S145 S146 S147 S148
S149 S162
pheromone of 0.5. The parameters of the objective function are set as α=2, ß=0.2,
ρ=0.9 and μ=0.01. The results are summarized in table 5.8.

Table 5.8: The results for power loss minimization of SEC system

Index Index
Initial S150 S151 S152 S153 1.2924 20.8915 3.8964
Configuration S154 S155 S156 S157
(Original) S158 S159 S160 S161
S162
Final S11 S36 S65 S69 S103 0.8974 14.4948 2.3767
(Optimal) S153 S156 S157 S161
Savings(%) 30.56 30.62 39
significant reduction in losses. Also, there is an improvement in both of the voltage
deviation index and the load balancing.
branches. The parameters of the objective function are set as α=1, ß=0.1, ρ=0.9 and
μ=0.9.
Table 5.9: The results for load balancing of SEC system

Index Index
Initial S150 S151 S152 S153 1.2924 20.8915 3.8964
(Original) S158 S159 S160 S161
S162
Final S84 S96 S7 S72 S88 0.8974 14.4948 2.3767
Savings(%) 30.56 30.62 39
It is observed that solving the problem for load balancing improves significantly
loading distributions on lines. Also, there is an improvement in both of the voltage
deviation and power losses.
In the test system in case three (SEC), the proposed method (ACO) is used to solve
the reconfiguration problem for two objective functions. These objective functions
are power loss minimization and load balancing. It is observed from the tables 5.8
and 5.9 that the power loss minimization and load balancing are the same for power
loss, load balancing index and voltage deviation index. Because it is assumed that the
impedance of all branches are the same for lack of the available information.

5.4.5 Contours
The test system in case three (SEC ) is represented in contouring to illustrate the
bus voltage profile in the initial configuration and the optimal configurations by
studying the system for power loss minimization and load balancing. Here, it is
enough to represent the system for one objective function where they give the same
contour because of assumption of equal impedances in all branches. The following
figures 5.24 and 5.25 illustrate the bus voltage contour for the considered network
configurations.
Figure 5.24: Bus voltage of SEC network of the initial configuration
Figure 5.25: Bus voltage of SEC network of the optimal configuration

In the initial configuration, figure 5.24 one can observe a bold blue zone where the
In the optimal configuration (power loss minimization and load balancing), figure
5.25, the bold blue zone changed to light blue and light green illustrating a significant
improvement in the voltage profile.
The test system in case three (SEC) is represented in contouring to illustrate the
power loss in the initial configuration and the optimal configurations by studying the
system for power loss minimization and load balancing. Here, it is enough to
represent the system for one objective function where they give the same contour
because of assumption of equal impedances in all branches. The following figures
5.26 and 5.27 illustrate power loss contour for the considered network configurations
Figure 5.26: MW loss in line of SEC network of the initial configuration

Figure 5.27: MW loss in line of SEC network of the optimal configuration
In the initial configuration, figure 5.26, there are twenty four branches in the red
zone have a high power loss. Also, twelve branches in the light green zone have a fair
power loss.
5.27, eight branches in the red zone changed to light green showing a fair decrease in
the power loss, four branches changed to light blue showing a high decrease in the
power loss, five branches changed to bold blue showing a very high decrease in the
power loss and one branch changed to orange showing a little decrease in the power
loss. Also, there are twelve branches in the light green zone changed to bold blue
showing a fair decrease in the power loss.

The test system in case three (SEC) is represented in contouring to illustrate the
line current in the initial configuration and the optimal configurations by studying the
system for power loss minimization and load balancing. Here, it is enough to
represent the system for one objective function where they give the same contour
because of assumption of equal impedances in all branches. The following figures
5.28 and 5.29 illustrate line current contour for the considered network configurations.
Figure 5.28: Line current of SEC network of the initial configuration
Figure 5.29: Line current of SEC network of the optimal configuration

In the initial configuration, figure 5.28 one can observe bad distributions where
5.29, there is an improvement in distributions where the bold zones get lighter.

CHAPTER SIX
CONCLUSIONS
The objective of this thesis is to test the feasibility of applying the ant colony
optimization algorithm in the reconfiguration of electrical distribution networks to
minimize the power losses of the system and to balance the loading of the feeders.
This work is to provide a basis for power companies to use it in the reconfiguration of
the distribution networks to reduce the operational costs and to enhance the
performance of their networks. The following points summarize the results of this
research:
1. A general description of the proposed method is given to provide a
foundation for the implementation used in the simulation. A
MATLAB program is developed based on the proposed algorithm in
order to evaluate performance through applying the algorithm on three
distribution systems.
2. The simulation of the studied systems using PowerWorld simulator
produces results similar to MATLAB obtained results which prove the
validity of the developed program.
3. Since the algorithm involves a probability based search, the decision
for ants is simple and shows better performance with significant
reduction in the computation effort, as it searches for the optimal
solution in the initial stage of the search process.

4. The parameters of the proposed method (ACO) are tuned by trial and
error in order to achieve maximum efficiency of the algorithm to get
the optimal solution.
5. The current implementation also requires the solution of the load flow
equations each time a new configuration is generated throughout the
search algorithm.
6. The obtained results prove the feasibility of applying the proposed
approach for the solution of reconfiguration of distribution networks.
7. Solving the proposed method for the objective of power loss
minimization leads to the optimal solution with improvement in the
voltage profile. Also, the load balancing is enhanced but the voltage
deviation and load balancing are suboptimal.
8. Solving the proposed method in the objective of balance loading leads
to the optimal solution with improvement in the voltage profile. Also,
the power loss is enhanced but the voltage deviation and the power loss
are suboptimal.
9. The application of the proposed method to a SEC network, which
represents a real-life distribution network having a large size shows the
validity of the method for large networks.
10. Applying the proposed strategy to the distribution network of a SEC
may reduce both the installations cost and operational cost and helps in
the prolongation of the life time of the equipment.

References
[1] A. Merlin and H. Back, “Search for a minimal loss operating spanning tree
configuration for an urban power distribution system”, Proceedings of the 5 th Power
System Computation Conference ( PSOC), Cambridge, 1975, pp. 1-18.
[2] D. Shirmohammadi and H.W Hong, “Reconfiguration of electric distribution
networks for resistive line losses reduction”, IEEE Transactions on Power Delivery,
Vol. 4, No. 2, 1989, pp. 1492-1498.
[3] S. Civanlar, J.J Grainger, H. Yin and H. Lee “Distribution feeder
reconfiguration for loss reduction, IEEE Transactions on Power Delivery, Vol. 3, No.
3, 1988, pp. 1217-1223.
[4] M.E Baran and F.F Wu, “Network reconfiguration in distribution systems for
loss reduction and load balancing”, IEEE Transactions on Power Delivery, Vol. 4,
No. 2, 1989, pp. 1401-1407.
[5] V. Glamocanin, “Optimal loss reduction of distribution networks”, IEEE
Transactions on PWas, Vol. 5, No. 3, 1990, pp. 774-778
[6] R.J Safri, M.M.A Salama and A.Y Chickani, “Distribution system
reconfiguration for loss reduction: a new algorithm based on a set of quantified
heuristic rules”, Proceedings of Electrical and Computer Engineering, Vol. 1, Canada,
1994, pp. 125-130.
[7] G.J Peponis, M.P. Popadopoulos and N.D Hatziargyrion, “Distribution
network reconfiguration for resistive line losses”, IEEE Transactions on Power
Delivery, Vol. 10, No. 3, 1995, pp. 1338-1342.

[8] R.P Broadwater, A.H. Khan, H.E Shalaan and R.E. Lee , “Time varying load
analysis to reduce distribution losses through reconfiguration”, IEEE Transactions on
Power Delivery, Vol. 8, No. 1, 1993, pp. 294-300.
[9] J-C. Wang, H-D. Chiang and G. Darling, “An efficient algorithm for real time
network reconfiguration in large scale unbalanced distribution systems”, IEEE
Transactions on Power systems, Vol. 11, No. 1, 1996, pp. 5511-5517.
[10] R. Safri, M.M.A Salama and Y. Chickani, “Distribution system
reconfiguration for loss reduction: an algorithm based on network portioning theory”,
IEEE Transactions on Power System, Vol. 11, No. 1, 1996, pp. 504-510.
[11] D.E Bouchard, M.M.A Salama and Y. Chickani, “Algorithms for distribution
feeder reconfiguration”, Canadian Conference on Electrical and Computer
Engineering, CCECE, 1996, pp. 794-797.
[12] J.Fan, L. Zhang and J. McDonald, “Distribution network reconfiguration:
single loop optimization “, IEEE Transactions on Power System, Vol. 11, No. 3,
1996, pp. 1643-1647.
[13] V. Borozan, D. Rajicic and R. Ackovski, “Minimum loss reconfiguration of
unbalanced distribution networks”, IEEE Transactions on Power Delivery, Vol. 12,
No. 3, 1997, pp. 435-447.
[14] V. Borozan, D. Rajicic and R. Ackovski, “Improved method for loss
minimization in distribution networks, IEEE Transactions on pas, Vol. 10,No. 3,
1995, pp. 1420-1421.
[15] H. Rudnick, I. Harnisch and R. Sanhueza, “Reconfiguration of electric
distribution systems”, Faculty of Engineering, U.T.A, Chile, Vol. 4, 1997.

[16] R. Taleski and D. Rajicic, “Distribution network for reconfiguration for
energy loss reduction”, IEEE Transactions on Power System, Vol. 12, No. 1, 1997,
pp. 398-406.
[17] Q. Zhou, “Distribution feeder reconfiguration to service restoration and load
balancing”, IEEE Transactions on Power System, Vol. 12, No. 2, 1997, pp. 724-729.
[18] W-M. Lin and H-C. Chin, “A new approach for distribution feeder
reconfiguration for loss reduction and service restoration”, IEEE Transactions on
Power Delivery, Vol. 13,No. 3, 1998.
[19] M.A Kashem, V. Ganapathy and G.B. Jasmon, “Network reconfiguration for
load balancing in distribution networks”, IEEE Proc.-Gener., Transmission
Distribution, Vol. 146, No. 6, 1999, pp. 563-567.
[20] T. McDermott, I. Drezga and R. Broadwater, “A heuristic non linear
constructive method for distribution system reconfiguration”, IEEE Transactions on
Power System”, Vol. 14, No. 2, 1999, pp. 478-483.
[21] M.A. Kashem, V. Ganapathy and G.B Jasmon, “Network reconfiguration for
enhancement of voltage stability in distribution networks”, IEEE Proc.-Gener.,
Transmission Distribution, Vol. 174, No. 3, 2000, pp. 171-175.
[22] M.A Kashem, V. Ganapathy and M.I Buhari, “A novel method for loss
minimization in distribution networks”, International Conference on Electric Utility
Deregulation and Rstructuring on Power Technologies, City University, London,
2000.
[23] A.B Mortan and I.M.Y Marleez, “An efficient brute-force solution to the
network reconfiguration problem”, IEEE Transactions on Power Delivery, Vol. 15,
No. 3, 2000, pp. 996-1000.

[24] A.C.B Delbem, N.G Bretas and A. de Carvalho, “Distribution system
reconfiguration using graph chain representation “, Trabalhador Sao Cartenge 400, SP
Brazil, 2000, pp. 439-443.
[25] A. Ebrahimi and S. Mohseni, “Multipurpose reconfiguration of distribution
system using fuzzy reasoning approach”, Conference Publication No.482 (CIRED
2001), IRAN, 2001, pp. 4.29.
[26] E. Ramos, A. Exposito and A.J Salado, “Optimal reconfiguration of
distribution networks for power loss reduction”, , 2001 IEEE Porto Power Tech.
Conference, Portugal , Vol.3, 2001, pp. 5.
[27] B. Radha, R.T.F Ah King and H.C.S Rughooputh, “Optimal network
reconfiguration of electrical distribution system”, International Conference on
Industry and Technology (ICIT 2003), Salvonia, 2003.
[28] W. Wu and B. Zhang, “Loop flow based method for distribution system
reconfiguration”, Proceeding of the 6 th International Conference on Advances in
Power System Control, Operation and Management (APSCOM 2003) , Hong Kong,
2003, pp. 467-472.
[29] E.A Bueno and C. Cavellucci, “Distribution network reconfiguration for loss
reduction with variable demands”, 2004 IEEE/PES Transmission Distribution
Conference and Exposition, Latin America, 2004, pp.384-389.
[30] J. Wu and Y. Yu, “A new method for snapshot and time varying distribution
network reconfiguration”, Proceeding of the 5th World Congress on Intelligent
Control , Hangzhou, China, 2004, pp. 5069-5073.
[31] J.F.C Lorenzeti, M.A.N. Guimars and C.A Castro, “Reconfiguration of radial
distribution network to voltage stability margin increase”, Proceeding of 7th Lasted

International Conference Power and Energy Systems, Clearwater Beach, USA, 2004,
pp. 243-248.
[32] F. Comes, S. Carneivo, J. Pereiva, M. Vinagre, P. Gracia, E. Oliveria and L.
Arauja, “A new distribution system reconfiguration approach using optimal power
flow technique and sensitivity analysis for loss reduction”, Summary prepared for the
Panel Session Entitled Models for Distribution System Analysis, 2005 IEEE PES
,General meeting, CA, USA, 2005.
[33] K. Nara, A. Shioss, M. Kitagwa and T. Ishihwara, “Implementation of GA for
distribution system loss minimum reconfiguration”, IEEE Transaction on Power
Systems, Vol. 7, No. 3, 1992, pp. 1044-1051.
[34] H. Fudou, T. Genji, Y. Fukuyamam and Y. Nakanishi, “A genetic algorithm
for network reconfiguration using three unbalanced load flow”, Intelligent System
Applications to Power System (ISAP’97), Seoul, Korea,1997, pp. 1-5.
[35] J.Z Zhu, “Optimal reconfiguration of electrical distribution network using the
refined GA” , Electric Power System Research, Vol. 62, 2002, pp. 37-84.
[36] W.M. Lin, F.S Cheng and M.T. Tsay, “Distribution feeder reconfiguration
with refined GA”, IEEE Proc-Gener. Transmission Distribution, Vol. 147, No. 6,
2000, pp. 1484-1491.
[37] L. Xiaoming, H. Yanhao and Y. Xianggen, “The improving GA coding and
decoding technique for distribution network reconfiguration”, IEEE Transactions on
Power System, Vol. 1, 2004, pp.79-84
[38] Z. Ming, B. Pengxiang, L. Jian and Z. Wenyuan, “An improved GA for
distribution system reconfiguration”, Proceedings of International Conference on
Power System Technology, PowerCon2002, Vol. 3, pp. 1734-1738.

[39] Y. Yu and J. Wu, “Loads combination method based cone scheme genetic
shortest path algorithm for distribution network reconfiguration”, IEEE Transactions
on Power System, 2002, pp.1729-1732.
[40] Y.C. Huang,” Enhanced GA based fuzzy multiobjective approach to
distribution network reconfiguration”, IEEE, Poc-Gener. Trans. Dist., Vol. 149, No. 5,
2002, pp. 615-620.
[41] B. Radha, R.T.F Ah King and H.C.S Rughooputh, “A real GA for optimal
network reconfiguration “, International Conference on Industrial Technology (ICIT
2003), Vol. 11, Maribor, Solvenia, 2003, pp. 54-59.
[42] B. Radha, R.T.F Ah King and H.C.S. Rughooputh, “A modified GA for
optimal electrical distribution network reconfiguration”, Proc-Congress on Evolution
Computation (CEC 2003), Canberra, Australia, 2003, pp. 1472-1479.
[43] J. Wang, A. Luo, M. Qi and M. Li, “The improved clonal GA and its
application in reconfiguration of distribution networks”, Power System Conference
and Exposition, 2004 IEEE PES, Vol.3, pp. 1423-1428.
[44] K. Prasad, N.C. Sahoo, R. Ranjan and A. Chaturvedi; “An improved GA for
optimal reconfiguration of radial distribution systems, “Proc-of the 3 rd Lasted
International Conference, MODELING, IDENTIFICATION, and CONTROL,
Grindelward, Switzerland, 2004, pp. 132-136.
[45] R.T.F Ah King, B. Radha and H.C.S Rughooputh, “A fuzzy logic controlled
GA for optimal electric distribution network reconfiguration”, Proc.IEEE,
International Confernce on Networking Sensing and Control, Taipei, Taiwan,2004,
pp. 577-582.
[46] K. Prasad, A. Chaturvedi, R. Ranjan and N.C Sahoo,”Topological
restructuring of electrical distribution system using a daptive fuzzy GA”, Proc. Of 4 th

Lasted International Conference on MODELING, SIMULATION and
OPTIMIZATION, Kauai, Hawaii, USA, 2004, pp. 93-97.
[47] Hong and Ho, “Determination of network reconfiguration considering
multiobjective in distribution systems using general algorithms”, IEEE Transactions
on Power Systems, Vol. 20, No. 2, 2005.
[48] K. Prasad, R. Ranjan, N.C Sahoo and A. Chaturvedi, “Optimal reconfiguration
of radial distribution systems using a fuzzy mutuated GA”, IEEE Transactions on
[49] H. Kim, “ANN based feeder reconfiguration for loss reduction in distribution
system”, IEEE Transaction on Power Delivery, Vol. 8,No. 3, 1993, pp. 1356-1366.
[50] D. Bouchard, A. Chikhani, V.I John and M.M.A Salama, “Applications of
Hopefield neural networks to distribution feeder reconfiguration”, Proc. Of the 2nd
International Forum on Application of Neural Networks to Power Systems,
Yokohama, Japan, 1993, pp. 311-316.
[51] T. Taylor and O. Lubkeman, “Implementation of heuristic search stratigies for
distribution feeder reconfiguration”, IEEE Trans. On Power Delivery, Vol. 5, No. 1,
1990, pp. 239-245.
[52] C.-H. Lin, “Distribution network reconfiguration for load balancing with a
colonal Petri net algorithm”, IEEE Proc-Gener. Transm. Dist., Vol. 150, No. 3, 2003,
pp. 317-324.
[53] X. Jin, J. Zhao, Y. Sum, K. Li and B. Zhang, “Distribution network
reconfiguration for load balancing using Binary Particle Swarm optimization”,
International Conference on Power System Technology ( POWERCON 2004) ,
Singapore, 2004, pp. 507-510.

[54] K.K Li, T.S Chung, G.J Chen and G.Q. Tang, “A T.S approach to distribution
network reconfiguration for loss reduction”, Electric Power Components and
Systems, Taylor and Francis, 2003. pp. 571-585.
[55] H. Mori and Y. Ogita, “A parallel TS based method for reconfiguration of
distribution systems”, Proceeding of IEEE/ PES Summer Meeting, Seatle, WA, 2000,
pp. 73-78.
[56] Fukuyoma, “RTS for distribution load transfer operation”, IEEE Power
Teaching Lab, Tokyo, Japan, 2000.
[57] H.D. Chiang and J. J Rene , “Optimal network reconfiguration in distribution
system”, Part 1:A new formulation and solution methodology, IEEE Transaction on
[58] H.D. Chiang and J.J Rene, “Optimal network reconfiguration in distribution
system”, Part 2:Solution algorithms and Numerical results , IEEE Transaction on
[59] Y.J. Jeon and J.C. Kim, “Network reconfiguration in RDS using SA and TS “,
IEEE /PES, Winter Meeting, 2000, pp. 2329-2333.
[60] E. Carpaneto and G. Chicco, “Performance of the SA based algorithms for the
optimal reconfiguration of distribution systems”, Power Tech Proceeding, 2001 IEEE,
Porto, Portugal, vol. 3, 2001, pp.6.
[61] S. Gracia, F. Abu Chacra, H. Opazo and E. Lopez, “Minimal loss
reconfiguration based on SA meta heuristic “, Proceeding of the 5th International
Conference on Electronics, Communication and Computers (CONLELECOMP
2005), pp. 1-5.

[62] Y-H. Song, G.S Wang and A.T. Johns, “Distribution network reconfiguration
for loss reduction using fuzzy controlled evolutionary programming”, IEEE Proc-
Gener. Transm. Distri., Vol. 144, No. 4, 1997, pp. 345-350.
[63] Y.T Hsiao and C.Y Chein, “Multiobjective optimal feeder reconfiguration”,
IEEE Proc-Gener. Transm. Distri., Vol. 148, No. 4, 2001, pp. 333-336.
[64] C-T. Su and C.S Lee, “Network reconfiguration of distribution system using
improved mixed integer Hybrid DE”, IEEE Transaction on Power Delivery., Vol. 18,
No. 3, 2003, pp.1022-1027.
[65] Y.T Hsiao, “Multiobjective evolutionary programming method for feeder
reconfiguration “,IEEE Transaction on Power System., Vol. 19, No. 1, 2004, pp. 594-
599.
[66] J-P. Chiou, C.-C. Chang and C-T. Su, ” Variable Scaled Hybrid Differential
Evolutionary for solving network reconfiguration of distribution system”, IEEE
Transaction on Power System., Vol. 20, No. 2, 2005, 668-674.
[67] A.C.B Delbem, A.C.P Carvalho and N.G Bretas, “Main chain representation
for evolutionary algorithms applied to distribution system reconfiguration”, IEEE
Transaction on Power System., Vol. 20, No. 1, 2005, pp. 425-436.
[68] E. Carpaneto and G. Chicco, “Ant Colony Search based minimum losses
reconfiguration of distribution systems”, IEEE MELECON2004, Dubrovink, Croatia,
2004, pp. 971-974.
[69] A. Ahuja and A. Pahwa, “Using ant colony optimization for loss minimization
in distribution network s”, Proceedings of the 37th Annual North American on Power
Symposium, 2005, pp. 470-474.

[70] C.-T. Su, C.-F. Chung and J.-P. Chiou, “Distribution net reconfiguration for
loss reduction by ant colony search algorithm”, Electric Power System Research,
ELSEVIER, 2005, pp. 190-199.
[71] L. Charles, H. Khan and S. Rarichandrson, “Distribution network
reconfiguration for loss reduction using ant colony system algorithms”, IEEE
INDICON 2005 Conference, Chennai, India, 2005, pp. 619-622.
[72] Web site: www.iridia.ulb.ac.bc/~mdorigo/ACO/about.html
[73] P. Pechac, “Application of ant colony optimization algorithm on the recursine
propagation model for urban microcell”, URSI XXVIIth General Assembly, Vol. 11,
No. 3, August 2002, Maastricht, .
[74] C. Blum, “Ant colony optimization : introduction and recent trends “, Physics
of Life Review 2, ELSERVIER, 2005, pp. 354-373.
[75] M. Dorigo and T. Stulzle, “The ant colony optimization metaheuristics:
algorithms, applications and advances”, In Handbook of Metaheuristics, F.Glover and
G. Kochenberger, EDS. Norwell, MA:Kluwer, 2000, Vol. 57, International Series in
Operation Research and Management Science, pp. 251-285.
[76] M. Dorigo and G.Di Caro, “Ant colony optimization : a new meta heuristic “,
In D. Crone, M. Dorigo and F.Glover, Editors, New Ideas in Optimization, pp. 11-32,
McGraw Hill, London, UK, 1999.
[77] S. Alonso, O. Cordon, F. de Viana and F. Herrera, “Integrating Evolutionary
computation components in ant colony optimization”, Recent Developments in
Biologically Inspired Computing, Ideal Group Publishing, 2004, pp. 148-180.
[78] M. Dorigo and L.M. Gambardella, “Ant algorithm for discrete optimization “,
Institute of technology “, Artificial Life, Vol. 5, No. 2, 1999, pp. 137-172.

[79] M. Dorigo, V. Maniezto and A. Colorni, “Ant system: optimization by a
colony of cooperative agents”, IEEE trans. on System MAN and Cybernetics-part,
B26 , Vol. 26,No. 1, 1996, pp.29-41.
[80] X-Y. Ye, X-R. Cheng, L-M. Lin and Q-Y. Feng, “Research of the best repair
path based on an improved ant colony algorithm in power distribution network”, 2005
IEEE/PES Trans. and Dist Conference and Exhibition, Asia and Pacific, China, 2005,
pp. 1-5.
[81] M. Dorig and L.M. Cambardella, “Ant colony system: Acooperative learning
approach to the TSP”, IEEE Trans. on Evolutionary Computating, Vol. 1,No. 1, 1997.
[82] L.M. Gambardello and M. Dorigo, “Ant Q: a reinforcement learning approach
to the TSP”, Proc-of MC-95. on the 2 nd International Conference on Machine
Learning, Morgan, Kanfmann, 1995, pp. 252-260.
[83] M. Dorigo, “Ant algorithms solve different optimization problems”, Proc-of
6th European Conference on Artificial Life, LNAI2159, Springer-Verlag, 2000, pp.11-
22.
[84] A. Colorni, M. Dorigo and V. Maniezzo, “Distribution optimization by ant
colonies “, Proc. Of ECAC91-European Conference on Artificial life, Paris, France,
ELSEVIER ,1991, pp. 134-142.
[85] W.Q Xiong and P. Wei, “A kind of ant colony algorithm for function
optimization “, Proc-1 st International Conference on Machine Learning and
Cybernetics , Beijing, 2002, pp. 552-555..
[86] C. Blum and M. Dorigo, “The hyber cube framework for ant colony
optimization “, IEEE Trans. on System Man. And Cybernetics, Vol. 34, No. 2, 2004,
pp. 1161-1172.

[87] E. Elbeltagi, T. Hagazy and D. Crierson, “Comparisons among five
evolutionary based optimization algorithms”, Advanced Engineering Informatics,
ELSEVIER LTD, 2005, pp. 43-53.
[88] Web site: www.eece.ksu.edu

Appendix A
System Data

Table A.1: System data of test case 1
Section Bus to Bus Section Section End Bus Real Load End Bus
Resistance Reactance (Ω) Power (kW) Reactive
(Ω) Load
(KVAR)
0-1 0.0922 0.0470 100 60
1-2 0.4930 0.2511 90 40
2-3 0.3660 0.1864 120 80
3-4 0.3811 0.1941 60 30
4-5 0.8190 0.7070 60 20
5-6 0.1872 0.6188 200 100
6-7 0.7114 0.2351 200 100
7-8 1.0300 0.7400 60 20
8-9 1.0440 0.7400 60 20
9-10 0.1966 0.0650 45 30
10-11 0.3744 0.1238 60 35
11-12 1.4680 1.1550 60 35
12-13 0.5416 0.7129 120 80
13-14 0.5910 0.5260 60 10
14-15 0.7463 0.5450 60 20
15-16 1.2890 1.7210 60 20
16-17 0.7320 0.5740 90 40
1-18 0.1640 0.1565 90 40
18-19 1.5042 1.3554 90 40
19-20 0.4095 0.4784 90 40
20-21 0.7089 0.9373 90 40
2-22 0.4512 0.3083 90 50
22-23 0.8980 0.7091 420 200
23-24 0.8960 0.7011 420 200
5-25 0.2030 0.1034 60 25
25-26 0.2842 0.1447 60 25
26-27 1.0590 0.9337 60 20
27-28 0.8042 0.7006 120 70
28-29 0.5075 0.2585 200 600
29-30 0.9744 0.9630 150 70
30-31 0.3105 0.3619 210 100
31-32 0.3410 0.5302 60 40
7-20 2.0000 2.0000 - -
8-14 2.0000 2.0000 - -
11-21 2.0000 2.0000 - -
17-32 0.5000 0.5000 - -
24-28 0.5000 0.5000 - -

Bus R X PL QL
(Ω) (Ω) (KW) (KVAR)
A-1 0.1944 0.6624 0 0
1-2 0.2096 0.4304 100 50
2-3 0.2358 0.4842 300 200
3-4 0.0917 0.1883 350 250
4-5 0.2096 0.4304 220 100
5-6 0.0393 0.0807 1100 800
6-7 0.0405 0.1380 400 320
7-8 0.1048 0.2152 300 200
7-9 0.2358 0.4842 300 230
7-10 0.1048 0.2152 300 260
B-11 0.0786 0.1614 0 0
11-12 0.3406 0.6944 1200 800
12-13 0.0262 0.0538 800 600
12-14 0.0786 0.1614 700 500
C-15 0.1134 0.3864 0 0
15-16 0.0524 0.1076 300 150
16-17 0.0524 0.1076 500 350
17-18 0.1572 0.3228 700 400
18-19 0.0393 0.0807 1200 1000
19-20 0.1703 0.3497 300 300
20-21 0.2358 0.4842 400 350
21-22 0.1572 0.3228 50 20
21-23 0.1965 0.4035 50 20
23-24 0.1310 0.2690 50 10
D-25 0.0567 0.1932 50 30
25-26 0.1048 0.2152 100 60
26-27 0.2489 0.5111 100 70
27-28 0.0486 0.1656 1800 1300
28-29 0.1310 0.2690 200 120
E-30 0.1965 0.3960 0 0
30-31 0.1310 0.2690 1800 1600
31-32 0.1310 0.2690 200 150
32-33 0.0262 0.0538 200 100
33-34 0.1703 0.3497 800 600
34-35 0.0524 0.1076 100 60
35-36 0.4978 1.0222 100 60
36-37 0.0393 0.0807 20 10
37-38 0.0393 0.0807 20 10
38-39 0.0786 0.1614 20 10
39-40 0.2096 0.4304 20 10

Bus R X PL QL
38-41 0.1965 0.4035 200 160
41-42 0.2096 0.4304 50 30
F-43 0.0486 0.1656 0 0
43-44 0.0393 0.0807 30 20
44-45 0.1310 0.2690 800 700
45-46 0.2358 0.4842 200 150
G-47 0.2430 0.8280 0 0
47-48 0.0655 0.1345 0 0
48-49 0.0655 0.1345 0 0
49-50 0.0393 0.0807 200 160
50-51 0.0786 0.1614 800 600
51-52 0.0393 0.0807 500 300
52-53 0.0786 0.1614 500 350
53-54 0.0524 0.1076 500 300
54-55 0.1310 0.2690 200 80
H-56 0.2268 0.7728 0 0
56-57 0.5371 1.1029 30 20
57-58 0.0524 0.1076 600 420
58-59 0.0405 0.1380 0 0
59-60 0.0393 0.0807 20 10
60-61 0.0262 0.0538 20 10
61-62 0.1048 0.2152 200 130
62-63 0.2358 0.4842 300 240
63-64 0.0243 0.0828 300 200
I-65 0.0486 0.1656 0 0
65-66 0.1703 0.3497 50 30
66-67 0.1215 0.4140 0 0
67-68 0.2187 0.7452 400 360
68-69 0.0486 0.1656 0 0
69-70 0.0729 0.2484 0 0
70-71 0.0567 0.1932 2000 1500
71-72 0.0262 0.0528 200 150
J-73 0.3240 1.1040 0 0
73-74 0.0324 0.1104 0 0
74-75 0.0567 0.1932 1200 950
75-76 0.0486 0.1656 300 180
K-77 0.2511 0.8556 0 0
77-78 0.1296 0.4416 400 360
78-79 0.0486 0.1656 2000 1300
79-80 0.1310 0.2640 200 3140
80-81 0.1310 0.2640 500 360

Bus R X PL QL
81-82 0.0917 0.1883 100 30
82-83 0.3144 0.6456 400 360
5-55 0.1310 0.2690 - -
7-60 0.1310 0.2690 - -
11-43 0.1310 0.2690 - -
12-72 0.3406 0.6994 - -
13-76 0.4585 0.9415 - -
14-18 0.5371 1.0824 - -
16-26 0.0917 0.1883 - -
20-83 0.0786 0.1614 - -
28-32 0.0524 0.1076 - -
29-39 0.0786 0.1614 - -
34-46 0.0262 0.0538 - -
40-42 0.1965 0.4035 - -
53-64 0.0393 0.0807 - -

Bus R X PL QL
201-1 0.129 0.11 268.4741 167.4015
1-2 0.129 0.11 268.4741 167.4015
2-3 0.129 0.11 268.4741 167.4015
3-4 0.129 0.11 268.4741 167.4015
4-5 0.129 0.11 268.4741 167.4015
5-6 0.129 0.11 268.4741 167.4015
6-7 0.129 0.11 268.4741 167.4015
7-8 0.129 0.11 268.4741 167.4015
8-9 0.129 0.11 268.4741 167.4015
9-10 0.129 0.11 268.4741 167.4015
10-11 0.129 0.11 268.4741 167.4015
11-12 0.129 0.11 268.4741 167.4015
12-13 0.129 0.11 268.4741 167.4015
13-14 0.129 0.11 268.4741 167.4015
202-15 0.129 0.11 279.3581 174.188
15-16 0.129 0.11 279.3581 174.188
16-17 0.129 0.11 279.3581 174.188
17-18 0.129 0.11 279.3581 174.188
18-19 0.129 0.11 279.3581 174.188
19-20 0.129 0.11 279.3581 174.188
20-21 0.129 0.11 279.3581 174.188
21-22 0.129 0.11 279.3581 174.188
203-23 0.129 0.11 199.2625 124.246
23-24 0.129 0.11 199.2625 124.246
24-25 0.129 0.11 199.2625 124.246
25-26 0.129 0.11 199.2625 124.246
26-27 0.129 0.11 199.2625 124.246
27-28 0.129 0.11 199.2625 124.246
28-29 0.129 0.11 199.2625 124.246
29-30 0.129 0.11 199.2625 124.246
30-31 0.129 0.11 199.2625 124.246
31-32 0.129 0.11 199.2625 124.246
32-33 0.129 0.11 199.2625 124.246
33-34 0.129 0.11 199.2625 124.246
34-35 0.129 0.11 199.2625 124.246
35-36 0.129 0.11 199.2625 124.246
36-37 0.129 0.11 199.2625 124.246
37-38 0.129 0.11 199.2625 124.246
38-39 0.129 0.11 199.2625 124.246
39-40 0.129 0.11 199.2625 124.246

Bus R X PL QL
40-41 0.129 0.11 199.2625 124.246
41-42 0.129 0.11 199.2625 124.246
42-43 0.129 0.11 199.2625 124.246
43-44 0.129 0.11 199.2625 124.246
44-45 0.129 0.11 199.2625 124.246
45-46 0.129 0.11 199.2625 124.246
46-47 0.129 0.11 199.2625 124.246
47-48 0.129 0.11 199.2625 124.246
204-49 0.129 0.11 116.0969 72.3898
49-50 0.129 0.11 116.0969 72.3898
50-51 0.129 0.11 116.0969 72.3898
51-52 0.129 0.11 116.0969 72.3898
52-53 0.129 0.11 116.0969 72.3898
53-54 0.129 0.11 116.0969 72.3898
54-55 0.129 0.11 116.0969 72.3898
205-56 0.129 0.11 520.622 324.6231
56-57 0.129 0.11 520.622 324.6231
57-58 0.129 0.11 520.622 324.6231
58-59 0.129 0.11 520.622 324.6231
59-60 0.129 0.11 520.622 324.6231
60-61 0.129 0.11 520.622 324.6231
61-62 0.129 0.11 520.622 324.6231
62-63 0.129 0.11 520.622 324.6231
63-64 0.129 0.11 520.622 324.6231
64-65 0.129 0.11 520.622 324.6231
65-66 0.129 0.11 520.622 324.6231
66-67 0.129 0.11 520.622 324.6231
67-68 0.129 0.11 520.622 324.6231
68-69 0.129 0.11 520.622 324.6231
69-70 0.129 0.11 520.622 324.6231
70-71 0.129 0.11 520.622 324.6231
206-72 0.129 0.11 1381.553 861.4389
72-73 0.129 0.11 1381.553 861.4389
73-74 0.129 0.11 1381.553 861.4389
74-75 0.129 0.11 1381.553 861.4389
75-76 0.129 0.11 1381.553 861.4389
207-77 0.129 0.11 507.9239 316.7055
77-78 0.129 0.11 507.9239 316.7055
78-79 0.129 0.11 507.9239 316.7055
79-80 0.129 0.11 507.9239 316.7055
80-81 0.129 0.11 507.9239 316.7055

Bus R X PL QL
81-82 0.129 0.11 507.9239 316.7055
82-83 0.129 0.11 507.9239 316.7055
83-84 0.129 0.11 507.9239 316.7055
208-85 0.129 0.11 519.2111 323.7434
85-86 0.129 0.11 519.2111 323.7434
86-87 0.129 0.11 519.2111 323.7434
87-88 0.129 0.11 519.2111 323.7434
88-89 0.129 0.11 519.2111 323.7434
89-90 0.129 0.11 519.2111 323.7434
90-91 0.129 0.11 519.2111 323.7434
91-92 0.129 0.11 519.2111 323.7434
92-93 0.129 0.11 519.2111 323.7434
209-94 0.129 0.11 443.279 276.3975
94-95 0.129 0.11 443.279 276.3975
95-96 0.129 0.11 443.279 276.3975
96-97 0.129 0.11 443.279 276.3975
97-98 0.129 0.11 443.279 276.3975
98-99 0.129 0.11 443.279 276.3975
99-100 0.129 0.11 443.279 276.3975
100-101 0.129 0.11 443.279 276.3975
101-102 0.129 0.11 443.279 276.3975
118-119 0.129 0.11 203.1696 126.6822
119-120 0.129 0.11 203.1696 126.6822
120-121 0.129 0.11 203.1696 126.6822
212-122 0.129 0.11 221.6395 138.1988
122-123 0.129 0.11 221.6395 138.1988
123-124 0.129 0.11 221.6395 138.1988
124-125 0.129 0.11 221.6395 138.1988
125-126 0.129 0.11 221.6395 138.1988
126-127 0.129 0.11 221.6395 138.1988
127-128 0.129 0.11 221.6395 138.1988
128-129 0.129 0.11 221.6395 138.1988
129-130 0.129 0.11 221.6395 138.1988
130-131 0.129 0.11 221.6395 138.1988
131-132 0.129 0.11 221.6395 138.1988
213-133 0.129 0.11 507.9239 316.7055
214-134 0.129 0.11 253.9619 158.3527
134-135 0.129 0.11 253.9619 158.3527
135-136 0.129 0.11 253.9619 158.3527
136-137 0.129 0.11 253.9619 158.3527
137-138 0.129 0.11 253.9619 158.3527
138-139 0.129 0.11 253.9619 158.3527
139-140 0.129 0.11 253.9619 158.3527

Bus R X PL QL
140-141 0.129 0.11 253.9619 158.3527
141-142 0.129 0.11 253.9619 158.3527
143-144 0.129 0.11 253.9619 158.3527
144-145 0.129 0.11 253.9619 158.3527
145-146 0.129 0.11 253.9619 158.3527
146-147 0.129 0.11 253.9619 158.3527
147-148 0.129 0.11 253.9619 158.3527
148-149 0.129 0.11 253.9619 158.3527

Appendix B
Single Line Diagram

Figure B.1: Baran and Wu distribution system in the simulator

Figure B.2: Taiwan distribution system in the simulator

Figure B.3: SEC distribution system in the simulator

Appendix C
MATLAB PROGRAM

===================================== %Bus Data
=====================================
%Bus# V angle Pg Qg Pl Ql Psh Qsh Type
bus]=
‫؛‬1 0 0 0 0 0 0 0 1 201
‫؛‬3 0 0 167.402 268.474 0 0 01 1
‫؛‬3 0 0 167.402 268.474 0 0 01 2
‫؛‬3 0 0 167.402 268.474 0 0 01 3
‫؛‬3 0 0 167.402 268.474 0 0 01 4
‫؛‬3 0 0 167.402 268.474 0 0 01 5
‫؛‬3 0 0 167.402 268.474 0 0 01 6
‫؛‬3 0 0 167.402 268.474 0 0 01 7
‫؛‬3 0 0 167.402 268.474 0 0 01 8
‫؛‬3 0 0 167.402 268.474 0 0 01 9
‫؛‬3 0 0 167.402 268.474 0 0 01 10
‫؛‬3 0 0 167.402 268.474 0 0 01 11
‫؛‬3 0 0 167.402 268.474 0 0 01 12
‫؛‬3 0 0 167.402 268.474 0 0 01 13
‫؛‬3 0 0 167.402 268.474 0 0 01 14
‫؛‬1 0 0 0 0 0 0 0 1 202
‫؛‬3 0 0 174.188 279.358 0 0 01 15
‫؛‬3 0 0 174.188 279.358 0 0 01 16
‫؛‬3 0 0 174.188 279.358 0 0 01 17
‫؛‬3 0 0 174.188 279.358 0 0 01 18

‫؛‬3 0 0 174.188 279.358 0 0 01 19
‫؛‬3 0 0 174.188 279.358 0 0 01 20
‫؛‬3 0 0 174.188 279.358 0 0 01 21
‫؛‬3 0 0 174.188 279.358 0 0 01 22
‫؛‬1 0 0 0 0 0 0 0 1 203
‫؛‬3 0 0 124.246 199.263 0 0 01 23
‫؛‬3 0 0 124.246 199.263 0 0 01 24
‫؛‬3 0 0 124.246 199.263 0 0 01 25
‫؛‬3 0 0 124.246 199.263 0 0 01 26
‫؛‬3 0 0 124.246 199.263 0 0 01 27
‫؛‬3 0 0 124.246 199.263 0 0 01 28
‫؛‬3 0 0 124.246 199.263 0 0 01 29
‫؛‬3 0 0 124.246 199.263 0 0 01 30
‫؛‬3 0 0 124.246 199.263 0 0 01 31
‫؛‬3 0 0 124.246 199.263 0 0 01 32
‫؛‬3 0 0 124.246 199.263 0 0 01 33
‫؛‬3 0 0 124.246 199.263 0 0 01 34
‫؛‬3 0 0 124.246 199.263 0 0 01 35
‫؛‬3 0 0 124.246 199.263 0 0 01 36
‫؛‬3 0 0 124.246 199.263 0 0 01 37
‫؛‬3 0 0 124.246 199.263 0 0 01 38
‫؛‬3 0 0 124.246 199.263 0 0 01 39
‫؛‬3 0 0 124.246 199.263 0 0 01 40
‫؛‬3 0 0 124.246 199.263 0 0 01 41
‫؛‬3 0 0 124.246 199.263 0 0 01 42

‫؛‬3 0 0 124.246 199.263 0 0 01 43
‫؛‬3 0 0 124.246 199.263 0 0 01 44
‫؛‬3 0 0 124.246 199.263 0 0 01 45
‫؛‬3 0 0 124.246 199.263 0 0 01 46
‫؛‬3 0 0 124.246 199.263 0 0 01 47
‫؛‬3 0 0 124.246 199.263 0 0 01 48
‫؛‬1 0 0 0 0 0 0 0 1 204
‫؛‬3 0 0 72.389 116.097 0 0 01 49
‫؛‬3 0 0 72.389 116.097 0 0 01 50
‫؛‬3 0 0 72.389 116.097 0 0 01 51
‫؛‬3 0 0 72.389 116.097 0 0 01 52
‫؛‬3 0 0 72.389 116.097 0 0 01 53
‫؛‬3 0 0 72.389 116.097 0 0 01 54
‫؛‬3 0 0 72.389 116.097 0 0 01 55
‫؛‬1 0 0 0 0 0 0 0 1 205
‫؛‬3 0 0 324.623 520.62 0 0 01 56
‫؛‬3 0 0 324.623 520.62 0 0 01 57
‫؛‬3 0 0 324.623 520.62 0 0 01 58
‫؛‬3 0 0 324.623 520.62 0 0 01 59
‫؛‬3 0 0 324.623 520.62 0 0 01 60
‫؛‬3 0 0 324.623 520.62 0 0 01 61
‫؛‬3 0 0 324.623 520.62 0 0 01 62
‫؛‬3 0 0 324.623 520.62 0 0 01 63
‫؛‬3 0 0 324.623 520.62 0 0 01 64
‫؛‬3 0 0 324.623 520.62 0 0 01 65

‫؛‬3 0 0 324.623 520.62 0 0 01 66
‫؛‬3 0 0 324.623 520.62 0 0 01 67
‫؛‬3 0 0 324.623 520.62 0 0 01 68
‫؛‬3 0 0 324.623 520.62 0 0 01 69
‫؛‬3 0 0 324.623 520.62 0 0 01 70
‫؛‬3 0 0 324.623 520.62 0 0 01 71
‫؛‬1 0 0 0 0 0 0 0 1 206
‫؛‬3 0 0 861.439 1381.5 0 0 01 72
‫؛‬3 0 0 861.439 1381.5 0 0 01 73
‫؛‬3 0 0 861.439 1381.5 0 0 01 74
‫؛‬3 0 0 861.439 1381.5 0 0 01 75
‫؛‬3 0 0 861.439 1381.5 0 0 01 76
‫؛‬1 0 0 0 0 0 0 0 1 207
‫؛‬3 0 0 316.705 507.924 0 0 01 77
‫؛‬3 0 0 316.705 507.924 0 0 01 78
‫؛‬3 0 0 316.705 507.924 0 0 01 79
‫؛‬3 0 0 316.705 507.924 0 0 01 80
‫؛‬3 0 0 316.705 507.924 0 0 01 81
‫؛‬3 0 0 316.705 507.924 0 0 01 82
‫؛‬3 0 0 316.705 507.924 0 0 01 83
‫؛‬3 0 0 316.705 507.924 0 0 01 84
‫؛‬1 0 0 0 0 0 0 0 1 208
‫؛‬3 0 0 323.74 519.21 0 0 01 85
‫؛‬3 0 0 323.74 519.21 0 0 01 86
‫؛‬3 0 0 323.74 519.21 0 0 01 87

‫؛‬3 0 0 323.74 519.21 0 0 01 88
‫؛‬3 0 0 323.74 519.21 0 0 01 89
‫؛‬3 0 0 323.74 519.21 0 0 01 90
‫؛‬3 0 0 323.74 519.21 0 0 01 91
‫؛‬3 0 0 323.74 519.21 0 0 01 92
‫؛‬3 0 0 323.74 519.21 0 0 01 93
‫؛‬1 0 0 0 0 0 0 0 1 209
‫؛‬3 0 0 276.39 443.28 0 0 01 94
‫؛‬3 0 0 276.39 443.28 0 0 01 95
‫؛‬3 0 0 276.39 443.28 0 0 01 96
‫؛‬3 0 0 276.39 443.28 0 0 01 97
‫؛‬3 0 0 276.39 443.28 0 0 01 98
‫؛‬3 0 0 276.39 443.28 0 0 01 99
‫؛‬3 0 0 276.39 443.28 0 0 0 1 100
‫؛‬3 0 0 276.39 443.28 0 0 0 1 101
‫؛‬3 0 0 276.39 443.28 0 0 0 1 102
‫؛‬3 0 0 276.39 443.28 0 0 0 1 103
‫؛‬3 0 0 276.39 443.28 0 0 0 1 104
‫؛‬1 0 0 0 0 0 0 0 1 210
‫؛‬3 0 0 218.815 350.93 0 0 0 1 105
‫؛‬3 0 0 218.815 350.93 0 0 0 1 106
‫؛‬3 0 0 218.815 350.93 0 0 0 1 107
‫؛‬3 0 0 218.815 350.93 0 0 0 1 108
‫؛‬3 0 0 218.815 350.93 0 0 0 1 109
‫؛‬3 0 0 218.815 350.93 0 0 0 1 110

‫؛‬3 0 0 218.815 350.93 0 0 0 1 111
‫؛‬3 0 0 218.815 350.93 0 0 0 1 112
‫؛‬3 0 0 218.815 350.93 0 0 0 1 113
‫؛‬3 0 0 218.815 350.93 0 0 0 1 114
‫؛‬3 0 0 218.815 350.93 0 0 0 1 115
‫؛‬1 0 0 0 0 0 0 0 1 211
‫؛‬3 0 0 126.682 203.169 0 0 0 1 116
‫؛‬3 0 0 126.682 203.169 0 0 0 1 117
‫؛‬3 0 0 126.682 203.169 0 0 0 1 118
‫؛‬3 0 0 126.682 203.169 0 0 0 1 119
‫؛‬3 0 0 126.682 203.169 0 0 0 1 120
‫؛‬3 0 0 126.682 203.169 0 0 0 1 121
‫؛‬1 0 0 0 0 0 0 0 1 212
‫؛‬3 0 0 138.198 221.64 0 0 0 1 122
‫؛‬3 0 0 138.198 221.64 0 0 0 1 123
‫؛‬3 0 0 138.198 221.64 0 0 0 1 124
‫؛‬3 0 0 138.198 221.64 0 0 0 1 125
‫؛‬3 0 0 138.198 221.64 0 0 0 1 126
‫؛‬3 0 0 138.198 221.64 0 0 0 1 127
‫؛‬3 0 0 138.198 221.64 0 0 0 1 128
‫؛‬3 0 0 138.198 221.64 0 0 0 1 129
‫؛‬3 0 0 138.198 221.64 0 0 0 1 130
‫؛‬3 0 0 138.198 221.64 0 0 0 1 131
‫؛‬3 0 0 138.198 221.64 0 0 0 1 132
‫؛‬1 0 0 0 0 0 0 0 1 213

‫؛‬3 0 0 316.705 507.92 0 0 0 1 133
‫؛‬1 0 0 0 0 0 0 0 1 214
‫؛‬3 0 0 158.353 253.96 0 0 0 1 134
‫؛‬3 0 0 158.353 253.96 0 0 0 1 135
‫؛‬3 0 0 158.353 253.96 0 0 0 1 136
‫؛‬3 0 0 158.353 253.96 0 0 0 1 137
‫؛‬3 0 0 158.353 253.96 0 0 0 1 138
‫؛‬3 0 0 158.353 253.96 0 0 0 1 139
‫؛‬3 0 0 158.353 253.96 0 0 0 1 140
‫؛‬3 0 0 158.353 253.96 0 0 0 1 141
‫؛‬3 0 0 158.353 253.96 0 0 0 1 142
‫؛‬3 0 0 158.353 253.96 0 0 0 1 143
‫؛‬3 0 0 158.353 253.96 0 0 0 1 144
‫؛‬3 0 0 158.353 253.96 0 0 0 1 145
‫؛‬3 0 0 158.353 253.96 0 0 0 1 146
‫؛‬3 0 0 158.353 253.96 0 0 0 1 147
‫؛‬3 0 0 158.353 253.96 0 0 0 1 148
‫[؛‬3 0 0 158.353 253.96 0 0 0 1 149

==================================== %Line Data
=====================================
%Line Data
%BranchNo From To R X L_charg Tap Phase_Shift
line1]=
‫؛‬0 1 0 0.1100 0.1290 1 201
‫؛‬0 1 0 0.1100 0.1290 2 1
‫؛‬0 1 0 0.1100 0.1290 3 2
‫؛‬0 1 0 0.1100 0.1290 4 3
‫؛‬0 1 0 0.1100 0.1290 5 4
‫؛‬0 1 0 0.1100 0.1290 6 5
‫؛‬0 1 0 0.1100 0.1290 7 6
‫؛‬0 1 0 0.1100 0.1290 8 7
‫؛‬0 1 0 0.1100 0.1290 9 8
‫؛‬0 1 0 0.1100 0.1290 10 9
‫؛‬0 1 0 0.1100 0.1290 11 10
‫؛‬0 1 0 0.1100 0.1290 12 11
‫؛‬0 1 0 0.1100 0.1290 13 12
‫؛‬0 1 0 0.1100 0.1290 14 13
‫؛‬0 1 0 0.1100 0.1290 15 202
‫؛‬0 1 0 0.1100 0.1290 16 15
‫؛‬0 1 0 0.1100 0.1290 17 16
‫؛‬0 1 0 0.1100 0.1290 18 17
‫؛‬0 1 0 0.1100 0.1290 19 18
‫؛‬0 1 0 0.1100 0.1290 20 19

‫؛‬0 1 0 0.1100 0.1290 21 20
‫؛‬0 1 0 0.1100 0.1290 22 21
‫؛‬0 1 0 0.1100 0.1290 23 203
‫؛‬0 1 0 0.1100 0.1290 24 23
‫؛‬0 1 0 0.1100 0.1290 25 24
‫؛‬0 1 0 0.1100 0.1290 26 25
‫؛‬0 1 0 0.1100 0.1290 27 26
‫؛‬0 1 0 0.1100 0.1290 28 27
‫؛‬0 1 0 0.1100 0.1290 29 28
‫؛‬0 1 0 0.1100 0.1290 30 29
‫؛‬0 1 0 0.1100 0.1290 31 30
‫؛‬0 1 0 0.1100 0.1290 32 31
‫؛‬0 1 0 0.1100 0.1290 33 32
‫؛‬0 1 0 0.1100 0.1290 34 33
‫؛‬0 1 0 0.1100 0.1290 35 34
‫؛‬0 1 0 0.1100 0.1290 36 35
‫؛‬0 1 0 0.1100 0.1290 37 36
‫؛‬0 1 0 0.1100 0.1290 38 37
‫؛‬0 1 0 0.1100 0.1290 39 38
‫؛‬0 1 0 0.1100 0.1290 40 39
‫؛‬0 1 0 0.1100 0.1290 41 40
‫؛‬0 1 0 0.1100 0.1290 42 41
‫؛‬0 1 0 0.1100 0.1290 43 42
‫؛‬0 1 0 0.1100 0.1290 44 43
‫؛‬0 1 0 0.1100 0.1290 45 44

‫؛‬0 1 0 0.1100 0.1290 46 45
‫؛‬0 1 0 0.1100 0.1290 47 46
‫؛‬0 1 0 0.1100 0.1290 48 47
‫؛‬0 1 0 0.1100 0.1290 49 204
‫؛‬0 1 0 0.1100 0.1290 50 49
‫؛‬0 1 0 0.1100 0.1290 51 50
‫؛‬0 1 0 0.1100 0.1290 52 51
‫؛‬0 1 0 0.1100 0.1290 53 52
‫؛‬0 1 0 0.1100 0.1290 54 53
‫؛‬0 1 0 0.1100 0.1290 55 54
‫؛‬0 1 0 0.1100 0.1290 56 205
‫؛‬0 1 0 0.1100 0.1290 57 56
‫؛‬0 1 0 0.1100 0.1290 58 57
‫؛‬0 1 0 0.1100 0.1290 59 58
‫؛‬0 1 0 0.1100 0.1290 60 59
‫؛‬0 1 0 0.1100 0.1290 61 60
‫؛‬0 1 0 0.1100 0.1290 62 61
‫؛‬0 1 0 0.1100 0.1290 63 62
‫؛‬0 1 0 0.1100 0.1290 64 63
‫؛‬0 1 0 0.1100 0.1290 65 64
‫؛‬0 1 0 0.1100 0.1290 66 65
‫؛‬0 1 0 0.1100 0.1290 67 66
‫؛‬0 1 0 0.1100 0.1290 68 67
‫؛‬0 1 0 0.1100 0.1290 69 68
‫؛‬0 1 0 0.1100 0.1290 70 69

‫؛‬0 1 0 0.1100 0.1290 71 70
‫؛‬0 1 0 0.1100 0.1290 72 206
‫؛‬0 1 0 0.1100 0.1290 73 72
‫؛‬0 1 0 0.1100 0.1290 74 73
‫؛‬0 1 0 0.1100 0.1290 75 74
‫؛‬0 1 0 0.1100 0.1290 76 75
‫؛‬0 1 0 0.1100 0.1290 77 207
‫؛‬0 1 0 0.1100 0.1290 78 77
‫؛‬0 1 0 0.1100 0.1290 79 78
‫؛‬0 1 0 0.1100 0.1290 80 79
‫؛‬0 1 0 0.1100 0.1290 81 80
‫؛‬0 1 0 0.1100 0.1290 82 81
‫؛‬0 1 0 0.1100 0.1290 83 82
‫؛‬0 1 0 0.1100 0.1290 84 83
‫؛‬0 1 0 0.1100 0.1290 85 208
‫؛‬0 1 0 0.1100 0.1290 86 85
‫؛‬0 1 0 0.1100 0.1290 87 86
‫؛‬0 1 0 0.1100 0.1290 88 87
‫؛‬0 1 0 0.1100 0.1290 89 88
‫؛‬0 1 0 0.1100 0.1290 90 89
‫؛‬0 1 0 0.1100 0.1290 91 90
‫؛‬0 1 0 0.1100 0.1290 92 91
‫؛‬0 1 0 0.1100 0.1290 93 92
‫؛‬0 1 0 0.1100 0.1290 94 209
‫؛‬0 1 0 0.1100 0.1290 95 94

‫؛‬0 1 0 0.1100 0.1290 96 95
‫؛‬0 1 0 0.1100 0.1290 97 96
‫؛‬0 1 0 0.1100 0.1290 98 97
‫؛‬0 1 0 0.1100 0.1290 99 98
‫؛‬0 1 0 0.1100 0.1290 100 99
‫؛‬0 1 0 0.1100 0.1290 101 100
‫؛‬0 1 0 0.1100 0.1290 102 101
‫؛‬0 1 0 0.1100 0.1290 103 102
‫؛‬0 1 0 0.1100 0.1290 104 103
‫؛‬0 1 0 0.1100 0.1290 105 210
‫؛‬0 1 0 0.1100 0.1290 106 105
‫؛‬0 1 0 0.1100 0.1290 107 106
‫؛‬0 1 0 0.1100 0.1290 108 107
‫؛‬0 1 0 0.1100 0.1290 109 108
‫؛‬0 1 0 0.1100 0.1290 110 109
‫؛‬0 1 0 0.1100 0.1290 111 110
‫؛‬0 1 0 0.1100 0.1290 112 111
‫؛‬0 1 0 0.1100 0.1290 113 112
‫؛‬0 1 0 0.1100 0.1290 114 113
‫؛‬0 1 0 0.1100 0.1290 115 108
‫؛‬0 1 0 0.1100 0.1290 116 211
‫؛‬0 1 0 0.1100 0.1290 117 116
‫؛‬0 1 0 0.1100 0.1290 118 117
‫؛‬0 1 0 0.1100 0.1290 119 118
‫؛‬0 1 0 0.1100 0.1290 120 119

‫؛‬0 1 0 0.1100 0.1290 121 120
‫؛‬0 1 0 0.1100 0.1290 122 212
‫؛‬0 1 0 0.1100 0.1290 123 122
‫؛‬0 1 0 0.1100 0.1290 124 123
‫؛‬0 1 0 0.1100 0.1290 125 124
‫؛‬0 1 0 0.1100 0.1290 126 125
‫؛‬0 1 0 0.1100 0.1290 127 126
‫؛‬0 1 0 0.1100 0.1290 128 127
‫؛‬0 1 0 0.1100 0.1290 129 128
‫؛‬0 1 0 0.1100 0.1290 130 129
‫؛‬0 1 0 0.1100 0.1290 131 130
‫؛‬0 1 0 0.1100 0.1290 132 131
‫؛‬0 1 0 0.1100 0.1290 133 213
‫؛‬0 1 0 0.1100 0.1290 134 214
‫؛‬0 1 0 0.1100 0.1290 135 134
‫؛‬0 1 0 0.1100 0.1290 136 135
‫؛‬0 1 0 0.1100 0.1290 137 136
‫؛‬0 1 0 0.1100 0.1290 138 137
‫؛‬0 1 0 0.1100 0.1290 139 138
‫؛‬0 1 0 0.1100 0.1290 140 139
‫؛‬0 1 0 0.1100 0.1290 141 140
‫؛‬0 1 0 0.1100 0.1290 142 141
‫؛‬0 1 0 0.1100 0.1290 143 142
‫؛‬0 1 0 0.1100 0.1290 144 143
‫؛‬0 1 0 0.1100 0.1290 145 144

‫؛‬0 1 0 0.1100 0.1290 146 145
‫؛‬0 1 0 0.1100 0.1290 147 146
‫؛‬0 1 0 0.1100 0.1290 148 147
‫؛‬0 1 0 0.1100 0.1290 149 148
‫؛‬0 1 0 0.1100 0.1290 38 3
‫؛‬0 1 0 0.1100 0.1290 22 14
‫؛‬0 1 0 0.1100 0.1290 76 48
‫؛‬0 1 0 0.1100 0.1290 56 55
‫؛‬0 1 0 0.1100 0.1290 76 65
‫؛‬0 1 0 0.1100 0.1290 93 71
‫؛‬0 1 0 0.1100 0.1290 90 84
‫؛‬0 1 0 0.1100 0.1290 114 89
‫؛‬0 1 0 0.1100 0.1290 109 104
‫؛‬0 1 0 0.1100 0.1290 132 105
‫؛‬0 1 0 0.1100 0.1290 121 115
‫؛‬0 1 0 0.1100 0.1290 137 129
‫[؛‬0 1 0 0.1100 0.1290 149 133
tol=1e-8‫؛‬
vmin=0.90‫؛‬
vmax=1.02‫؛‬
iter_max=200‫؛‬
flag=1‫؛‬
acc=1‫؛‬
display='n‫'؛‬

datanew‫؛‬
Vb=13.8‫؛‬
Sb=100‫؛‬
Zb=Vb^2/Sb‫؛‬
bus(:,6:7)=bus(:,6:7)/Sb/1000‫؛‬
line1(:,3:4)=line1(:,3:4)/Zb‫؛‬
line=line1‫؛‬
%open the lines
line(openline‫(=] [؛‬:،
]bus_sol,line_flow,P_loss]
=loadflow(bus,line,tol,iter_max,vmin,vmax,acc,display,flag‫(؛‬

clear all
%parameters
rau=0.9‫؛‬
alpha=2‫؛‬
beta=0.5‫؛‬
alp=.01‫؛‬
c0=1‫؛‬
N=50; % number of tours
k=5; % number of ants
m=13; % number of loops
%call calculating losses in all switches
calloss‫؛‬
for x=1:N‫؛‬
antselection‫؛‬
ant=[ant1 ant2 ant3 ant4 antt5 ant6 antt7 ant8 ant9 ant10 ant11 ant12 ant13];%
switches selected by k ants

%opening the switches that selected by k ants
switchopening‫؛‬
%Local updating phermone
localphermonupdate‫؛‬
%Global updating phermone
]plossmin(x) switches(x)]=min(Ploss(
bestswitch(x,:)=ant(switches(x(:،(
globalphermoneupdate3‫؛‬
end
]ploss sw]=min(plossmin(
bestantswitch=bestswitch(sw(:،

%losses in switches
%all switches closed
%the current ( per unit(
%the switch resistance (per unit(
L1=[2 3 4 5 6 7 8 9 10 11 12 13 14 16 17 18 19 20 21 22 151]; % Loop 1
L2=[24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 150]; % Loop 2
L3=[50 51 52 53 54 55 153]; % Loop 3
L4=[ 39 40 41 42 43 44 45 46 47 48 73 74 75 76 152]; % Loop 4
L5=[57 58 59 60 61 62 63 64 65 154]; % Loop 5
L6=[78 79 80 81 82 83 84 86 87 88 89 90 156]; % Loop 6
L7=[66 67 68 69 70 71 91 92 93 155];% Loop 7
L8=[95 96 97 98 99 100 101 102 103 104 106 107 108 109 158]; %Loop 8
L9=[110 111 112 113 114 157]; % Loop 9
L10=[115 117 118 119 120 121 160]; % Loop 10
L11=[123 124 125 126 127 128 129 130 131 132 159]; % Loop 11
L12=[135 136 137 161]; % Loop 12
L13=[138 139 140 141 142 143 144 145 146 147 148 149 162]; % Loop 13
n1=21‫؛‬
n2=16‫؛‬
n3=7‫؛‬
n4=15‫؛‬

n5=10‫؛‬
n6=13‫؛‬
n7=10‫؛‬
n8=15‫؛‬
n9=6‫؛‬
n10=7‫؛‬
n11=11‫؛‬
n12=4‫؛‬
n13=13‫؛‬
ant=zeros(k,m‫(؛‬
Ploss=zeros(k,1 ‫(؛‬
plossmin=zeros(N,1‫(؛‬
DTL1=zeros(n1,1‫(؛‬

DTL10=zeros(n10,1 ‫(؛‬
T1DL1=zeros(1,n1 ‫(؛‬
T1DL10=zeros(1,n10‫(؛‬
DTLS1=zeros(n1,1‫(؛‬

DTLS10=zeros(n10,1 ‫(؛‬
%initial Phermone T
T1=c0*ones(n1,1 ‫(؛‬
T2=c0*ones(n2,1 ‫(؛‬
T3=c0*ones(n3,1 ‫(؛‬
T4=c0*ones(n4,1 ‫(؛‬
T5=c0*ones(n5,1 ‫(؛‬
T6=c0*ones(n6,1 ‫(؛‬
T7=c0*ones(n7,1 ‫(؛‬
T8=c0*ones(n8,1 ‫(؛‬
T9=c0*ones(n9,1 ‫(؛‬
T10=c0*ones(n10,1‫(؛‬
T11=c0*ones(n11,1‫(؛‬

T12=c0*ones(n12,1‫(؛‬
T13=c0*ones(n13,1‫(؛‬
openline‫=] [؛‬
main2‫؛‬
]nb mb]=size(line_flow‫(؛‬
in1=1:2:nb‫؛‬
in2=2:2:nb‫؛‬
pfl1=line_flow(in1,4 ‫(؛‬
pfl2=line_flow(in2,4 ‫(؛‬
pflt=abs(pfl1+pfl2‫(؛‬
%calculation of the losses in switches
swl=pflt‫؛‬
%inversion of losses
swL1=swl(L1 ‫(؛‬

swL10=swl(L10‫(؛‬
invswL1=1./swL1‫؛‬

%ant selection
if x<=(0.05*N(
q0=0.95‫؛‬
elseif x<=(0.90*N(
q0=0.20‫؛‬
else
q0=0.95‫؛‬
end
%Transition Rule (selection by probability(
%multiplication switches inside loops
T1DL1=(invswL1).^beta.*(T1).^alpha‫؛‬

]maxTDL1 s1ws1]=max(T1DL1‫(؛‬
%selection from loop 1
for i=1:k‫؛‬
q=rand(m,1‫(؛‬
if q(1)<=q0‫؛‬

ant1(i,1)=L1(s1ws1‫(؛‬
else
s1=L1(one_out_of_n(n1 ‫((؛‬
ant1(i,1)=s1‫؛‬
end
if q(2)<=q0‫؛‬
ant2(i,1)=L2(s1ws2‫(؛‬
else
ant2(i,1)=s2‫؛‬
end
if q(3)<=q0‫؛‬
ant3(i,1)=L3(s1ws3‫(؛‬

else
ant3(i,1)=s3‫؛‬
end
if q(4)<=q0‫؛‬
ant4(i,1)=L4(s1ws4‫(؛‬
else
ant4(i,1)=s4‫؛‬
end
if q(5)<=q0‫؛‬
antt5(i,1)=L5(s1ws5 ‫(؛‬
else

antt5(i,1)=s5‫؛‬
end
if q(6)<=q0‫؛‬
ant6(i,1)=L6(s1ws6‫(؛‬
else
ant6(i,1)=s6‫؛‬
end
if q(7)<=q0‫؛‬
antt7(i,1)=L7(s1ws7 ‫(؛‬
else
antt7(i,1)=s7‫؛‬

end
if q(8)<=q0‫؛‬
ant8(i,1)=L8(s1ws8‫(؛‬
else
ant8(i,1)=s8‫؛‬
end
if q(9)<=q0‫؛‬
ant9(i,1)=L9(s1ws9‫(؛‬
else
ant9(i,1)=s9‫؛‬
end

if q(10)<=q0‫؛‬
ant10(i,1)=L10(s1ws10 ‫(؛‬
else
ant10(i,1)=s10‫؛‬
end
if q(11)<=q0‫؛‬
ant11(i,1)=L11(s1ws11 ‫(؛‬
else
ant11(i,1)=s11‫؛‬
end

if q(12)<=q0‫؛‬
ant12(i,1)=L12(s1ws12 ‫(؛‬
else
ant12(i,1)=s12‫؛‬
end
if q(13)<q0‫؛‬
ant13(i,1)=L13(s1ws13 ‫(؛‬
else
ant13(i,1)=s13‫؛‬
end
End

function y=one_out_of_n(n‫(؛‬
y=round(rand*(n-1)+1);

%opening the switches by ant
for i=1:k‫؛‬
Tabu(i,:)=ant(i‫(؛‬:،
openline=Tabu(i‫(؛‬:،
main2‫؛‬
Ploss(i)=P_loss‫؛‬
end

%updating phermone
%change in phermone
%LOOP 1
for z=1:n1‫؛‬
for i=1:k‫؛‬
if ant(i,1)==L1(z‫(؛‬
DTL1(z)=1/Ploss(i)+DTL1(z‫(؛‬
else
DTL1(z)=DTL1(z‫(؛‬
end
end
end
%LOOP 2
for z=1:n2‫؛‬
for i=1:k‫؛‬
if ant(i,2)==L2(z‫(؛‬
else

end
end
end
%LOOP 3
for z=1:n3‫؛‬
for i=1:k‫؛‬
if ant(i,3)==L3(z‫(؛‬
else
end
end
end
%LOOP 4
for z=1:n4‫؛‬
for i=1:k‫؛‬
if ant(i,4)==L4(z‫(؛‬

else
end
end
end
%LOOP 5
for z=1:n5‫؛‬
for i=1:k‫؛‬
if ant(i,5)==L5(z‫(؛‬
else
end
end
end
%LOOP 6

for z=1:n6‫؛‬
for i=1:k‫؛‬
if ant(i,6)==L6(z‫(؛‬
else
end
end
end
%LOOP 7
for z=1:n7‫؛‬
for i=1:k‫؛‬
if ant(i,7)==L7(z‫(؛‬
else
end
end
end
%LOOP 8

for z=1:n8‫؛‬
for i=1:k‫؛‬
if ant(i,8)==L8(z‫(؛‬
else
end
end
end
%LOOP 9
for z=1:n9‫؛‬
for i=1:k‫؛‬
if ant(i,9)==L9(z‫(؛‬
else
end
end
end

%LOOP 10
for z=1:n10‫؛‬
for i=1:k‫؛‬
if ant(i,10)==L10(z‫(؛‬
else
end
end
end
%LOOP 11
for z=1:n11‫؛‬
for i=1:k‫؛‬
if ant(i,11)==L11(z‫(؛‬
else

end
end
end
%LOOP 12
for z=1:n12‫؛‬
for i=1:k‫؛‬
if ant(i,12)==L12(z‫(؛‬
else
end
end
end
%LOOP 13
for z=1:n13‫؛‬
for i=1:k‫؛‬
if ant(i,13)==L13(z‫(؛‬
else

end
end
end
%the phermone
T1=(1-rau)*DTL1+(rau)*c0‫؛‬
T10=(1-rau)*DTL10+(rau)*c0‫؛‬
T11=(1-rau)*DTL11+(rau)*c0‫؛‬
T12=(1-rau)*DTL12+(rau)*c0‫؛‬
T13=(1-rau)*DTL13+(rau)*c0;

%global updating
%LOOP 1
for z=1:n1‫؛‬
if ant(switches(x),1)==L1(z‫(؛‬
DTLS1(z)=1/plossmin(x)+DTLS1(z‫(؛‬
else
DTLS1(z)=DTLS1(z‫(؛‬
end
end
%LOOP 2
for z=1:n2‫؛‬
else
end
end

%LOOP 3
for z=1:n3‫؛‬
else
end
end
%LOOP 4
for z=1:n4‫؛‬
else
end
end

%LOOP 5
for z=1:n5‫؛‬
else
end
end
%LOOP 6
for z=1:n6‫؛‬
else
end
end

%LOOP 7
for z=1:n7‫؛‬
else
end
end
%LOOP 8
for z=1:n8‫؛‬
else
end
end
%LOOP 9

for z=1:n9‫؛‬
else
end
end
%LOOP 10
for z=1:n10‫؛‬
else
end
end
%LOOP 11

for z=1:n11‫؛‬
else
end
end
%LOOP 12
for z=1:n12‫؛‬
else
end
end
%LOOP 13

for z=1:n13‫؛‬
else
end
end
%the phermone
T1=(1-alp)*T1+alp*DTLS1‫؛‬

Optimal Reconfiguration of Distribution

Transféré par

Informations du document

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Optimal Reconfiguration of Distribution

Transféré par

Droits d'auteur :

Formats disponibles

King Saud University

Distribution Networks Using Ant

Submitted in Partial Fulfillment of the Requirement for the Master's

Degree in the department of Electrical Engineering at the College of

Engineering King Saud University.

Prof. Hossam Talaat and

Prof. Saad Alghuwainem

PDF created with pdfFactory trial version www.pdffactory.com

Using Ant Colony Method

This thesis was discussed on 25 th of Jumada AlAwla 1428H ( 11th of June

2007 G) and was accepted.

Advisor: Prof. Hossam Talaat

Co-advisor: Prof. Saad Alghuwainem

Examiner: Prof. Abdulrahman Al-Orainy

Examiner: Prof. Abdulhameed Al-Ohaly

Examiner: Prof. Waheed Ghareeb

PDF created with pdfFactory trial version www.pdffactory.com

‫‪PDF created with pdfFactory trial version www.pdffactory.com‬‬

‫‪PDF created with pdfFactory trial version www.pdffactory.com‬‬

determine the configuration of the network. Reconfiguration of distribution network

is achieved through switching operation on switches of distribution network branches.

optimization (ACO) is adopted for solving the optimization problem. It is a

successively shorter feasible route by using information accumulated in the form of a

PDF created with pdfFactory trial version www.pdffactory.com

through the optimization of two objective functions. The performance of three

reveal that the proposed method is promising in distribution system reconfiguration.

PDF created with pdfFactory trial version www.pdffactory.com

Chapter Two: Literature Review………………………….……………………..…3

2.2 Heuristic Optimization Methods……………….…….…………..……………….4

2.3 Evolutionary Algorithms………………..………………………………………13

2.3.1 Genetic Algorithm(GA)………………………………………………………. 13

2.3.2 Fuzzy Logic…………………………………………………………………....16

2.3.3 Artificial Neural Network (ANN)…………………………………………..…17

2.3.4 Expert System (ES)………………………………………………………….…17

2.3.5 Particle Swarm…………………………………………………………………17

2.3.6 Tabu Search (TS)……………………………………………………………....17

2.3.7 Simulated Annealing (SA)…………………………………………………..…18

2.3.8 Evolutionary Programming(EP)…………………………………………….....19

2.3.9 Ant Colony Optimization (ACO)…………………………………………...….20

Chapter Three: Proposed Methodology………………………………..…………22

3.1 Problem Fromulation……………………………………………………...…….22

3.1.1 Mathematical Model…………………………………………………….…22

3.1.2 Objective Function………………………...………………………………23

3.2 Optimization Methods……………………………………………….………….25

3.3 Ant Colony Optimization(ACO)…………………………….…………………..27

3.3.2 Characteristics of ACO method…………………………….……………...28

3.3.3 Differences between Real and Artificial Ants……………………………..29

PDF created with pdfFactory trial version www.pdffactory.com

3.3.5 General Description of ACO……………………………………….……30

3.4 Proposed ACO Algorithm…………………………………………………..…31

Chapter Four: Developed Program and System Simulator……………………..36

4.1 Role of MATLAB Program and PowerWorld Simulator……………………….36

4.2 Developed MATLAB Program………………………………………………….36

4.2.2 MATLAB System…………………………………………………………37

4.2.3 MATLAB Program of Proposed Algorithm……………………………….38

4.2.4 Program Flow Chart……………………………………………………….39

4.3 PowerWorld Simulation……………………………………………………...…40

4.3.1 Main Features……………………………………………………….……..40

4.3.2 Implementation of Studied Systems………………………………………40

Five Chapters: Application of Proposed Algorithms………………………..…..46

5.2 Test System 1:Baran and Wu System………………………………………….46

5.2.1 System Description……………………………………………..…………..46

5.2.2 Optimal Reconfiguration based on Power Loss Minimization…………..…48

5.2.3 Optimal Reconfiguration based on Load Balancing……………………..…49