基于TCPN的铁路客运站作业组合仿真模型
doi: 10.3969/j.issn.0258-2724.2013.04.016
Railway Passenger Station Operation Combined Simulation Model Based on TCPN
-
摘要: 为解决现有铁路车站作业系统仿真模型建模过程复杂、适用范围有限、效率不高等问题,根据站场布置图,用进路冲突图描述车站列车进路及进路关系,并在此基础上建立了适用于不同站场布置图的赋时有色Petri网(timed colored Petri net, TCPN)仿真模型.车站作业过程仿真结果表明: TCPN仿真模型性能与结构稳定,适用于包括高速铁路在内的任意铁路客运站站型图的作业过程仿真及优化;冲突图模型与现实车站系统相似程度高,对车站布置图的描述精度与施工图精度相同,最高可达毫米级;与传统铁路车站仿真软件手工建模过程相比,冲突图模型建模效率高,建模过程耗时小于1 s;仿真过程咽喉进路最高负荷为70%,到发线最高负荷为35%,列车到达正点率100%,出发正点率91%.
-
关键词:
- 铁路客运站 /
- 作业过程仿真 /
- 赋时有色Petri网 /
- 冲突图 /
- 冲突度
Abstract: A timed colored Petri net (TCPN) simulation model is presented to describe the operating process of railway passenger stations. The TCPN model uses a route conflicting graph to define the station yard in order to solve the problems such as complex modeling process, limited applicable range, and inefficiency, in the system simulation of the current railway station operation. The results of the simulation example show that the TCPN model has the advantages of stability and reusability, and can be widely used in the simulation and optimization of passenger railway stations including high-speed railway stations; the conflicting graph is an accurate presentation of station yard routes, which has the same accuracy as the design of station yard construction, and its precision can reach a millimeter level; compared to the traditional modeling method, the progress of the conflicting graph modeling is more efficient. In the given example, maximum loading rates at station throat area and arrival-departure tracks are 70% and 35%, respectively; on-schedule rates of arrival and departure are 100% and 91%, respectively. -
吕红霞. 铁路大型客运站作业计划智能编制的优化技术和方法研究[D]. 成都:西南交通大学,2008. 史峰,谢楚农,于桂芳. 铁路车站咽喉区进路排列优化方法[J]. 铁道学报,2004,26(4): 5-9. SHI Feng, XIE Chunong, YU Guifang. Optimization methods for arranging train routes in station bottleneck[J]. Journal of the China Railway Society, 2004, 26(4): 5-9. 史峰,陈彦,秦进,等. 铁路客运站到发线运用和接发车进路排列方案综合优化[J]. 中国铁道科学,2009,30(6): 108-113. SHI Feng, CHEN Yan, QIN Jin, et al. Comprehensive optimization of arrival-departure track utilization and inbound-outbound route assignment in railway passenger station[J]. China Railway Science, 2009, 30(6): 108-113. RIEZEBOS J, Van WEZEL W. k-Shortest routing of trains on shunting yards[J]. OR Spectrum, 2009, 31(4): 745-748. VELASQUEZ R, EHRGOTT M, SCHOBEL A. A set-packing approach to routing trains through railway station 2005-36[R]. Gottingen: Georg-August-Universitat Gottingen, 2005. 李莹慧. 铁路车站进路选择的免疫进化算法研究[D]. 北京:北京交通大学,2006. 黄鉴,彭其渊. 高速列车停站优化问题的两阶段求解算法[J]. 西南交通大学学报,2012,47(3): 484-489. HUANG Jian, PENG Qiyuan. Two-stage optimization algorithm for stop schedule plan of high-speed train[J]. Journal of Southwest Jiaotong University, 2012, 47(3): 484-489. 赵军,李愈,任其亮,等. 铁路枢纽内客运站分工的优化模型及算法[J]. 西南交通大学学报,2011,46(1): 148-153. ZHAO Jun, LI Yu, REN Qiliang, et al. Optimal model and algorithm for allocation of arrival and departure trains in railway passenger terminal[J]. Journal of Southwest Jiaotong University, 2011, 46(1): 148-153. LETERSON J L,吴哲辉. PETRI网理论与系统模拟[M]. 北京:中国矿业大学出版社,1989: 5-30. 贾文峥,毛保华,何天键,等. 基于Petri 网的车站股道分配方案瓶颈识别[J]. 交通运输系统工程与信息,2009,9(6): 136-141. JIA Wenzheng, MAO Baohua, HO Tinkin, et al. Bottlenecks detection of track allocation schemes at rail stations by Petri nets[J]. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(6): 136-141. 艾厚文,贾利民,秦勇,等. 基于随机Petri网的铁路应急救援流程化分析[J]. 铁路计算机应用,2008,17(7): 9-11. AI Houwen, JIA Limin, QIN Yong, et al. Research on process of railway emergency rescue based on stochastic Petri net[J]. Railway Computer Application, 2008, 17(7): 9-11. 鲁工圆,吴琪. 铁路车站咽喉区进路排列模型及动态搜索算法//中国铁道学会站场与枢纽学术年会. 西安:,2009: 82-87. 谢小淞. 客运专线调度指挥关键技术问题研究[D]. 成都:西南交通大学,2009.
点击查看大图
计量
- 文章访问数: 1011
- HTML全文浏览量: 51
- PDF下载量: 361
- 被引次数: 0