Table of Contents

Certificate i

Acknowledgement ii

Abstract iii

List of figures iv
Figure 3.1: SLD for IEEE 14 bus system

Figure 3.2: SLD for IEEE 30 bus system

Figure 3.3: SLD for IEEE 57 bus system

Figure 4.1: Flowchart of Genetic Algorithm

Figure 4.2: Optimal no. of PMUs for IEEE 9 bus system using GA

Figure 4.3: Optimal no. of PMUs for IEEE 14 bus system using GA

Figure 4.4: Optimal no. of PMUs for IEEE 30 bus system using GA

Figure 4.5: Optimal no. of PMUs for IEEE 57 bus system using GA

Figure 6.1: Flowchart of BGSA

Figure 6.2: Optimal no. of PMUs for IEEE 9 bus system using BGSA

Figure 6.3: Optimal no. of PMUs for IEEE 14 bus system using BGSA

Figure 6.4: Optimal no. of PMUs for IEEE 30 bus system using BGSA

Figure 6.5: Optimal no. of PMUs for IEEE 57 bus system using BGSA

List of Tables iv

Table 3.1: OPP formulation output using BILP

Table 4.1: OPP formulation output using GA

Table 4.2: OPP formulation output using GA (without using ga solver)

Table 5.1: OPP formulation output using PSO

Table 6.1: OPP formulation output using BGSA

Nomenclature and Abbreviations v

CHAPTER 1: Introduction 1
CHAPTER 2: Literature Survey
2.1: Introduction 2
2.2: Rules for PMU placement 2
2.3: OPP Techniques 2
2.4: BILP and GA 3
2.5: BGSA and PSO 3
CHAPTER 3: Binary Integer Linear Programming (BGSA)
3.1: Introduction 4
3.2: OPP Formulation 4
3.3: Development of placement problem 6
3.4: Output using BILP 6
3.5: Final optimal placement of PMUs for IEEE bus systems
(Without PMU outage) 7
3.6: OPP using BILP (with one PMU outage) 10
CHAPTER 4: Genetic Algorithm (GA)
4.1: Introduction 11
4.2: Pseudo-code for Genetic Algorithm 11
4.3: Development of placement model 12
4.4: OPP formulation 13
4.5: Output using Genetic Algorithm 14
4.6: System Observability Redundancy Index (SORI) 17
CHAPTER 5: Particle Swarm Optimization (PSO)
5.1: Introduction 18
5.2: Starting point of placement of PMUs 19
5.3: Pseudo code of PSO Algorithm 21
 5.4: Advantages and Disadvantages 21
5.5: Solving PSO using Particleswarm Solver
21
5.6: Simulation Results 22
CHAPTER 6: Binary Gravitational Search Algorithm (BGSA)
6.1: Introduction 23
6.2: Pseudo code of BGSA
26 6.3: Development of BGSA placement model
26
6.4: OPP formulation 28
6.5: System Observability Redundancy Index (SORI) 28
6.6: Output Using BGSA 29
6.7: Graphical Representation of the Output
CHAPTER 7: Conclusion
7.1: Overview of the Algorithms 31
7.2: Comparison 33
References 37
Appendix 46
 NOMENCLATURE

A Binary Connectivity Matrix

X Binary decision variable vector
F(x) Observability constraint vector function
b Unit vector

ABBREVIATIONS

PMU Phasor Measurement Unit

ILP Integer Linear Programming
BILP Binary Integer Linear Programming
MILP Mixed Integer Linear Programming
GA Genetic Algorithm

PSO Particle Swarm Optimization

BGSA Binary Gravitational Search Algorithm

SORI System Observability Redundancy Index