Abstract: In order to get over the disadvantages of the slow convergence speed and stagnation behavior，a tabu search algorithm is inducted.Then an improved ant colony optimization with tabu search is put forward.It is tested by a set of benchmark continuous funcions optimization problems.And the results of the examples show that it can not easily run into the local optimum and can converge at the global optimum.

摘要： 针对蚁群算法容易陷入局部最优解及搜索时间长等不足，引入一种基于连续空间的禁忌搜索算法，并将其与蚁群算法相结合，提出了一种引入禁忌搜索策略的蚁群算法，以求解连续对象优化问题。经测试验证了该算法不仅跳出局部最优解的能力更强，而且能较快地收敛到全局最优解，表明算法的有效性。