A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT
SYSTEM METAHEURISTIC
2003 ◽
Vol 17
(4)
◽
pp. 545-569
◽
Keyword(s):
It is shown that on fairly weak conditions, the current solutions of a metaheuristic following the ant colony optimization paradigm, the graph-based ant system, converge with a probability that can be made arbitrarily close to unity to one element of the set of optimal solutions. The result generalizes a previous result by removing the very restrictive condition that both the optimal solution and its encoding are unique (this generalization makes the proof distinctly more difficult) and by allowing a wide class of implementation variants in the first phase of the algorithm. In this way, the range of application of the convergence result is considerably extended.
2013 ◽
Vol 389
◽
pp. 849-853
2014 ◽
Vol 18
(1)
◽
pp. 11-21
◽
2010 ◽
Vol 439-440
◽
pp. 558-562
Keyword(s):
2020 ◽
Vol 11
(2)
◽
pp. 192-207
◽
2020 ◽
Vol 34
(1)
◽
pp. 104-113
Keyword(s):
2014 ◽
Vol 548-549
◽
pp. 1217-1220
2010 ◽
Vol 108-111
◽
pp. 1354-1359
2019 ◽
Vol 8
(9S)
◽
pp. 948-952