仿真实现基于自适应蚁群算法的公交查询算法

Simulating Bus Travel Transit Path Query Algorithm Based on Adaptive Ant Colony Algorithm

公交查询系统的设计可以解决在庞大的公交网络中公交路线选择的问题。该文将进一步改进基于自适应蚁群算法的公交查询算法,即提出了初始化的问题和解决了可以步行的问题。使得该文的算法具有更快的速度,更好的寻找最优解的能力以及更广泛的适应范围。文末给出了运行的实例表明该文设计的方法是行之有效的。

Bus travel transit path query system can deal with the problem of searching the best routine among the huge and complex bus net.This paper will further improve the bus travel transit path query algorithm which based on adaptive ant colony algorithm, namely that the initialization of the problems and solutions to the problems you can walk This makes the paper＇s algorithm has a faster speed, better ability to find the optimal solution, as well as to adapt to a wider range .We also design a delayed updating pheromones method reducing the computational complexity sharply.Results based on experiments show our method is effective.