铁路客运服务网络路径搜索算法的研究与实现  

Research and Realization of Route Search Algorithm of Railway Passenger Traffic Service Network

作　　者：柳健[1] 聂磊[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《铁道运输与经济》2012年第12期58-63,共6页Railway Transport and Economy

基　　金：国家自然科学基金(60870012);铁道部科技研究开发计划项目(2008X027-A);科技部;铁道部联合支撑计划项目(2009BAG12A10);轨道交通控制与安全国家重点实验室(北京交通大学)自主研究课题资助(RCS2009ZT008)

摘　　要：基于反映旅客出行链的有向换乘服务网,采用一种拼接和去冗相结合的K最短路算法,设计并实现客运服务网络路径搜索系统。该系统可根据客流计划和列车开行方案,以多种路径搜索模式得到合理的乘车方案。以某高速铁路及相关路网的列车开行方案和相应的客流计划为例,对客运服务网络路径搜索算法进行测试,取得了预期的结果,但需在乘车效用的丰富和优化方面进行深入研究。Based on directed transfer service network which reflecting passenger travelling chain, a K shortest route algorithm combined with joining and redundancy eliminating is applied, and a route search system of passenger traffic service network is designed and realized. By using the system and according to passenger flow plan and train operation diagram, the reasonable transfer scheme with the mode of multi-route search could be achieved. By taking a certain high-speed railway and train operation diagram of relative railway network as well as corresponding passenger flow plan as examples, the route search algorithm is tested and achieved prospective result, but the enrichment and optimization of riding avail are need to be studied.

关 键 词：铁路客运 路径搜索 服务网络 K最短路 

分 类 号：O157.51[理学—数学] U293.3[理学—基础数学]