-
摘要: 为了高效计算铁路车站咽喉的通过能力, 提出以进路为对象、以咽喉运用饱和状态下进路占用时间推算为核心的5步计算法。推导了基于概率论多除少补原理的一元多次多项式方程以标定关键参数, 并设计了以平行进路关联图为基础的完全子图搜索算法以确定方程系数, 以东莞站广州方向咽喉为例进行了计算。计算结果表明: 咽喉通过能力为503列, 占用43#、45#、53#道岔的列车数为102列, 计算时的通过能力利用率达到75%。可见, 该计算方法具有较强的可操作性。Abstract: In order to calculate the carrying capacity of railway station bottleneck efficiently, a new kind of calculating method with 5 steps was put forward. The method took station bottlenecks' routes as object and the projection of routes' holding time under saturation condition as core. A polynomial equation of higher degree with an unknown variable was deduced by applying probability theory, and the equation could calibrate the key parameters in the calculating method. Algorithms for searching complete sub-graphs based on parallel-route relation graph were devised in order to determine the equation coefficients. Guangzhou orientation bottleneck in Dongguan Station was as a calculation example. Calculation result shows that the carrying capacity of the station bottleneck is 503 trains, 43#, 45# and 53# turnouts are taken up by 102 trains, and the carrying capacity utilization ratio is 75%. So the calculating method has good maneuverability.
-
表 1 各进路占用时间
Table 1. Holding times of routes
进路编号 进路名称 作业内容 总占用时间/min 1 Ⅰ至1道 接下行通过动车组及少数其他旅客列车 476 2 Ⅰ至5道 接下行停站动车组及少数其他旅客列车 195 3 Ⅱ至2道 发上行通过动车组及少数其他旅客列车 469 4 Ⅱ至6道 发上行停站动车组及少数其他旅客列车 220 5 Ⅲ至3道 接下行通过客货列车 126 6 Ⅲ至10、11道 接下行停站客货列车 74 7 Ⅲ至13、15、17、19、21道 接下行有改编作业的货物列车 120 8 Ⅳ至4道 上行通过客货列车 98 9 Ⅳ至5、7、10、11道 发上行停站旅客列车 104 10 Ⅳ至13、15、17、19、21道 发上行已改编货物列车 90 11 牵出线至13、15、17、19、21道 调车作业 240 
下载: 导出CSV
表 2 咽喉通过能力
Table 2. Carrying capacity of bottleneck
进路编号 现阶段通过列车数/列 咽喉运用饱和状态下通过能力/列 1 68 动车: 46 90 动车: 61 客车: 22 客车: 29 2 65 动车: 54 86 动车: 71 客车: 11 客车: 15 3 67 动车: 48 88 动车: 63 客车: 19 客车: 25 4 63 动车: 52 83 动车: 69 客车: 11 客车: 14 5 18 客车: 15 24 客车: 20 货车: 3 货车: 4 6 21 客车: 14 28 客车: 20 货车: 7 货车: 8 7 货车: 20 货车: 26 8 15 客车: 11 20 客车: 15 货车: 4 货车: 5 9 26 客车: 17 34 客车: 22 货车: 9 货车: 12 10 货车: 18 货车: 24 总计 381 动车: 200 503 动车: 264 客车: 120 客车: 160 货车: 61 货车: 79
下载: 导出CSV
表 3 道岔占用情况
Table 3. Occupation of turnouts
道岔组编号 经由道岔 占用次数 1 1#、31#、71#、73# 171 2 3#、13#、27#、29#、69# 173 3 5#、15#、19#、25#、33#、35# 78 4 37#、41#、55#、57# 86 5 7#、11#、17#、21# 78 6 43#、45#、53# 102 7 9#、23#、39#、49#、51# 56 8 47#、59#、61# 89
下载: 导出CSV
-
[1] 李非桃. 铁路站场咽喉区通过能力计算系统的研究与开发[D]. 北京: 北京交通大学, 2008.LI Fei-tao. Research and development of computational system for throat traffic capacity of rail way station[D]. Beijing: Beijing Jiaotong University, 2008. (in Chinese) [2] 赵王梓, 王慈光. 车站通过能力计算中的数据处理方法[J]. 中国铁道科学, 2006, 27 (6): 113-116. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK200606022.htmZHAO Wang-zi, WANG Ci-guang. Method for data processingin calculating station carrying capacity[J]. China Rail wayScience, 2006, 27 (6): 113-116. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK200606022.htm [3] 刘澜, 王南, 杜文. 车站咽喉通过能力网络优化模型及算法研究[J]. 铁道学报, 2002, 24 (6): 1-5. https://www.cnki.com.cn/Article/CJFDTOTAL-TDXB200206000.htmLI U Lan, WANG Nan, DU Wen. Astudy of network optimization model and algorithmfor carrying capacity of stationthroat[J]. Journal of the China Rail way Society, 2002, 24 (6): 1-5. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-TDXB200206000.htm [4] 闫靖, 王慈光. 技术站咽喉通过能力计算中直接妨碍道岔组的确定[J]. 铁道运输与经济, 2004, 26 (5): 62-64. https://www.cnki.com.cn/Article/CJFDTOTAL-TDYS200405029.htmYANJing, WANG Ci-guang. Method to find out the interfered turnout in calculating carrying capacity of throat attechnical station[J]. Rail way Transport and Economy, 2004, 26 (5): 62-64. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-TDYS200405029.htm [5] 刘澜, 甘灵. 车站咽喉通过能力可视化计算集成系统的研究[J]. 数学的实践与认识, 2005, 35 (2): 80-86. https://www.cnki.com.cn/Article/CJFDTOTAL-SSJS200502013.htmLI U Lan, GAN Ling. A study of the integrated system of visual calculation for the throat capacity of railway stations[J]. Mathematics in Practice and Theory, 2005, 35 (2): 80-86. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-SSJS200502013.htm [6] 王南, 刘澜. 客运站咽喉通过能力新解及计算方法研究[J]. 铁道运输与经济, 2002, 24 (6): 39-41. https://www.cnki.com.cn/Article/CJFDTOTAL-TDYS200206017.htmWANG Nan, LI U Lan. New interpretation on passage capacity of passenger station bottleneck and research on itscalculation method[J]. Rail way Transport and Economy, 2002, 24 (6): 39-41. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-TDYS200206017.htm [7] 刘旭, 谭立刚, 杨浩, 等. 编组站通过能力和改编能力模拟计算系统的研究[J]. 铁道学报, 2002, 24 (5): 11-15.LI U Xu, TAN Li-gang, YANG Hao, et al. A simulation system for computing the carrying capacity and resortingcapacity of marshalling station[J]. Journal of the China Rail-way Society, 2002, 24 (5): 11-15. (in Chinese) [8] 李海鹰, 张超. 编组站到解系统通过能力计算方法[J]. 中国铁道科学, 2010, 31 (3): 120-125. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK201003023.htmLI Hai-ying, ZHANG Chao. Calculation methodfor the carrying capacity of the arriving and breaking up systemin marshsllingyard[J]. China Rail way Science, 2010, 31 (3): 120-125. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK201003023.htm [9] 苏顺虎, 田长海, 陈治亚. 客运专线通过能力的分析计算[J]. 中国铁道科学, 2008, 29 (5): 119-124. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK200805023.htmSUShun-hu, TI AN Chang-hai, CHEN Zhi-ya. Analysis and calculation of the carrying capacity on passenger dedicatedlines[J]. China Rail way Science, 2008, 29 (5): 119-124. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK200805023.htm [10] 王慈光, 闫靖. 列车结构变动对车站通过能力影响的研究[J]. 中国铁道科学, 2005, 26 (5): 128-131. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK200505028.htmWANG Ci-guang, YAN Jing. Research on the influence of the carrying capacity at station by the change of train compos-ition[J]. China Rail way Science, 2005, 26 (5): 128-131. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGTK200505028.htm [11] 杜文, 文东. 客运专线客运站通过能力仿真研究[J]. 西南交通大学学报, 2006, 41 (5): 549-553. https://www.cnki.com.cn/Article/CJFDTOTAL-XNJT200605002.htmDU Wen, WEN Dong. Si mulation research on carrying capacity of high speed passenger rail way line stations[J]. Journal of Southwest Jiaotong University, 2006, 41 (5): 549-553. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XNJT200605002.htm [12] LEICHT E A, NEWMAN M E J. Community structure in directed networks[J]. Physical Review Letters, 2008, 100 (11): 1-4. [13] NEWMAN M E J. Detecting community structure in networks[J]. The European Physical Journal B-Condensed Matter and Complex Systems, 2004, 38 (2): 321-330. [14] 郭平, 康艳荣, 史晓晨. 基于最大Code码的极大完全子图算法[J]. 计算机科学, 2006, 33 (2): 188-190, 200. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJA200602052.htmGUO Ping, KANG Yan-rong, SHI Xiao-chen. An algorithmto find maxi mal complete-subgraph by max-code[J]. Computer Science, 2006, 33 (2): 188-190, 200. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JSJA200602052.htm [15] 周尚超, 刘二根, 王森. 图的最大完全子图的一个算法[J]. 华东交通大学学报, 2002, 19 (4): 71-72, 82. https://www.cnki.com.cn/Article/CJFDTOTAL-HDJT200204021.htmZHOU Shang-chao, LI U Er-gen, WANG Sen. An algorithmof maxi mumclique on an arbitrary graph[J]. Journal of East China Jiaotong University, 2002, 19 (4): 71-72, 82. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-HDJT200204021.htm -
点击查看大图
表(3)
计量
- 文章访问数: 943
- HTML全文浏览量: 146
- PDF下载量: 818
- 被引次数: 0
