2016
DOI: 10.1109/tla.2016.7786353
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Allocation of Capacitor Banks using Genetic Algorithm and Sensitivity Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 21 publications
(7 citation statements)
references
References 22 publications
0
6
0
1
Order By: Relevance
“…GA is a global heuristics parameter search technique based on genetic operators to find optimal or near‐optimal solutions for each specific problem [19, 20]. Unlike the traditional optimisation approaches that require one starting point, GA uses a set of points (chromosomes) as the initial condition and each chromosome is evaluated for its performance according to the objective function which characterises the problem to be solved and defined by the designers.…”
Section: Methodsmentioning
confidence: 99%
“…GA is a global heuristics parameter search technique based on genetic operators to find optimal or near‐optimal solutions for each specific problem [19, 20]. Unlike the traditional optimisation approaches that require one starting point, GA uses a set of points (chromosomes) as the initial condition and each chromosome is evaluated for its performance according to the objective function which characterises the problem to be solved and defined by the designers.…”
Section: Methodsmentioning
confidence: 99%
“…The proposed MOPF is a non-linear, non-convex, large-scale problem involving discrete and integer variables. These characteristics make it a challenging problem to solve by conventional iterative methods [69]. Equation (1) represents the objective function that corresponds to the minimization of energy losses in a 24-h period denoted as T…”
Section: Problem Formulationmentioning
confidence: 99%
“…As mentioned earlier, the first stage of the CBGA is selection, as described by [35], and consists of arbitrarily choosing a subset of individuals of the IP that will be submitted to a tournament for providing two individuals with the best fitness function (in this case, the individuals with the solutions that minimize the cost of the power losses to the greatest extent) [38].…”
Section: Selectionmentioning
confidence: 99%