Genetic Algorithm for the Service Restoration of Unbalanced Distribution Systems with

Priority Customers

Undergraduate Pro ject Proposal

by

Limuel Khin L. Estorque

2008-24279

B.S. Electrical Engineering

Adviser:

Engineer Ivan Benedict Nilo Cruz

.

University of the Philippines, Diliman

September 2012

Abstract

Genetic Algorithm for the Service Restoration of Unbalanced Distribution Systems with
Priority Customers

Distribution Automation is done to improve the reliability and service quality of distribution utilities. When contingencies occur in the distribution system, quick service restoration
must be done in order to reduce unserved energy for the faulted area. In this paper, an algorithm
is developed in order to nd the optimal conguration that restores the system after a fault using Genetic Algorithm. This problem is a Multiple-Constrained Multiple-Objective Optimization
Problem. The load ow for the Unbalanced Distribution System is performed by Ladder Iterative
technique. The proposed method is designed with consideration to the priority of the customers.
The developed algorithm is tested on the modied IEEE-13 node test feeder.

Contents
List of Figures

iii

List of Tables

iv

Introduction

1.1
1.2
1.3

1
3
3

Related Work

2.1
2.2
3

Background of the Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proposal Flow and Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Optimization for Service Restoration of Power

2.1.1 Goal functions . . . . . . . . . . . . .
2.1.2 Network Features . . . . . . . . . . . .
Proposed Study . . . . . . . . . . . . . . . . .

Distribution Systems
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .

.
.
.
.

.
.
.
.

.
.
.
.

.
.
.
.

.
.
.
.

.
.
.
.

.
.
.
.

.
.
.
.

Related Algorithms

3.1
3.2

5
5
7
7
9

Load Flow Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

9
10

Problem Statement and Objectives

12

Methodology

13

5.1
5.2
5.3
5.4

5.5
5.6
5.7
5.8

Problem Formulation . . . . . . . . . . . . .
Program Inputs . . . . . . . . . . . . . . . .
Load Flow Algorithm . . . . . . . . . . . . .
Optimization Algorithm . . . . . . . . . . .
5.4.1 Representation of strings [KDS06] .
5.4.2 Generation of initial strings [KDS06]
5.4.3 Radiality Check for the system . . .
5.4.4 Fitness function evaluation . . . . .
5.4.5 String Operation . . . . . . . . . . .
5.4.6 Partial Restoration . . . . . . . . . .
Test System . . . . . . . . . . . . . . . . . .
Priority Load Customers Table . . . . . . .
Algorithm for Service Restoration . . . . . .
Testing of the proposed algorithm . . . . . .

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

.
.
.
.
.
.
.
.
.
.
.
.
.
.

13
14
15
15
15
16
16
16
16
17
17
17
18
18

ii
6

Project Schedule and Deliverables

21

6.1
6.2

21
22

Gantt Chart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Deliverables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Bibliography

24

iii

List of Figures
1.1

Project owchart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

2.1

Two stage Genetic Algorithm for Service Restoration [12]

. . . . . . . . . . . . . .

3.1

Comparison of the average execution time of MHA . . . . . . . . . . . . . . . . . .

11

5.1
5.2

Backward-Forward Sweep algorithm [Tar10] . . . . . . . . . . . . . . . . . . . . . .

modied IEEE-13 node test feeder . . . . . . . . . . . . . . . . . . . . . . . . . . .

19
20

6.1

Project Phases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

23

iv

List of Tables
2.1

Overview of the Review of Related Work . . . . . . . . . . . . . . . . . . . . . . . .

3.1

Analysis of popular load-ow algorithms with respect to the project requirements

[Tar10] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

6.1

Gantt Chart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

22

Chapter 1

Introduction
1.1

Background of the Study

