2011
DOI: 10.1007/978-3-642-27242-4_30
|View full text |Cite
|
Sign up to set email alerts
|

Distribution Systems Reconfiguration Using the Hyper-Cube Ant Colony Optimization Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…The total cost C j and total time T j of j-1 lines are calculated by path calculation formula (12) and formula (13).Walking path length of ant d all is calculated by weighted function formula (15). To consider effect from both financial cost and time, weight factor δ is introduce to calculate the comprehensive overall cost of the path.…”
Section: ) Vdu Allocation Methods Statementmentioning
confidence: 99%
See 1 more Smart Citation
“…The total cost C j and total time T j of j-1 lines are calculated by path calculation formula (12) and formula (13).Walking path length of ant d all is calculated by weighted function formula (15). To consider effect from both financial cost and time, weight factor δ is introduce to calculate the comprehensive overall cost of the path.…”
Section: ) Vdu Allocation Methods Statementmentioning
confidence: 99%
“…The third phase includes task execution and task control. In the second phase, the ultimate goal of tasks scheduling is to make sure that proper tasks number of different design task types are executed by the VDUs at the right time and low cost [12].…”
Section: B Design Tasks Allocation In Single Design Stagementioning
confidence: 99%
“…There are many problems that require discrete search spaces [62][63][64]. While investigating these techniques, we found many names.…”
Section: Discretization Of Continuous Metaheuristicsmentioning
confidence: 99%
“…There are multiple problems that use this method, for example, optimization of transport aircraft wing [64], task assignment problem [62], and distribution systems reconfiguration [63]. The main metaheuristics that use the roundoff method are ant colony [63], PSO [62,64,65], firefly [66], and artificial bee colony [66,67]. The disadvantages of this method include the possibility that the solution is in a nonfeasible region.…”
Section: Rounding Off Genericmentioning
confidence: 99%
“…They are usually fast but may not achieve the optimal configuration. Therefore, metaheuristic algorithms such as hyper-cube ant colony optimization [8], bacterial foraging optimization algorithm [9], particles swarm optimization [10], artificial immune systems [11], adaptive imperialist competitive algorithm [12], and genetic algorithms [13] have been gradually applied for reconfiguration to reduce the network loss. Metaheuristic optimization methods can solve the reconfiguration problem without any or fewer restrictions on the shape of the cost function curves due to their ability to seek the global optimal solution.…”
Section: Introductionmentioning
confidence: 99%