关键词: 蚁群算法, 正态分布, 连续空间优化, 禁忌策略

Abstract: The distribution of pheromone on the continuous space is simulated with Gaussian kernel.A random generator is used with this distribution as the state transition rule to choose the next point to move to，and pheromone is updated by adjusting parameters of the distribution according to the transitions of ant colony.Ants aggregate gradually around the optimal food source under the direction of pheromone.In order to get over the disadvantages of the slow convergence speed and stagnation behavior，a tabu search algorithm is inducted.And the results of the examples show that it can not easily run into the local optimum and can converge at the global optimum.

Key words: ant algorithm, normal distribution, continuous space optimization, tabu search