【摘要】 以加权高斯函数模拟信息素的密度分布,并以此进行随机抽样,构成蚁群的状态转移规则。蚁群在信息素的引导下逐步向最优食物聚集。引入禁忌策略作为优进策略,以提高蚁群的寻优能力。测试表明算法适用于连续优化问题,能较快地找到函数的最优解。更多还原

【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.更多还原