Adaptive Ant Colony Algorithm Based on Expandability and Magic Cube Transformation
MA Xiao-ping
JIN Zhu
Abstract：There are the shortcomings such as longer computing time and precocity and stagna-tion in classical ant colony algorithm. Based on the expandability, an adaptive ant colony algo-rithm is presented. The algorithm dynamically adjusts state transition rule by integrating ex-pandability with heuristics and pheromone. Meanwhile, an uneven strategy based on the global pheromone updating is adopted to enhance the ant's excellent ability in searching the whole best solution. In addition, a novel magic cube mutation strategy, inspired by the magic cube transformation, is employed to accelerate evolution speed after each iteration. The experimen-tal results on TSP demonstrate that the proposed algorithm has much higher convergence speed and Stability than that of classical ant colony algorithm.
Keywords：ant colony algorithmmagic cube transformationmutationtraveling salesman problem
Publication Date：2009-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 503-508 )