A Graph-based Ant System and its convergence

By Walter J. Gutjahr. Future generations computer systems, 2000

400 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering, Management of Technology and Innovation

View Paper: https://www.semanticscholar.org/paper/242e7af00d6c56c4299a73a5ed4c6d97725243f7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

In Management of Technology and Innovation

Citations in the corpus

Swarm Intelligence in Optimization (2008, background): “They deal with the question of algorithm convergence [75, 76, 163].”
A Tutorial on the Cross-Entropy Method (2005, neutral): “Recent related work on randomized combinatorial optimization includes the nested partitioning method (Shi and Olafsson, 2000) and the ant colony optimization meta-heuristic (Colorni et al., 1996; Dorigo, Di Caro, and Gambardella, 1999; Gutjahr, 2000).”
A short convergence proof for a class of ant colony optimization algorithms (2002, background): “Gutjahr’s proof is stronger than ours (it implies our result, but the reverse is not true), but our proof holds for any ACO algorithm as far as a lower bound and an upper bound to the pheromone trails exist.”
Ant Colony Optimization (2001, neutral): “Hint: You may have a look at the paper by Gutjahr (2002). 152 Chapter 4 Ant Colony Optimization Theory”
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances (2003, background): “Gutjahr [52] has recently proved convergence to the optimal solution for a particular ACO algorithm he calls Graph-based Ant System (GBAS ).”
Ant colony optimization theory: A survey (2005, background): “In [37] he presented the ﬁrst piece of research on the convergence properties of ACO algorithms, which deals with the convergence in solution for the so-called graph-based ant system (GBAS).”
Ant colony optimization (2006, neutral): “Gutjahr proved convergence with probability 1 − (cid:5) to the optimal solution [36], and more in general to any optimal solution [37].”
Ant Colony Optimization: Overview and Recent Advances (2018, background): “The ﬁrst convergence proofs were presented by Gutjahr in [83].”
A survey on metaheuristics for stochastic combinatorial optimization (2009, methodology): “Finally, two papers Gutjahr (2004) and Pichitlamken and Nelson (2003) focus on different metaheuristics, but involve SA in experimental comparison. The paper by Gutjahr (2004) that we also cited in Sect. 2.1 focuses on S-ACO, and reports experimental comparisons between S-ACO and the S-SA algorithm ”
Ant colony optimization: Introduction and recent trends (2005, background): “The first convergence proofs concerning an algorithm called graph-based ant system (GBAS) were presented by Gutjahr in [53,54].”
Ant algorithms and stigmergy (2000, background): “of recent and intriguing results: Gutjahr has recently proved (see this special issue [40]) convergence to the optimal solution for a particular version of AS, while Wagner et al.”