2012
DOI: 10.1049/iet-gtd.2011.0281
|View full text |Cite
|
Sign up to set email alerts
|

Reconfiguration of distribution systems for loss reduction using the hyper-cube ant colony optimisation algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 57 publications
(20 citation statements)
references
References 37 publications
0
20
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%
“…Abdelaziz et al introduced the Hyper-Cube (HC) framework to the ACO algorithm for solving the reconfiguration problem of distribution systems [91]. The HC-ACO uses the transition states for updating the amount of pheromones at each iteration, maintaining the maximum value of pheromone as unity while that branch is part of the solution at every iteration.…”
Section: Ant Colony Optimization (Aco)mentioning
confidence: 99%
“…The same type customers have the same load curve, and the maximum load of each load point in one year is refereed in [15]. In dynamic case, the load data at any time can be generated by the terms of (8)- (9) according to the load type of k and the time t .…”
Section: B Time-varying Load Demand Casementioning
confidence: 99%
“…To find an appropriate solution for the static case, meta-heuristic methods are frequently used and they have been clearly demonstrated to be both feasible and advantageous [1][2][3][4][5][6][7][8][9][10][11] . This review is focused on some contributions related to GAs, as GA or enhanced GA can efficiently identify the optimal or near optimal network configurations.…”
Section: Introductionmentioning
confidence: 99%