摘要
随着城市轨道交通路网规模的不断扩大,网络复杂性越来越高,O D间乘客出行路径更加多样化。但是,由于路网中各条线路在换乘站之间的衔接性不太完善,经常会发生乘客无法经换乘抵达目的地或者等待时间过长的问题。本文在分析轨道交通网络可达性影响因素的基础上,对两种类型的可达性算法进行了研究,并基于此进行了网络可达性系统的架构设计和实现,证明了算法的可行性。可达性算法和系统的投入运营将对提高轨道交通出行效率、出行的便捷性和准确性起到非常重要的作用。
With the continuous expansion of urban rail transit network, the network structure becoms more and more complex, the passenger travel rout between station O and station D is more diverse. Because the linkage between lines is not perfect, some situations occur frequently, for instance, passengers can not arrive the destination or wait for a long time at station. In this article, on the basis of factors affecting network accessibility, two types of algorithms were studied and the framework of the network accessibility system was designed and implemented. Meanwhile, the feasibility of the algorithms was proved, the application of network accessibility was discussed, which could play very important role in improving the effciency, the convenience and accuracy of the passenger travel.
出处
《铁路计算机应用》
2017年第3期58-62,共5页
Railway Computer Application
基金
国家科技支撑计划课题(2011BAG01B01)
关键词
轨道交通网络
可达性算法
系统应用
urban rail transit network
accessibility algorithm
system application
