2013
DOI: 10.25103/jestr.065.012
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Algorithm Based Optimal Placement of T csc and Upfc in the Nigeria 330KV Integrated Transmission Line Network at Different Reactive Power Loadings

Abstract: The Nigeria 330KV integrated power network consisting of 52 buses, 64 transmission lines and sixteen generating stations was studied. The network was subjected to different reactive power loadings ranging from 25%, 50%, 75%, 100%, 125% and 150% respectively with and without UPFC and TCSC FACTS devices using Newton-Raphson power flow algorithm and Genetic Algorithm (GA) for optimally locating these devices on the network. The heavily loaded active power lines were identified. The heavily loaded active power lin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Genetic Algorithm (GA) is considered as one of the most important evolutionary algorithms based on mechanism of natural selection and genetics for solving the constrained and unconstrained optimization problems [24,25]. It is worth noting that GA can search simultaneously several possible solutions without require to prior knowledge or special properties of the objective function [24,26,27]…”
Section: Genetic Algorithm Process and Problem Formulation 31 Genetmentioning
confidence: 99%
See 1 more Smart Citation
“…Genetic Algorithm (GA) is considered as one of the most important evolutionary algorithms based on mechanism of natural selection and genetics for solving the constrained and unconstrained optimization problems [24,25]. It is worth noting that GA can search simultaneously several possible solutions without require to prior knowledge or special properties of the objective function [24,26,27]…”
Section: Genetic Algorithm Process and Problem Formulation 31 Genetmentioning
confidence: 99%
“…Firstly, the algorithm generates an initial population of a random size [7,24]. For more explanation, assume two individuals (chromosomes) as an initial population as shown in Figure 2(a).…”
Section: Initialize a Population Of Chromosomesmentioning
confidence: 99%