全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

铁路客运站旅客最高聚集人数计算模型

, PP. 79-83

Keywords: 铁路运输管理,铁路客运站,出行习惯,列车晚点,计算模型

Full-Text   Cite this paper   Add to My Lib

Abstract:

考虑了旅客出行习惯和列车晚点,建立了铁路客运站旅客最高聚集人数计算模型。在模型中,在出行时,乘坐600~900出发列车的旅客一般在列车出发前5~60min到达客运站,乘坐2100以后出发列车的旅客一般在1900~2100达到客运站;在晚点调整时等级越高的列车具有越高的优先权,晚点时间与运行时间成正比。计算结果表明考虑出行习惯后,计算的旅客高峰时段与实际调查结果相符,考虑列车晚点后,旅客最高聚集人数超出未晚点时的50%,因此,建议客运站的最高聚集人数设计系数为1.3~1.8,并按行车密度从小到大取值。

References

[1]  马卫武,刘小燕,李立清,等.铁路客运站旅客候车时间研究[J].铁道学报,2009,31(5):104-107. MA Wei-wu, LIU Xiao-yan, Li Li-qing, et al. Research of waiting time of passengers at railway stations[J]. Journal of the China Railway Society, 2009, 31(5): 104-107.(in Chinese)
[2]  何宇强,毛保华,陈绍宽,等.铁路客运站最高聚集人数计算方法研究[J].铁道学报,2006,28(1):6-11. HE Yu-qiang, MAO Bao-hua, CHEN Shao-kuan, et al. Research on the methods of calculating the maximum assembling at railway passenger stations[J]. Journal of the China Railway Society, 2006, 28(1): 6-11.(in Chinese)
[3]  张天伟.铁路客运站旅客聚集规律研究[J].铁道学报,2009,31(1):31-34. ZHANG Tian-wei. Research on the assembling rule of passengers at railway passenger stations[J]. Journal of the China Railway Society, 2009, 31(1): 31-34.(in Chinese)
[4]  汤 波,雷定猷,张英贵,等.铁路车站咽喉通过能力计算方法[J].交通运输工程学报,2010,10(6):69-74. TANG Bo, LEI Ding-you, ZHANG Ying-gui, et al. Calculating method of carrying capacity for railway station bottleneck[J]. Journal of Traffic and Transportation Engineering, 2010, 10(6): 69-74.(in Chinese)
[5]  NIE Lei, HU Bi-song, FU Hui-ling, et al. Interaction analysis between night train operation and maintenance time on passenger dedicated railway line[J]. Journal of Transportation System Engineering and Information Technology, 2010, 10(5): 66-72.
[6]  LIEBCHEN C, SCHACHTEBECK M, SCHOBEL A, et al. Computing delay resistant railway timetables[J]. Computers and Operations Research, 2010, 37(5): 857-868.
[7]  DELORME X, GANDIBLEUX X, RODRIGUEZ J. Stability evaluation of a railway timetable at a station level[J]. European Journal of Operation Research, 2009, 195(3): 780-790.
[8]  VANSTEENWEGEN P, VAN OUDHEUSDEN D. Devel-oping railway timetable which guarantee a better service [J]. European Journal of Operation Research, 2006, 173(1): 337-350.
[9]  GOVERDE R M P. A delay propagation algorithm for large-scale railway traffic networks[J]. Transportation Research Part C: Emerging Technologies, 2010, 18(3): 269-287.
[10]  BURDETT R L, KOZAN E. A disjunctive graph model and framework for constructing new train schedules[J]. European Journal of Operation Research, 2010, 200(1): 85-98.
[11]  BURDETT R L, KOZAN E. Techniques for inserting add-itional trains into existing timetable[J]. Transportation Research Part B: Methodological, 2009, 43(8/9): 821-836.
[12]  CASTILLO E, GALLEGO I, URENA G J, et al. Time-tabling optimization of a mixed double-and single-tracked railway network[J]. Applied Mathematical Modelling, 2011, 35(2): 859-878.
[13]  CORMAN F, D’ARIANO A, PACCIARELLI D, et al. A tabu search algorithm for rerouting trains during rail oper-ations[J]. Transportation Research Part B: Methodological, 2010, 44(1): 175-192.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133