城市轨道交通路网建模中路径搜索算法的实现

Implementation of Path Search Algorithms in Urban Rail Transit Network Modeling

路径搜索算法是路网模型的基础,高效的搜索算法是实现客流实时仿真的保障,现阶段轨道交通领域路径搜索算法大多以最短路径搜索算法为基础进行改进,搜索效率有待提高。利用深度优先搜索思想,根据轨道交通路网特征简化路网的同时,提出一种限制搜索深度的搜索算法,经验证,该算法在保证搜索准确性的同时,明显提升有效路径的搜索效率,并具有良好的可移植性,能够满足实时客流仿真的要求。

The path search algorithm is the basis of the network mode.An efficient search algorithm can guarantee in-time simulation.At present,most of the path search algorithms in the field of rail transit are improved on the basis of the shortest path search algorithm,and the search efficiency needs to be improved.In this paper,a new searching algorithm is proposed based on the characteristics of the rail transit network in Tianjin.Contrasted with other methods,it improves the search efficiency of K short-path obviously,has good portability,and can meet the requirements of real-time simulation.