|
Volumn 6, Issue 4, 2002, Pages 358-365
|
A short convergence proof for a class of ant colony optimization algorithms
|
Author keywords
ACO algorithms; Ant algorithms; Ant colony optimization; Approximation algorithms; Convergence proof; Heuristics; Metaheuristics
|
Indexed keywords
ANT COLONY OPTIMIZATION ALGORITHMS;
MAXIMUM VALUES;
METAHEURISTICS;
MINIMUM VALUES;
PHEROMONE TRAIL;
SHORT CONVERGENCE PROOF;
CONVERGENCE OF NUMERICAL METHODS;
EQUIVALENCE CLASSES;
HEURISTIC METHODS;
ITERATIVE METHODS;
LEAST SQUARES APPROXIMATIONS;
MAXIMUM PRINCIPLE;
OPTIMIZATION;
PROBABILITY DISTRIBUTIONS;
PROBLEM SOLVING;
SET THEORY;
THEOREM PROVING;
EVOLUTIONARY ALGORITHMS;
|
EID: 0036670452
PISSN: 1089778X
EISSN: None
Source Type: Journal
DOI: 10.1109/TEVC.2002.802444 Document Type: Article |
Times cited : (405)
|
References (19)
|