2007 IEEE Congress on Evolutionary Computation 2007
DOI: 10.1109/cec.2007.4424595
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid ant colony optimization approach for the design of reliable networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…Indeed two of the legacy ant algorithms examined in this paper, namely ACS [1], [12], [13] and MMAS [16], use 3-opt to improve ant tours. More recent efforts include using simulated annealing [23], random walks [24], tabu searches [24], H-method [25], minimum spanning trees [26], forward checking and back-tracking [27]. Repairing of infeasible solutions can also be considered a form of local search [28].…”
Section: A Local Searchmentioning
confidence: 99%
“…Indeed two of the legacy ant algorithms examined in this paper, namely ACS [1], [12], [13] and MMAS [16], use 3-opt to improve ant tours. More recent efforts include using simulated annealing [23], random walks [24], tabu searches [24], H-method [25], minimum spanning trees [26], forward checking and back-tracking [27]. Repairing of infeasible solutions can also be considered a form of local search [28].…”
Section: A Local Searchmentioning
confidence: 99%