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.

摘要： 元胞蚂蚁算法是利用元胞在离散元胞空间的演化规律和蚂蚁寻优的特点，为解决实际问题提供的一种优化方法。本文将元胞蚂蚁算法应用于TSP问题的研究，并用一系列数值实验说明有效性。