改进最小换乘模型的公交查询系统

Public Traffic Query System Based on Improved Minimum Passenger Transfer Model

建立一个基于最小换乘原则的改进型公交查询系统模型。采用0-1矩阵处理数据并将此模型分为三类子模型:直达无需换乘模型、一次换乘模型、二次换乘模型。直达模型可以直接搜索即可实现,对一次换乘模型分析了公交系统的数据特征,采取数据库中出现高频的站点优先查询,利用后向搜索算法减小了二次换乘模型搜索空间,并将二次换乘问题转化为直达和一次换乘问题。结果表明此算法可迅速得到理想的结果并很容易拓展到解决多次换乘问题。

This paper builds an improved public traffic query system model based on the principle of minimum passenger transfer. It adopts 0 - 1 matrixes to process the data and classifies the model into three kinds of sub-model： nonstop transfer model, once transfer model, and twice transfer model. The nonstop model can be realized by direct search. The paper analyzes the characteristics of the system data in the once transfer model, and the station which frequently appears in the database has the priority, then reduces the search space by back search algorithm. At last, the twice transfer problem can be transformed to nonstop transfer problem. The result indicates this algorithm can get ideal results rapidly and easily extend to resolve multiple transfer problems.