Review of Ant Colony Algorithm for Solving Traveling Salesman Problem
ZONG Decai
WANG Kangkang
DING Yong
Abstract：Ant colony optimization(ACO) is a meta‐heuristic random search technique to solve combination optimization problems effectively .Traveling Salesman Problem(TSP) is a typical combination optimization problem ,which is easy to be described and hard to be solved .After describing the basic principle of three classical ant colony algorithm for solving the traveling salesman problem ,current development situations of ant colony algorithm are emphatically analyzed .Five main de‐velopment directions of ant colony algorithm are summarized ,including ,local optimization algorithm based ant colony algo‐rithm ,the improvement of the pheromone update method ,the combination of ant colony algorithm and other algorithm ,opti‐mize parameter of ant colony algorithm and parallel ant colony algorithm .And these five development directions have the trend of integration .
Keywords：traveling salesman problemant colony algorithmpheromonecombinatorial optimizationintegration
Publication Date：2014-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：10( 2004-2013 )