Distribution system is planned and designed in such a way that it gives the customers
satisfactory benets like shorter outage durations and good power quality. Customer satisfaction
and service quality are the primary concern in the electrical industry. When a fault occurs in
the system, the relays detect the faulted areas and disconnect from the network by opening the
breakers. The loads served by the faulted areas are remained unsupplied until the service crew
of the utility repaired the disturbance in the system. This reects a longer time of unproductive
period and inconvenience to the customers.
The need to improve the quality and reliability of the distribution system has given rise
to the advancement of research about Smart Grids [1]. Fault Detection, Isolation, and Service
Restoration (FDIR) scheme is one of the most promising Distribution Automation applications
that are essential for any Smart Grid solution. The distribution system can have its topology to be
changed by opening the sectionalizing switches and closing the tie-line switches, that isolates the
fault and restores the supply to the unsupplied loads.
The reconguration of the distribution system as a solution to service restoration is a
multi-objective multi-constraint combinatorial optimization problem in which the objective is to
seek for the optimal conguration, among other possible solutions, that leads to better performance,
considering the reconguration & restoration goals and observing the system constraints [BSG+ ].

Figure 1.1: Project owchart

3
1.2

Overview

Figure 1.1 shows the project owchart. This work presents the design and development of
a software program in Matlab that is capable of optimizing the reconguration procedures whenever
a fault occurs in the system. The project chooses the most appropriate network model and selects
the optimization algorithm that allows an ecient solution for the restoration problem.

1.3

Proposal Flow and Organization

Chapter 2 presents an overview of the optimization problem for the service restoration of
Distribution Systems. Past studies about the Service Restoration problem and their contributions
are also mentioned. The study is also introduced by showing the comparison of the proposed study
to the other works.
Chapter 3 presents the methods and algorithms to be used for the study.
Chapter 4 states the Problem and the Objectives of the proposed study. The service
restoration problem is introduced as a multiple-objective & multiple-constraint optimization problem. This is followed by determining the network constraints and the objective functions of the
problem.
Chapter 5 shows the methods on how to come up with the result. Processing the input
data, utilizing load ow and optimization algorithm are also mentioned in this section.
Chapter 6 presents the Gantt Chart and the Deliverables for the project.

Chapter 2

Related Work
Study

DG

CLPU

Proposed Study

UDS

PC

SR

PO

Kumar et al, 2008 [KD08]

Ahuja et al, 2010 [ADP07]

Inagaki et al, 2006 [IH06]

Mohanty et al, 2003 [MKD+ 03]

Touene et al, 2002

[TG+ 02]

Hongshun et al, 2005 [HX05]

aaHsu et al, 1995 [HH95]

x
x

Table 2.1: Overview of the Review of Related Work

Network Features

Restoration Goals

Reconguration Goals

Distributed Generation

DG

Cold Load Pickup

CLPU

Unbalanced Distribution Systems

UDS

Priority Customers

PC

Speed of Restoration

SR

Minimizing Power Outage

PO

Losses

Load Balancing

LB

Voltage Levels

VL

(a) Table 2.1 Legend [OMS 11]

LB

VL
x

5
Accomplishments of some of the past researchers with respect to the network features and
restoration & reconguration goals are showed by their respective marks in Table 2.1.
Distributed Generation is not considered for the proposed study because I try to model the
system in such a way that it can be applied to the electrical systems here in the Philippines. Since
today's electrical systems are not yet penetrated by DGs, consideration of Distributed Generation
is not recommended for the study.
Restoration during cold load pickup is also not included for the study. It is because
diversity among the system loads after an interruption is not considered. Transient simulations
are not within the scope of the project. Also, if you want to consider CLPU, you must develop
or identify the load models and their restart/recovery characteristics and these might complicate
things in the project.
The proposed study considers almost all the restoration & reconguration goals except
for load balancing. Load balancing is not considered for the project because unbalance in loading
is permissible in distribution systems. Also, the degree or extent of being unbalance can be known,
without directly solving for it, using losses.

2.1

Optimization for Service Restoration of Power Distribution

Systems

Service restoration problem in distribution systems is formulated as a multiple-constraint

and multiple-objective optimization problem. Researchers try to nd the optimal conguration of
the system that can meet the objective functions considering the network constraints. The project
can be dened by identifying the features and components of the electrical distribution system,
and dening the reconguration goals [3]. Next is to dene the characteristics of fault, the static
and variable elements, and the network constraints [3]. Last is to dene the solution space and to
design the searching procedure [3].
2.1.1

Goal functions

The main objective of all service restoration problems is to minimize the outage area
caused by dierent contingencies and to maximize the number of restored customers and the amount
of restored energy.
[WN04] proposes an algorithm that can minimize the expected energy not supplied or
EENS druing the restoration procedure. It provides an eective service restoration procedure

