重载铁路车站到发线运用优化研究
|
摘要
为提高重载铁路车站通过能力,以到发进路与到发线选择唯一性,进路与到发线匹配唯一性,进路与到发线占用非冲突性,调机前往到发线与其将要服务的列车占用到发线一致性,机车占用进路唯一性,组合列车状态转化等为约束条件,分别以到发线运用均衡性、选择倾向性为目标函数,构建二次"0-1"规划模型与一次"0-1"规划模型,应用Matlab与LINGO进行数网构建与模型求解。以包神铁路瓷窑湾站为例,对其一天内到发线占用进行优化求解,证明了整数线性规划模型可以对重载铁路车站到发线运用进行有效优化。
In order to improve the carrying capacity of heavy haul railway station,the uniqueness of the choice of inbound-outbound route and arrival-departure track,the uniqueness of the matching between route and track,the nonconflicting of the occupation of route and track,the consistency between the track which the locomotive would assigned to and the track occupied by the train to be served,the uniqueness of the locomotive occupation route,and the state transformation of combined trains are set as constraints. The utilization equilibrium and the selection tendency of the track are respectively set as the objective functions,constructing linear 0-1 programming model and quadratic 0-1 programming model. Matlab and LINGO are used to construct the digital network and solve the model. Taking the Ciyaowan station of Bao-Shen Railway as an example,the optimal solution of its track occupancy in one day proves that the integer linear programming model can effectively optimize the application of the track of the heavy haul railway station.
In order to improve the carrying capacity of heavy haul railway station,the uniqueness of the choice of inbound-outbound route and arrival-departure track,the uniqueness of the matching between route and track,the nonconflicting of the occupation of route and track,the consistency between the track which the locomotive would assigned to and the track occupied by the train to be served,the uniqueness of the locomotive occupation route,and the state transformation of combined trains are set as constraints. The utilization equilibrium and the selection tendency of the track are respectively set as the objective functions,constructing linear 0-1 programming model and quadratic 0-1 programming model. Matlab and LINGO are used to construct the digital network and solve the model. Taking the Ciyaowan station of Bao-Shen Railway as an example,the optimal solution of its track occupancy in one day proves that the integer linear programming model can effectively optimize the application of the track of the heavy haul railway station.
引文
[1]国家铁路局. TB 10099—2017铁路车站及枢纽设计规范[S].北京:中国铁道出版社,2017.
[2]乔瑞军,朱晓宁,钱继锋.客运专线车站接发车进路选择优化[J].物流技术,2012,31(17):201-204.
[3]乔瑞军,朱晓宁,张天伟,等.客运专线车站到发线运用多目标优化模型[J].北京交通大学学报,2012,36(3):57-64.
[4]康柳江.铁路客运站咽喉区利用优化建模与求解[D].北京:北京交通大学,2013.
[5]才荣吉.大型铁路客运站咽喉通过能力的研究[D].兰州:兰州交通大学,2014.
[6]王克豹.客运专线与既有线衔接站到发线运用优化研究[D].成都:西南交通大学,2011.
[7]李琦.高速铁路大型客运站到发线运用优化研究[D].成都:西南交通大学,2012.
[8]张文婷.高速铁路客运站通过能力利用问题研究[D].成都:西南交通大学,2016.
[9]陈晓竹.高速铁路点线能力协调仿真分析[D].成都:西南交通大学,2013.
[10] Caimi,G,Burkolter,D.,Herrmann,T. Finding delay-tolerant train routings through station[J]. Operations Research Proceedings 2004,2004,5:136-143.
[11] Billionnet A. Using integer programming to solve the train-platforming problem[J]. Transportation Science,1998,37(2):213-222.
[12] Cornelsen,S.,Stefano,G D. Track assignment[J]. Journal of Discrete Algoriflims,2007,5(2):250-261.
[13] Cardillo,D. D. L.,Mione,N. KL-listλcoloring of graphs[J].European Journal of Operational Research,2002,106(1):160-164.
[14] Rodriguez J. A constraint programming for real-time trains scheduling at junctions[J]. Transportation Research Part B:Methodological,2007,41(2):231-245.
[15] D'Ariano,A.,Pacciarelli,D”Pranzo,M. A branch-and-bound Algorithm for scheduling trains in a railway network[J]. Exiropean Journal of Operational Research,2007,183(2):643-657.
[2]乔瑞军,朱晓宁,钱继锋.客运专线车站接发车进路选择优化[J].物流技术,2012,31(17):201-204.
[3]乔瑞军,朱晓宁,张天伟,等.客运专线车站到发线运用多目标优化模型[J].北京交通大学学报,2012,36(3):57-64.
[4]康柳江.铁路客运站咽喉区利用优化建模与求解[D].北京:北京交通大学,2013.
[5]才荣吉.大型铁路客运站咽喉通过能力的研究[D].兰州:兰州交通大学,2014.
[6]王克豹.客运专线与既有线衔接站到发线运用优化研究[D].成都:西南交通大学,2011.
[7]李琦.高速铁路大型客运站到发线运用优化研究[D].成都:西南交通大学,2012.
[8]张文婷.高速铁路客运站通过能力利用问题研究[D].成都:西南交通大学,2016.
[9]陈晓竹.高速铁路点线能力协调仿真分析[D].成都:西南交通大学,2013.
[10] Caimi,G,Burkolter,D.,Herrmann,T. Finding delay-tolerant train routings through station[J]. Operations Research Proceedings 2004,2004,5:136-143.
[11] Billionnet A. Using integer programming to solve the train-platforming problem[J]. Transportation Science,1998,37(2):213-222.
[12] Cornelsen,S.,Stefano,G D. Track assignment[J]. Journal of Discrete Algoriflims,2007,5(2):250-261.
[13] Cardillo,D. D. L.,Mione,N. KL-listλcoloring of graphs[J].European Journal of Operational Research,2002,106(1):160-164.
[14] Rodriguez J. A constraint programming for real-time trains scheduling at junctions[J]. Transportation Research Part B:Methodological,2007,41(2):231-245.
[15] D'Ariano,A.,Pacciarelli,D”Pranzo,M. A branch-and-bound Algorithm for scheduling trains in a railway network[J]. Exiropean Journal of Operational Research,2007,183(2):643-657.