基于自适应蚁群算法的公交查询算法设计

Bus Travel Transit Path Query Algorithm Designing 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 applies Ant Algorithm on designing the kernel of Bus travel transit path query system, which is how to search out the best routine from start stop to end stop. We transform city bus net to directed graph based on nonstop relation and use the walk of ant among nodes to denote the selection of routine. To solve the contradictory between convergence and precocity in the basic ant colony algorithm, an adaptive updating pheromones ant colony algorithm is presented. We also design a delayed updating pheromones method reducing the computational complexity sharply.