6
that can improve the system reliability. The proposed algorithm is a two-stage genetic algorithm
(rst stage GA creates radial network conguration & second stage GA searches for an optimal
sequence of switching operations) is shown in Figure 2.1. Though the two-stage GA is feasible
in determining the optimal sequence of switching operations, there might be a problem for the
computational complexity and duration. Aside from this, they did not consider the system losses
and the voltage levels in the system.

Figure 2.1: Two stage Genetic Algorithm for Service Restoration [12]

[14] proposes an algorithm that can nd the radial conguration to restore the system and
can minimize the system loss, voltage drop and the number of switching operations. The number
of switching operations is calculated using the expression given by Yogendera et al [14]. They
also develop the method and the objective function for multiple optimization problems by using
weighting factors. They also consider the penetration of Distributed Generation and compare it
with the results of without DGs. This study does not consider priority customers in the restoration
procedure. Also, partial restoration for the out-of-service area is not an option because the optimal
conguration for each case attains full restoration.
Aside from maximizing the amount of total load restored and number of switching operations, [MCYD98] can also maximize the amount of priority customers to be restored. A ranking
based search method is used to restore service to priority customers while minimizing the switching

7
operations. The algorithm is applied to large-scale distribution systems and can simulate both
single and multiple faults. Though the proposed algorithm for the fast service restoration of a
large-scale network can develop partial restoration fault cases, it does not take into account the
reconguration goals (system loss and the voltage level) for the system.
[EwI09] proposes an algorithm that can minimize the restoration time required to connect
the outage area in the distribution system. It can also maintain the security of the system by
monitoring the stability, voltage prole and line current transfer capabilities in the network. The
developed algorithm uses GA-Expert Systems joint procedure. The study contains complex factors
such as generator capability curves and ramping rates that are essential for over-all restoration
procedures using black starting.
2.1.2

Network Features

Researchers try to model their system with these added features. Some of the studies
focus on service restoration problem with the aid of Distributed Generators [VS09, XLT]. [APP+ 11]
shows the eects of capacitor action in the service restoration and how it can improves the power
quality and system loss by providing reactive power compensation. [MKD+ 03] computes for the
optimal order of restoring sections/parts in a distribution system during cold load pickup. The
system load must be restored step-by-step to prevent overheating of the devices such as transformers
[MKD+ 03].
Since real distribution networks are unbalanced systems, [KSS07] formulates a novel approach for service restoration of unbalanced distribution system.

2.2

Proposed Study

In this paper, a software program is designed and developed that is capable of optimizing
the reconguration procedures that can be adopted whenever a fault occurs in a distribution electrical network. The program can aid system operators in developing methods or procedures whenever
dierent contingencies occur. The candidate tie-line and sectionalizing switches are given from the
network to be studied. The proposed study does not nd the optimal location of these tie-lines
but the user or the operator is the one that will input its location. Given the location of these
switches, the program can develop the optimal conguration that aims to restore the de-energized
loads when a fault occurs. But restoration of the out-of-service area is not the only objective of a
service restoration maximization problem.
The study considers the priority customers in the restoration procedure because they are

8
the ones that will suer signicantly more damage or problems than other customers if not supplied
with electrical power. Aside from the priority customers, speed of restoration is also one of the main
objectives of the service restoration problem. It is essential to restore the system with minimal
time. The restoration time is directly related to the number of the switching operations, so for this
study, the number of switching operations is monitored [VS09].
Possible congurations must conform to the system constraints in order to determine
the optimal conguration for dierent scenarios. This study tries to compensate for the lack of
previous works about service restoration, by combining all of the objectives, as well as the system
constraints, and to develop an algorithm that can perform service restoration in real-time. For
cases wherein full restoration for the out-of-service areas is not possible, the program will propose
load curtailment schemes or capacitor control action in order to attain full restoration.

Chapter 3

Related Algorithms
3.1

Load Flow Algorithm

