网络搜索中的“死胡同”现象及蚁群改进算法

The Problem of Blind Alley in Net Searching and an Improved Ant Colony Optimization with Backing

针对网络搜索时常会出现蚂蚁陷入所设置的禁忌表中,无路可寻的现象,提出了所谓"死胡同"现象并加以解决,给出了基于返回思想的改进蚁群算法。当蚂蚁走进了死胡同后,沿着原路返回,并寻找其他的路径绕过死胡同,继续向目标位置搜索,以提高蚂蚁寻找路径的成功率。对改进蚁群算法的参数进行了实验分析,并与其他三种算法进行了比较,仿真结果验证了本文所提出方法的有效性。

For the ant colony algorithms we discuss a phenomenon, that a single ant falls into the taboo table set up their own ＂loop＂ in a process of searching path, and propose an improved ant colony algorithm. In the ,new algorithm, if an ant falls into one blind alley, it can back and search another path, such that the success rate of search of ants is improved. We analyze parameters of the algorithm and compare with three other algorithms by simulation experiments. The result of experiments show that the new algorithm is effective.