城市轨道交通乘客出行路径选择,其实就是换乘站的选择,换乘站及其次序唯一确定了乘客在路网中行进的路径。基于轨道交通旅客出行所能承受的换乘次数是有上限的这一事实,设计出基于换乘次数的有效径路集生成算法。算法在充分考虑轨道交通路网结构及旅客实际出行特点的基础上,对路网进行分层、次序化处理,旨在降低算法的空间复杂度和时间复杂度。实例分析表明,该算法可以快速高效的生成有效径路集,并且生成的有效径路集包含虚拟换乘路径,为后续研究提供较好的路径结构基础。
A choice of urban rail transit route is actually a choice of transfer station, and passengers' path in a network solely depends on transfer station and its order. Based on the fact that the transfer times passengers can bear in a trip have upper limit, an effective path set generating algorithm based on the transfer times was proposed, which fully considered the structure of a urban rail transit network and passengers' travelling characteristics, aiming at reducing its space and time complexity. An example analysis shows that the algorithm can quickly and efficiently generate an effective pathway set, in which the virtual transfer paths were included. Therefore, the algorithm the author proposed provides a good path structure for the following study.