Application of the Ant Algorithm in TSP
JIA Yanhua
Abstract：The traveling salesman problem(TSP) is one of the typical NP‐Complete hard problems in combinatorial op‐timization ,which is easy to be described but hard to be solved .The number of possible paths increase exponentially with the number of cities ,the solution is very hard .Ant algorithm is a newly emerged stochastic seaching optimization algorithm in recent years .It has been paid much attention to .This paper solves the TSP with this new biological optimization strategy and gives the proceses of ant algorithm .And the satisfied effect is obtained .
Keywords：ant algorithmcombinatorialTSP
Publication Date：2016-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：4( 1664-1667 )