多线程蚁群算法及其在最短路问题上的应用研究

Multi-thread Ant Colony Algorithm and its Application in the Shortest Path

针对基本蚁群算法,提出一种多线程蚁群算法。该算法引入多线程技术,将线程作为蚂蚁,而且借鉴于自然界中生物个体的差异性,从选择策略方面加强了蚂蚁个体对未知路径的搜索能力;同时对局部搜索和全局更新策略进行了改进。实验结果表明,该算法可以有效地克服基本蚁群算法的收敛速度慢和易出现停滞现象的缺陷,能够较快的收敛到全局最优解。

Based on the Basic Ant System algorithm, a Multi-thread Ant system is presented. The algorithm introduces the multi-thread technology and takes every thread as one ant. According to the difference of individuals of biology in the nature, the ability that ant searches the unknown path is strengthened in the selection strategy.