2008
DOI: 10.1080/15325000701735389
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Particle Swarm Optimization to Network Reconfiguration for Loss Reduction and Load Balancing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
25
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 59 publications
(34 citation statements)
references
References 6 publications
2
25
0
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%
“…jb is not changed, otherwise it is changed. The change depends on the integer or binary representations: 2 In addition, a last-resource large number of iterations N (a) For the integer encoding strategies, rounding the velocity results to integer values is considered in [31] and the enhanced integer coded PSO method [32] has been used to minimize the total branch losses by maintaining the radial network structure and without violating the constraints. In these cases, the change can be implemented by searching for a feasible configuration represented by the integer coding used, for example adjacent to the configuration that has to be changed.…”
Section: Discrete and Binary Pso Codingmentioning
confidence: 99%
“…In [2], an exhaustive survey of the modern heuristic methods for the DNR is presented. Artificial intelligence techniques were also applied to DNR problem extensively, for example, simulated annealing (SA) [3], artificial neural networks (ANN) [4], genetic algorithms (GA) [5], ant colony search algorithm (ACSA) [6], fuzzy logic [7] and particle swarm optimization [8].…”
Section: Introductionmentioning
confidence: 99%