FGCS
2000
13 years 11 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
COR
2008
13 years 11 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
ANTSW
2006
Springer
14 years 3 months ago
2006
Springer
It is often believed that the performance of ant system, and in general of ant colony optimization algorithms, depends somehow on the scale of the problem instance at hand. The iss...
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
CEC
2007
IEEE
14 years 5 months ago
2007
IEEE
—The paper extends the classical Ant Systems by considering non-uniform deposition by the ants, while constructing pheromone trails. A deterministic solution to the ant system dy...