Load-Flow Algorithms are used to determine the power ows, bus voltages and the line
currents in the system. According to [Ker02], load ow algorithms that are used in transmission
systems cannot be used for radial distribution systems because of poor convergence. There are
available load ow algorithms that are used specically for distribution systems. [Tar10] reviewed
several load-ow algorithms in relation with:
1. Applicable to Distribution Systems
2. Applicable to Unbalanced three-phase system
3. Deterministic Approach
Load-Flow Algorithm

Newton-Raphson

Fast-Decoupled (transmission)

Backward-Forward Sweep

Table 3.1: Analysis of popular load-ow algorithms with respect to the project requirements [Tar10]

From the results of Table 3.1, it can be seen that the Ladder Iterative Technique or the
Backward-Forward Sweep Method is the best algorithm to be applied into Distribution Systems.

10
3.2

Optimization Algorithm

Optimization algorithms will be used to determine the optimal switch status conguration
during service restoration. [8] presents a comparative study for four modern heuristic algorithms
that are used to solve service restoration problems in the distribution system: reactive tabu search,
tabu search, parallel simulated annealing and genetic algorithm. Same methods are used to generate
initial states. The target for the comparison is how do modern heuristic algorithms change the
search states during the search procedure. Mutation by GA and the generation of neighbouring
states of the other algorithms has the same procedure. This procedure corresponds to a local search
procedure. However, crossover by GA generates global optimal solutions and it is corresponding
to a global search procedure. For the qualitative comparison of the heuristic algorithms, these are
the observations found by [TG+ 02]
(1) GA can perform both local and global search procedure whereas the other algorithms
can only perform local search procedure.
(2) GA utilizes many search points and it takes a long time to evaluate each search points.
The number of evaluation for the search points depends on the number of strings and the probability
of cross-over and mutation. However, other algorithms utilize only one search point and they need
to evaluate several neighboring states before moving on the next states. Therefore other algorithms
may have less computation time compared to GA whenever the number of neighboring states is
small.
(3) GA and PSA can revisit the already search states many times.
Figure 3.1 shows the comparison of the modern heuristic algorithms in terms of the average
execution time as a function of the number of sections in the system. Because the test system to
be used is not huge compared with other system and with the local and global search procedures
capabilities of GA, Genetic Algorithm is recommended for solving service restoration problems.

11

Figure 3.1: Comparison of the average execution time of MHA

12

Chapter 4

Problem Statement and Objectives

Problem Statement:

So far, the developed algorithms for service restoration require minimum computation
time and high quality solutions. These algorithms use modern heuristic algorithms to solve service
restoration. But these algorithms are insucient since they simulate service restoration problems
without full consideration to the restoration and reconguration goals. That is why, this work
needs to be done in order simulate service restoration problems, with real-time solutions, taking
into account more dened goals and system constraints.
Objectives:

Therefore in this project, I would like to develop a software package that is capable of
optimizing the reconguration procedures in the system whenever a fault occurs in the system by
considering the following constraints:

Load Flow acceptability (Kircho laws)

Radial network constraint
Node Voltages and Lines Currents must be within the limits
Must not overload any electrical device
Priority Customers Consideration Knowledge based approaches to assist service restoration
problems
The objectives of the service restoration problem are:

maximization of the number of restored customers and the amount of restored energy
minimization of the system loss and the number of switching operation

13

Chapter 5

Methodology
5.1

Problem Formulation

The service restoration problem is a multi-objective, multi-constrained combinatorial optimization problem. The number of unrestored customers or unsupplied energy, number of switch
operation and losses are taken as the goal functions. Minimization of unrestored customers or
unsupplied energy, number of switch operation (assuming that all are remotely controlled switches)
and the minimization of losses are kept on rst, second and third preference respectively. These
objective functions and system constraints are adopted from [KDS06]
Objective Functions:

1. Minimization of unsupplied energy or loads

M in F1(X)

F1(X) = T otal Load

Li

(5.1)

Where, Total Load is the pre-fault load for the system, X is the switch state vector of the
system; X = [SW1 ,SW2 ,...SWn ] n is the total number of switches, Li is the load on ith energized
bus after serGoal functionsvice restoration.
2. Minimization of number of switch operation (remotely-controlled):

M in F2(X)

F2(X) =

|SWj SWRj |

(5.2)

14
Where, SW is the status of j th remotely controlled switch in network before the fault,
SWR is the status ofj th remotely controlled switch in the restored system.
3. Minimize the real power losses

