Abstract: Cellular ant algorithm is a new optimization method for solving real problems by using both the evolutionary rule of Cellular in Cellular space and the characteristics of ant colony optimization. This paper solves the classical TSP by cellular ant algorithm through series of typical instances. The computational results show the effectiveness of the algorithm in numerical simulation.