2010
DOI: 10.1080/07408170903039836
|View full text |Cite
|
Sign up to set email alerts
|

Design of reliable communication networks: A hybrid ant colony optimization algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 32 publications
0
16
0
Order By: Relevance
“…ACO algorithms have been applied for the reliability optimization of series-parallel systems [44], also including quantity discounts on the redundant components [45], and network optimization by embedding a Cellular Automata approach combined with Monte Carlo simulation for network availability assessment [46], within a multi-objective ACO search engine [47]. ACO has also been applied in hybrid form with Simulated Annealing (SA), called ACO SA, for the design of communication networks [48], where the design problem is to find the optimal network topology for which the total cost is a minimum and the all-terminal reliability is not less than a given level of reliability.…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…ACO algorithms have been applied for the reliability optimization of series-parallel systems [44], also including quantity discounts on the redundant components [45], and network optimization by embedding a Cellular Automata approach combined with Monte Carlo simulation for network availability assessment [46], within a multi-objective ACO search engine [47]. ACO has also been applied in hybrid form with Simulated Annealing (SA), called ACO SA, for the design of communication networks [48], where the design problem is to find the optimal network topology for which the total cost is a minimum and the all-terminal reliability is not less than a given level of reliability.…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…ACO is effective for solving Non-deterministic Polynomial (NP) hard discrete optimization problems, and has been successfully applied to a number of scientific and engineering problems, including grid-based deployment for wireless sensor networks [ 22 , 23 , 24 ]. ACO is also applied to the topology optimization [ 25 , 26 ] and routing algorithm [ 27 , 28 ] for wireless networks. An ACO algorithm coupled with a local search heuristic is proposed in [ 29 ] to deploy a WSN under a certain reliability constraint at the minimum deployment cost.…”
Section: Related Workmentioning
confidence: 99%
“…BDD structure is a compact, implicit representation of the entire set of the functioning and failing network states. Dengiz, et al [23] proposed a hybrid approach based on Ant Colony Optimization and Simulated Annealing, called ACO-SA, for the NTD-CR problem for networks with up to 50 nodes. Note that the results in [7] for the related Dynamic programming approach show that the DP techniques produced better results as compared to the BDD approach in [22] and ACO-SA approach in [23].…”
Section: Related Workmentioning
confidence: 99%
“…As a summary, the existing algorithms that generate approximation solutions are mainly based on meta-heuristic techniques, such as Genetic Algorithm [10,11,14,22], Neural Network [5,21], Swarm Particle [24] [21], Simulated Annealing (SA) [17,18] and Ant Colony Optimization (ACO) [23]. While the meta heuristic-based algorithms may significantly reduce time complexity, they still require numerous iterations to converge and thus use a considerable computational effort to produce near optimal solutions [23]. Therefore, a more time efficient heuristic approach that can produce better results is still needed, especially for use in large scale networks.…”
Section: Related Workmentioning
confidence: 99%