一种基于格的蚁群算法

Grid based ant colony algorithm

针对蚁群算法容易陷入局部搜索的问题,提出了一种基于格的蚁群算法。将问题空间划分为n块格子,基于随机策略,将m只蚂蚁分别放在n块格子中,对于每个格子,再次基于随机策略,将格子内的蚂蚁放置在不同的节点上。仿真结果显示,在不影响最优解的情况下,基于格的策略加速了算法的收敛性。

To the problem of easily immersing into local search for ant colony algorithm,a grid based strategy is introduced.The space has been divided into n small portions,and then based on random strategy,m ants are put into n squares separately.For each of the square,the ants in a square are placed on different nodes based on random strategy again.Simulation results show that the grid based strategy accelerates the convergence of ant colony algorithm without sacrificing the best answer.