The differential ant-stigmergy algorithm for large-scale global optimization
P. Korošec, K. Tashkova, J. Šilc
IEEE World Congress on Computational Intelligence WCCI 2010
Barcelona, Spain, 18-23 August, 2010
Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performance evaluation of an ACO-based algorithm for solving large-scale global optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The DASA transforms a real-parameter optimization problem into a graph-search problem. The parameters' differences assigned to the graph vertices are used to navigate through the search space. The performance of the DASA is evaluated on the set of benchmark problems provided for CEC'2010 Special Session and Competition on Large-Scale Global Optimization.
BIBTEX copied to Clipboard