M in F3(X)
As service restoration optimization goals are considered:

F3(X) = |I2k |Rk

(5.3)

Where, I is the current through the k th line, R is the resistance of the k th line.
The objective function is calculated using Eq. 4.

f (X) = W 1F 1(X) + W 2F 2(X) + W 3F 3(X)

(5.4)

The weighing factors are selected such that W1+W2+W3=1 and objective preferences
are considered.
Constraints:

1) Radial network topology should be maintained throughout Goal functionsthe restoration process.
2) Bus Voltage limits should not be violated.

Vmin < Vi < Vmax

(5.5)

3) Line Current limits should not be violated.

Imin < Ik < Imax

(5.6)

4) Higher Priority Customers should always be supplied rst.

5.2

Program Inputs

The project will get data from input text les. The system data that are required are as
follows:
1. Busdata gives the real and reactive load at each bus/feeder/nodes
2. Linedata gives line's resistance, reactance and the two nodes that they connect

15
3. The location of sectionalizing, tie-line switches or switch pairs
4. Line capacity and rated values for the electrical equipment such as transformers
5. Load customers priority table
The project will also ask for the location of the fault. The faults can be classied, according to
the location, as feeder fault and line fault . The program is capable of simulating both single and
multiple faults.

5.3

Load Flow Algorithm

The project will use the three-phase backward-forward sweep load ow algorithm in determining the node voltages and line currents during service restoration. The load ow will tell whether
the network constraints are violated or not. Figure 5.1 shows the owchart for the algorithm. The
backward-forward sweep method is summarized by [Ker02] and [Tar10] made a owchart for the
method. Figure 5.1 is taken from [Tar10]. Asservicerestorationoptimizationgoalsareconsidered:

5.4

Optimization Algorithm

The project will use genetic algorithm to nd the optimal conguration or switching
patterns that maximizes the given goal function whenever a fault occurs in the system. Genetic
algorithm works in three dierent stages [KDS06]: (1) Generation of initial solutions for the problem. The initial solutions are encoded and each encoded solution is called string and a set of strings
is called population. (2) Fitness Function: The tness function of each string is calculated. (3)
Generation of new strings: There are three GA operators that can help to generate new strings.
(a) Crossover, (b) Mutation and (c) Selection.
5.4.1

Representation of strings [KDS06]

The string required for the optimization problem is the status of sectionalizing and tie-line
switches in the system.The strings are encoded using binary scheme. The close and open status of
switches is denoted by '1' and '0'. For example, a system with 4 switches, where switch number 1
and 4 are closed and the rest are open. Then, the string for this conguration is: [1 0 0 1].

16

5.4.2

Generation of initial strings [KDS06]

The length of the string is equal to the number of switches in the system. Since most
of the solution of service restoration problems is found near the pre-fault conguration, one string
made by the original conguration is included with randomly generated strings. The faulted zone
is isolated by making all switches around the faulted zone '0'.
5.4.3

Radiality Check for the system

Each string is check for radiality before evaluation. The process for checking is developed
by [KDS06]. They made a visit on zones through close switches, starting from root switch. If two
visits reaching on the same switch, a loop is made.
5.4.4

Fitness function evaluation

The tness function is dened as

F F = 1/f (X)

(5.7)

With the help of (1),(2) and (3), (4) is calculated. A penalty function, which depends on
the extent of violation of the system constraints, is subtracted from the calculated tness value.
The problem is a minimization problem therefore, higher value of tness function will give better
solution.
5.4.5

String Operation

The algorithm will generate ospring from the parents therefore we will use the three GA
operators for this task.
A. Selection

In selection, two strings from the population are chosen randomly.By comparing their
tness values, the chosen string is copied to the next generation.
B. Single-point Crossover

In Single-point Crossover, the crossover point is selected randomly and the variables are
exchanged between the strings about the crossover point.
C. Mutation

In this process, some bits of the string are transformed inversely, bit is changed from '0'
to '1' and vice-versa.

17

5.4.6

Partial Restoration

