摘要
引入最小乘车次数矩阵Q,直达信息矩阵,直达信息转置矩阵,充分利用矩阵Q进行宏观的判断,用后两个矩阵进行精细的查找,并设计寻找和组装最优方案的算法,进而在最小换乘算法的基础上设计了高效公交查询算法。该算法不仅缩短了查询时间,且使查询结果更加人性化,可给出最少换乘次数为3的出行线路查询结果。
This paper introduces least transfer matrix,direct information matrix and direct information transposition matrix.By making full use of matrix Q for macro-judgment,using the latter two matrices for specific search,and designing the method for searching and assembling the optimal routes,an efficient bus query algorithm is designed according to least transfer algorithm.This algorithm can give out the querying results from which least transfer time can be three,and the experiments show that this algorithm is more efficient and humanized.
出处
《太原科技大学学报》
2011年第1期50-54,共5页
Journal of Taiyuan University of Science and Technology
