基于蚂蚁算法的公交网络最短路径问题研究

Problem of Shortest Path in Bus Net Based on Ant Algorithm

通过改进的蚂蚁算法来解决公交网络信息系统中的最短路径问题。提出以换乘次数最少、出行距离最短为目标的路径求解算法,并给出了算法流程。分析了基于蚂蚁算法的城市公交网络的选择策略:选择某条路径即给该路径赋以一定的信息素,信息素愈大的路径,成为最短路径的可能性愈大。并利用改进的蚂蚁算法实现了公交网络乘客信息查询。

Improved ant algorithm was introduced to resolve the shortest path problem in bus network information system. The target of minimal times of bus transference and shortest distance was put forward. According to the target, the advantages and disadvantages of Dijkstra algorithm were analyzed. Dijkstra algorithm was further improved based on ant algorithm. The improved ant algorithm was used to implement bus network passenger＇s information search.