Whenever full restoration of the out-of-service area is not possible, the program will
proposed several schemes or methods that can attain full restoration. The program can develop
load curtailment scheme for the service restoration procedure by controlling selected direct control
loads in the system. The program also include capacitor control action that increases the power
transfer capacity that can decrease out-of-service area.

5.5

Test System

According to the review of related work, the project might use the test system in the work
of [KSS07]. The modied IEEE-13 node test feeder as the test system is shown in Figure 5.2. The
modied IEEE-13 node test feeder has some assumptions to be made as illustrated by [KSS07].
1) The regulator is removed from the system
2) Capacitor switches are open for the pre-fault conguration.
3) The node 7 is introduced because of the distributed load.
4) (1) and (2) can make the voltages in the system unacceptable, thus load is reduced in
order to bring the voltages to the acceptable limits (0.95 to 1.05).
5) All loads are constant current loads
6) Normally-open tie switches are introduced in the system to simulate fault restoration
scenarios.

5.6

Priority Load Customers Table

Four priority class are used to dene how important is each load [HX05]:
Level 1: customers that cause human life in danger whenever there is an interruption (e.g.
hospitals and re stations etc.)
Level 2: customers that could result in serious nancial problem and can aect greatly a
community (e.g. banks and plants etc.)
Level 3: Interruptible loads wherein it could be aected by inconvienience (e.g. schools,
supermakrests etc.)
Level 4: normal residential customers

18
5.7

Algorithm for Service Restoration

Steps (adopted from [VS09] & [KDS06]):

1. Input bus data, line data, pre-fault network conguration and the priority load customer
classes.
2. Enter the faulted zone and do isolation.
3. Find the switches around the faulted zone from the input network map.
4. Find the post-fault conguration by opening the tripped switch that isolates the fault
5. The population size, crossover rate, mutation rate for Genetic Algroithm are selected.
6. Each chromosome is represented by a number encoding method.
7. Find the total real power loss, voltage drop, and the number of switching operations for each
chromosome using Ladder Iterative technique
8. Calculate for the tness value and the penalty function for violated constraints. This penalty
function is augmented to the goal function.
9. Select the better chromosomes with larger tness values.
10. Crossover & Mutation are performed.
11. The iteration is convergent, if all chromosomes are identical. Otherwise repeat step 7.

5.8

Testing of the proposed algorithm

The results of the proposed algorithm for the optimal restoration of the modied IEEE-13
node test feeder are compared to the results of [KSS07].

19

Figure 5.1: Backward-Forward Sweep algorithm [Tar10]

20

Figure 5.2: modied IEEE-13 node test feeder

21

Chapter 6

Project Schedule and Deliverables

6.1

Gantt Chart

The project will be divided into following phases:

Phase A:

Develop load ow solver for three-phase unbalanced distribution systems

a.1: Identifying the components of the distribution network and their models.
a.2; Development of a dynamic load ow program with Graphical User Interface in Matlab
Phase B:

Integrate the load ow solver in evalutaing the system congurations

Phase C:

Develop the searching prcodeure or the optimization algorithm

c.1: Studying Genetic Algorithm (a) Initialization (b) Evolution (c) Termination
c.2: Identication of the features of the Proposed Optimization Algorithm
c.3: Development of a working code/program for Genetic Algorithm
Phase D:

Integrate C with the routines devoped in phase A & B

Phase E:

Working prototype

Phase F:

Checking and Testing for dierent scenarios. Getting the results

f.1: Simulation of single and multiple faults

f.2: Cases for Partial Restoration: Proposed Load Curtailment Scheme and Capacitor
Swicthing Scheme
f.3: Comparison of results with other studies.
Phase G:

Project Documentation

22

Table 6.1: Gantt Chart

6.2

Deliverables
A. Half-Way Deliverables

a. Evaluate network conguration integrated with load-ow solver considering the network
constraints
b. Development of the Searching procedure for the Optimization Problem
B. Final Deliverables

a. Comparison of results with those found with other studies

b. Working Software Program

23

Figure 6.1: Project Phases

24

Bibliography
[1]

Ge energy fault detection, isolation and service restoration.

[3]

An optimization package for electrical distribiuton network reconguration.

[ADP07]

A. Ahuja, S. Das, and A. Pahwa, An ais-aco hybrid approach for multi-objective distri-

