The Continuous Differential Ant-Stigmergy Algorithm Applied to Bound Constrained Real-World Optimization Problem
P. Korošec, J. Šilc
2011 IEEE Congress on Evolutionary Computation CEC 2011
New Orleans, USA, June 5-8, 2011
In this paper, an optimization algorithm is proposed and its performance assessment for bound constrained numerical optimization is presented. The proposed algorithm is called Continuous Differential Ant-Stigmergy Algorithm (CDASA) and is based on the Differential Ant-Stigmergy Algorithm (DASA), which transforms a real-parameter optimization problem into a graph-search problem. The original DASA is extended to uses arbitrary real offsets to navigate through the search space. Experimental results are given for nine bound constrained real-world optimization problems proposed for the Special Session on Testing Evolutionary Algorithms on Real-world Numerical Optimization Problems at 2011 IEEE Congress on Evolutionary Computation.
BIBTEX copied to Clipboard