2008
DOI: 10.1109/tpwrs.2007.913303
|View full text |Cite
|
Sign up to set email alerts
|

Radial Network Reconfiguration Using Genetic Algorithm Based on the Matroid Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
61
0
1

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 199 publications
(70 citation statements)
references
References 23 publications
0
61
0
1
Order By: Relevance
“…These methods find admirable solutions for the medium size systems and are not suitable for large systems [6]. In recent years, new heuristic optimization algorithms like Genetic Algorithm (GA) [7 ÷ 11], Nondominated Sorting Genetic Algorithms (NSGA) [12], matroid theory [13], other meta-heuristics techniques like plant growth [14], Particle Swarm Optimization (PSO) [15], tabu search [16] and ant colony search [17,18] have been proposed for DSR problem. They are aimed to deal with large system with fast execution time [19].…”
Section: Introductionmentioning
confidence: 99%
“…These methods find admirable solutions for the medium size systems and are not suitable for large systems [6]. In recent years, new heuristic optimization algorithms like Genetic Algorithm (GA) [7 ÷ 11], Nondominated Sorting Genetic Algorithms (NSGA) [12], matroid theory [13], other meta-heuristics techniques like plant growth [14], Particle Swarm Optimization (PSO) [15], tabu search [16] and ant colony search [17,18] have been proposed for DSR problem. They are aimed to deal with large system with fast execution time [19].…”
Section: Introductionmentioning
confidence: 99%
“…References [6][7][8] proposed three different methods derived from a genetic algorithm (GA) respectively. Prasad et al [6] improved random evolution rules, making it possible to deal with discrete variables, and avoided islands and loops by improving encoding.…”
Section: Introductionmentioning
confidence: 99%
“…Mendoza et al [7] proposed accentuated crossover and directed mutation, reducing searching space and memory occupation. Enacheanu et al [8] combined GA with graph theories to select an efficient mutation, making all the resulting individuals feasible.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, the reconfiguration process is widely used to attain one or combination of those objectives [1][2][3][4][5][6][7][8][9][10][11][12]. This can be usually done by altering the open/closed status of switches of the distribution system.…”
Section: Introductionmentioning
confidence: 99%
“…With regard to the complexity of the optimization problem, artificial intelligence techniques are now widely used for the solution of reconfiguration problem such as artificial neural networks [1], genetic algorithm (GA) [2,3] and refined GA (RGA) [4], simulated Abbreviations: V i , ith node voltage; Ij, jth branch current; NR, number of branches; N b , number of buses; P loss , active power loss; P in , active input power to the network; P loss , total active load powers; S i , apparent power in the ith branch; S max i , maximum capacity (KVA) in the ith branch; LBI, load balancing index; Var(x), variance of arrays of X matrix; r i , ith branch resistance; Z(i,j), impedance between ith and jth nodes; P(i), probability of selecting ith position. annealing (SA) [5], plant growth simulation (PGA) [6], fuzzy logic [7] and ant colony optimization (ACO) [8][9][10].…”
Section: Introductionmentioning
confidence: 99%