bution system reconguration, IEEE Transaction on Power Systems 22 (2007).

[APP+ 11] T. Ananthapadmanabha, R. Prakash, Manoj Kumar Pujar, Anjani Gangadhara, and
M. Gangadhara, System reconguration and service restoration of primary distribution

systems augmented by capacitors using a new level-wise approach, Journal of Electrical

and Electronics Engineering Research
[BSG+ ]

3-3

(2011), 4251.

Daniel Bernardon, Mauricio Sperandio, Vincius Garcia, Luciano Ptscher, and Wagner Reck, Automatic restoration of power supply in distribution systems by computer-

aided technologies, Automation, Florian Kongoli (Ed.), ISBN: 978-953-51-0685-2, InTech,.

[EwI09]

M. El-werfelli and Pejman Iravani, Backbone-network reconguration for power system

restoration using genetic algorithm and expert system, Sustainable Power Generation
and Supply, 2009. SUPERGEN '09. International Conference, (2009).
[HH95]

Y. Hsu and H. Huang, Distribution system service restoration using the articial neu-

ral network approach and pattern recognition method, Generation, Transmission and
Distribution, IEE Proceedings (1995).
[HX05]

S. Hongchun and S. Xiangfei, A novel approach to distribution network reconguration

considering the priority of customers, 2005 IEEE/PES Transmission and Distribution

Conference and Exhibition: Asia and Pacic Dalian, China (2005).

25
[IH06]

J. Inagaki, J. Nakajima , and M. Haseyama, A multiobjective service restoration method

for power distribution systems, Circuits and Systems, 2006. ISCAS 2006. Proceedings.
2006 IEEE International Symposium (2006).
[KD08]

Y. Kumar and B. Das, Multiobjective, multiconstraint service restoration of electric

power distribution system with priority customers, IEEE Transaction on Power Delivery
23

[KDS06]

(2008).

Y. Kumar, B. Das, and J. Sharma, Genetic algorithm for supply restoration in distri-

bution system with priority customers, 9th International Conference on Probabilistic

Methods Applied to Power Systems KTH, Stockholm, Sweden (2006).
[Ker02]

W.H. Kersting, Distribution system modelling and analysis, CRC Press LLC (2002).

[KSS07]

S. Khushalani, J. Solanki, and N. Schulz, Optimized restoration of unbalanced distribu-

tion systems, IEEE Transaction on Power Systems 22 (2007).

[MCYD98] K. Miu, H-D. Chiang, B. Yuan, and G. Darling, Fast service restoration for large-scale

distribution systems with priority customers and constraints, IEEE Transactions on

Power Systems

13

(1998).

[MKD+ 03] I. Mohanty, J. Kalita, S. Das, A. Pahwa, and E. Buehler, Ant algorithms for the opti-

mal restoration of distribution feeders during cold load pickup, Intelligence Symposium,
2003. SIS '03. Proceedings of the 2003 IEEE (2003).
[OMS+ 11] Y. Oualmakran, J. Melendez, S.Herraiz, Mercedes Lopez-Perea, and Eloy Gonzalez,

Survey on knowledge based methods to assist fault restoration in power distribution networks, International Conference on Renewable Energies and Power Quality (ICREPQ
2011) Las Palmas de Gran Canaria (Spain) (2011).
[Tar10]

W.D. Tarnate, Optimum system reliability of radial distribution systems with tie lines,
University of the Philippines Diliman (2010).

[TG+ 02]

] S. Toune, H. Fudo , T. Genji, Y. Fukuyama, and Y. Nakanishi, Comparative study

of modern heuristic algorithms to service restoration in distribution systems, IEEE

Transaction on Power Delivery (2002).
[VS09]

N.Shanmuga Vadivoo and S.Mary Raja Slochanali, Distribution system restoration us-

ing genetic algorithm with distributed generation, Modern Applied Science, 3 (2009).

26
[WN04]

I. Watanabe and M. Nodu, A algorithm for optimizing switching sequence of ser-

vice restoration in distribution systems, Evolutionary Computation, 2004. CEC2004.

Congress (2004).
[XLT]

H. Xianchao, Z. Lizi, and G.A. Taylor, Service restoration in distribution network with

distributed generation, 2010 International Conference on Power System Technology.