Keywords
Computer scienceGraphMathematical optimizationConvergence (economics)Ant colony optimization algorithmsExtremal optimizationTheoretical computer scienceOptimization problemCombinatorial optimizationAnt colonyAlgorithmMathematicsMeta-optimization
Affiliated Institutions
Related Publications
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple cons...
Ant Algorithms for Discrete Optimization
This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' for...
A new version of ant system for subset problems
Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., traveling salesman problem). We introduce a new version of A...
Ant Colony Optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and of other animals. In particular, ants have ins...
Ant system: optimization by a colony of cooperating agents
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach...
Publication Info
- Year
- 2000
- Type
- article
- Volume
- 16
- Issue
- 8
- Pages
- 873-888
- Citations
- 367
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
367
OpenAlex
Cite This
Walter J. Gutjahr
(2000).
A Graph-based Ant System and its convergence.
Future Generation Computer Systems
, 16
(8)
, 873-888.
https://doi.org/10.1016/s0167-739x(00)00044-3
Identifiers
- DOI
- 10.1016/s0167-739x(00)00044-3