高速铁路列车运行图优化和评估研究
|
摘要
我国规划了世界上规模最大的高速铁路路网,安全和正点运行是我国高速铁路运营的基本要求,也是影响我国高速铁路客运服务质量的关键因素。列车运行图是铁路运输组织方案的集中体现,列车运行图的优化和评估是铁路运输组织的重要问题。论文围绕我国高速铁路列车运行图的优化和评估,系统地提出理论和方法,支持我国高速铁路运输组织的现代化建设。
在高速铁路列车运行图优化模型方面,首先介绍周期性列车运行图的PESP模型、CPF模型和主要求解方法。作为一种“以人为本”的先进的列车运行组织方式,周期性列车运行图已经在欧洲高速铁路和日本新干线得到了广泛应用,值得我国高速铁路借鉴；在此基础上,借鉴周期性列车运行图的列车开行特征,提出局部周期性列车运行图的概念、主要特征、优化模型和求解方法。局部周期性列车运行图可看作常规和周期性列车运行图的通用原型,具有更强的适用性；提出单条线路周期性列车运行图的协同优化模型和求解方法,单条线路指线路未成网(或成网条件下列车不跨线运行)。在协同优化模型中,不指定列车开行方案,实现客流分配、列车开行方案、列车运行图、列车运用方案等的闭环反馈,实现由客流方案到周期性列车运行图的直接优化生成。
用鲁棒性表示列车运行图的抗晚点能力,以常规列车运行图为例,考虑日常较小的列车运行干扰,提出列车运行图鲁棒性的评价指标和评估模型,包括数学规划模型、赋时Petri网模型、Max-Plus代数模型；提出高速铁路列车运行图鲁棒性优化模型,介绍可恢复鲁棒性优化的概念,提出以控制列车最大晚点和控制列车晚点传播范围为主要目的的两种列车运行图可恢复鲁棒性优化模型,并对恢复算法、模型转换方法、鲁棒算法、鲁棒性代价等进行了研究；此外,提出高速铁路微观行车仿真模型和各种行车作业的仿真调度过程,提出基于MPI和OpenMP的并行程序设计方法。基于列车作业仿真调度过程,提出车站通过能力仿真评估模型,开发和实现了车站通过能力仿真评估系统,全面评估不同层次的车站通过能力。
除说明为单条线路外,论文提出的高速铁路列车运行图优化模型(包括周期性列车运行图优化模型)也适用于成网条件,鲁棒性优化方法(包括可恢复鲁棒性优化方法)同时适用于常规和周期性列车运行图。对论文提出的优化模型和求解方法,均采用CPLEX系统建模和求解,通过案例研究进行了验证。
China has planned to construct the largest high-speed railway network in the world. Meanwhile, China has to operate these high-speed railway lines safely and punctually. Railway timetable is probably the most important factor for passenger transportation since it is the basic plan for both operators and passengers.This thesis researches on the optimization and evaluation of high-speed railway timetables.
First of all, the PESP problem and models for periodic timetabling are introduced. Since travelers can be benefited greatly from periodic train services, periodic timetables have been widely used by European high-speed railway lines and Japanese Shinkansens. For Chinese high-speed railway lines, maybe periodic timetable is a better choice when taking its advantages into consideration. Secondly, to absorb the periodic characteristics of a periodic timetable, the concept of a partial periodic timetable based on a regular timetable is suggested and a partial periodic timetabling model is provided. A partial periodic timetable can be transferred to a regular timetable without any partial periodic constraints and to a periodic timetable with the strictest partial periodic constraints. Lastly, for an independent high-speed railway line, an integrated periodic timetabling model is provided. Using this integrated model, the allocation of passengers to trains, the design of line plans and timetables are solved and optimized all at once. Optimized periodic timetables together with line plans can be obtained directly with the only input of OD passenger numbers.
Robustness is certainly an inherent requirement for a railway timetable since the daily disturbances are inevitable. The indices and models for evaluating the timetable robustness are provided at first, including mathematical models, Timed Petri Net models and Max-Plus algebra linear models. Robust timetabling models are provided in a next step, including two recoverable robust timetabling models using two different recovery algorithms. Methods for transferring these models, the robust algorithms and prices of robustness are also analyzed. Since simulation is a traditional way to evaluate timetable robustnesss, a microscopic simulation model and detail dispatch procedures for all train operations are provided at last. Parallel programming methods using OpenMP or MPI are suggested. Based on the dispatch procedures, a simulation model and a simulation system for evaluating the different carrying capacities at stations are developed.
Except for the integrated periodic timetabling model for an independent high-speed railway line, the timetabling models mentioned above can also be used for a high-speed railway network. Meanwhile, the methods mentioned above for robust timetabling models can also be used for periodic timetables. CPLEX is used to model and solve these models.
在高速铁路列车运行图优化模型方面,首先介绍周期性列车运行图的PESP模型、CPF模型和主要求解方法。作为一种“以人为本”的先进的列车运行组织方式,周期性列车运行图已经在欧洲高速铁路和日本新干线得到了广泛应用,值得我国高速铁路借鉴；在此基础上,借鉴周期性列车运行图的列车开行特征,提出局部周期性列车运行图的概念、主要特征、优化模型和求解方法。局部周期性列车运行图可看作常规和周期性列车运行图的通用原型,具有更强的适用性；提出单条线路周期性列车运行图的协同优化模型和求解方法,单条线路指线路未成网(或成网条件下列车不跨线运行)。在协同优化模型中,不指定列车开行方案,实现客流分配、列车开行方案、列车运行图、列车运用方案等的闭环反馈,实现由客流方案到周期性列车运行图的直接优化生成。
用鲁棒性表示列车运行图的抗晚点能力,以常规列车运行图为例,考虑日常较小的列车运行干扰,提出列车运行图鲁棒性的评价指标和评估模型,包括数学规划模型、赋时Petri网模型、Max-Plus代数模型；提出高速铁路列车运行图鲁棒性优化模型,介绍可恢复鲁棒性优化的概念,提出以控制列车最大晚点和控制列车晚点传播范围为主要目的的两种列车运行图可恢复鲁棒性优化模型,并对恢复算法、模型转换方法、鲁棒算法、鲁棒性代价等进行了研究；此外,提出高速铁路微观行车仿真模型和各种行车作业的仿真调度过程,提出基于MPI和OpenMP的并行程序设计方法。基于列车作业仿真调度过程,提出车站通过能力仿真评估模型,开发和实现了车站通过能力仿真评估系统,全面评估不同层次的车站通过能力。
除说明为单条线路外,论文提出的高速铁路列车运行图优化模型(包括周期性列车运行图优化模型)也适用于成网条件,鲁棒性优化方法(包括可恢复鲁棒性优化方法)同时适用于常规和周期性列车运行图。对论文提出的优化模型和求解方法,均采用CPLEX系统建模和求解,通过案例研究进行了验证。
China has planned to construct the largest high-speed railway network in the world. Meanwhile, China has to operate these high-speed railway lines safely and punctually. Railway timetable is probably the most important factor for passenger transportation since it is the basic plan for both operators and passengers.This thesis researches on the optimization and evaluation of high-speed railway timetables.
First of all, the PESP problem and models for periodic timetabling are introduced. Since travelers can be benefited greatly from periodic train services, periodic timetables have been widely used by European high-speed railway lines and Japanese Shinkansens. For Chinese high-speed railway lines, maybe periodic timetable is a better choice when taking its advantages into consideration. Secondly, to absorb the periodic characteristics of a periodic timetable, the concept of a partial periodic timetable based on a regular timetable is suggested and a partial periodic timetabling model is provided. A partial periodic timetable can be transferred to a regular timetable without any partial periodic constraints and to a periodic timetable with the strictest partial periodic constraints. Lastly, for an independent high-speed railway line, an integrated periodic timetabling model is provided. Using this integrated model, the allocation of passengers to trains, the design of line plans and timetables are solved and optimized all at once. Optimized periodic timetables together with line plans can be obtained directly with the only input of OD passenger numbers.
Robustness is certainly an inherent requirement for a railway timetable since the daily disturbances are inevitable. The indices and models for evaluating the timetable robustness are provided at first, including mathematical models, Timed Petri Net models and Max-Plus algebra linear models. Robust timetabling models are provided in a next step, including two recoverable robust timetabling models using two different recovery algorithms. Methods for transferring these models, the robust algorithms and prices of robustness are also analyzed. Since simulation is a traditional way to evaluate timetable robustnesss, a microscopic simulation model and detail dispatch procedures for all train operations are provided at last. Parallel programming methods using OpenMP or MPI are suggested. Based on the dispatch procedures, a simulation model and a simulation system for evaluating the different carrying capacities at stations are developed.
Except for the integrated periodic timetabling model for an independent high-speed railway line, the timetabling models mentioned above can also be used for a high-speed railway network. Meanwhile, the methods mentioned above for robust timetabling models can also be used for periodic timetables. CPLEX is used to model and solve these models.
引文
[1]Jan-Willem Goossens, Stan van Hoesel, Leo Kroon. A branch-and-cut approach for solving railway line-planning problems[J]. TRANSPORTATION SCIENCE,2004,38(3): 379-393.
[2]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A column-generation approach to line planning in public transport[J]. TRANSPORTATION SCIENCE,2007,41(1): 123-132.
[3]Michael R. Bussieck, Thomas Lindner, Marco E. Lubbecke. A fast algorithm for near cost optimal line plans[J]. Mathematical Methods of Operations Research,2004,59(2): 205-220.
[4]Anita Schobel, Silvia Schwarze. A game-theoretic approach to line planning[C].6th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS 2006),2006.
[5]Yu-Hern Chang, Chung-Hsing Yeh, Ching-Cheng Shen. A multiobjective model for passenger train services planning:application to Taiwan's high-speed rail line [J]. Transportation Research Part B:Methodological,2000,34(2):91-106.
[6]Wen-Jin HSIEH. A passenger's choice model of train service with elastic demand[J]. Journal of the Eastern Asia Society for Transportation Studies,2003,5:252-263.
[7]Katja Boos. Line planning in railway systems[J].
[8]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. Models for Line planning in Public Transport[R]. ZIB,2004.
[9]Jan-Willem Goossens, Stan van Hoesel, Leo Kroon. On solving multi-type railway line planning problems [J]. European Journal of Operational Research,2006,168(2):403-424.
[10]Marc E. Pfetsch, Ralf Borndorfer. Routing in Line Planning for Public Transport[J]. Operations Research Proceedings,2006,2005:405-410.
[11]Michael R. Bussieck. Optimal lines in public rail transport[D].1998.
[12]Michael R. Bussieck, Peter Kreuzer, Uwe T. Zimmermann. Optimal lines for railway systems[J]. European Journal of Operational Research,1997,96(1):54-63.
[13]Michiel J.C.M. Vromans, Rommert Dekker, Leo G. Kroon. Reliability and heterogeneity of railway services[J]. European Journal of Operational Research,2006,172(2):647-665.
[14]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A path-based model for line planning in public transport[R]. ZIB,2005.
[15]Michiel Vromans. Reliability of railway systems[D].2005.
[16]Dennis Huisman, Leo G. Kroon, Ramon M. Lentink and Michiel J. C. M. Vromans. Operations research in passenger railway transportation[J]. Statistica Neerlandica,2005, 59(4):467-497.
[17]Xuesong Zhou, Ming Zhong. Bicriteria train scheduling for high-speed passenger railroad planning applications[J]. European Journal of Operational Research,2005,167(3): 752-771.
[18]Schobel, Anita; Scholl, Susanne. Line planning with minimal traveling time[C].5th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS 2005),2005.
[19]Hooghiemstra, J.S., Teunisse, M.J.G.The use of simulation in the planning of the dutch railway services[J]. Simulation Conference Proceedings,1998,2:1139-1145.
[20]Mathias Michaelis, Anita Schobel. Integrating line planning, timetabling, and vehicle scheduling:a customer-oriented heuristic[J]. Public Transport,2009,1:211-232.
[21]Anita Schobel. Line planning in public transportation:models and methods[J]. OR Spectrum,2012,34(3):491-510.
[22]M. R. Bussieck, T. Winter, U. T. Zimmermann. Discrete optimization in public rail transport[J]. Mathematical Programming,1997,79(1-3):415-444.
[23]Schobel, Anita; Scholl, Susanne. Line planning with minimal transfers[C],6th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS 2006),2006.
[24]Michael J. Klier, Knut Haase. Line Optimization in Public Transport Systems[J]. Operations Research Proceedings,2008,2007:473-478.
[25]A. Abbas-Turki, R. Bouyekhf, O. Grunder, A. El Moudni. On the line planning problems of the hub public-transportation networks[J]. International Journal of Systems Science, 2004,35(12):693-706.
[26]Thomas Lindner. Train schedule optimization in public rail transport[D].2000.
[27]Leon Willem Petrus Peeters. Cyclic railway timetable optimization[D].2003.
[28]U. Brannlund, P. O. Lindberg, A. Nou and J.-E. Nilsson. Railway Timetabling Using Lagrangian Relaxation[J]. Transportation Science,1998,32(4):358-369.
[29]Alberto Caprara, Matteo Fischetti and Paolo Toth. Modeling and Solving the Train Timetabling Problem[J]. Operations Research,2002,50(5):851-861.
[30]Carlo Mannino, Alessandro Mascis. Optimal Real-Time Traffic Control in Metro Stations[J]. Operations Research,2009,57(4):1026-1039.
[31]Steven Harrod. Modeling Network Transition Constraints with Hypergraphs[J]. Transportation Science,2011,45(1):81-97.
[32]Leo G. Kroon and Leon W. P. Peeters. A variable trip time model for cyclic railway timetabling[J]. Transportation Science,2003,37(2):198-212.
[33]Christian Liebchen. The First Optimized Railway Timetable in Practice[J]. Transportation Science,2008,42(4):420-435.
[34]Leo G. Kroon, Rommert Dekker and Michiel J.C.M. Vromans. Cyclic Railway Timetabling:a Stochastic Optimization Approach[R]. ERIM,2005.
[35]Rob M.P. Goverde. Railway timetable stability analysis using max-plus system theory[J]. Transportation Research Part B:Methodological,2007,41(2):179-201.
[36]Michiel Adriaan Odijk. Railway timetable generation[D].1997.
[37]Matteo Fischetti, Domenico Salvagnin and Arrigo Zanette. Fast approaches to improve the robustness of a railway timetable[J]. Transportation Science,2009,43(3):321-335.
[38]Leon Peeters, Leo Kroon. A cycle based optimization model for the cyclic railway timetabling problem[J]. Lecture Notes in Economics and Mathematical Systems,2001, 505:275-296.
[39]Gabrio Caimi, Martin Fuchsberger, Marco Laumanns, and Kaspar Schupbach. Periodic railway timetabling with event flexibility [J]. Networks,2010,57(1):3-18.
[40]Christian Liebchen and Leon Peeters. On cyclic timetabling and cycles in graphs[R]. TUB,2002.
[41]Leo Kroon, Gabor Maroti, Mathijn Retel Helmrich, Michiel Vromans, Rommert Dekker. Stochastic improvement of cyclic railway timetables[J]. Transportation Research Part B: Methodological,2008,42(6):553-570.
[42]Fischetti, Matteo; Zanette, Arrigo; Salvagnin, Domenico. Fast Approaches to Robust Railway Timetabling[C].7th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2007),2007.
[43]Rob M.P. Goverde. Improving punctuality and transfer reliability by railway timetable optimization[D]. Delft,1999.
[44]L. Ingolotti, A. Lova, F. Barber, P. Tormos, M. A. Salido, M. Abril. New heuristics to solve the "CSOP" railway timetabling problem[J]. Lecture Notes in Computer Science, 2006,4031:400-409.
[45]Rob M.P. Goverde. Punctuality of railway operations and timetable stability analysis[D]. Delft,2005.
[46]M.A. Salido, F. Barber, L. Ingolotti. Robustness in railway transportation scheduling[C]. Proceedings of the 7th World Congress on Intelligent Control and Automation,2008.
[47]Christian Liebchen. A cut-based heuristic to produce almost feasible periodic railway timetables[J]. Lecture Notes in Computer Science,2005,3503:354-366.
[48]Kroon, L.G.; Huisman, D.; Maroti, G.. Railway timetabling from an operations research[R]. EUR,2007.
[49]M. Abril, F. Barber, L. Ingolotti, M.A. Salido, P. Tormos, A. Lova. An assessment of railway capacity[J]. Transportation Research Part E:Logistics and Transportation Review, 2008,44(5):774-806.
[50]Christian Liebchen, Rolf H. Mohring. The modeling power of the periodic event scheduling problem:railway timetables-and beyond[R]. TUB,2004.
[51]P. Vansteenwegen, D. Van Oudheusden. Developing railway timetables which guarantee a better service[J]. European Journal of Operational Research,2006,173(1):337-350.
[52]Christian Liebchen, Michael Schachtebeck, Anita Schobel, Sebastian Stiller, Andre Prigge. Computing delay resistant railway timetables[R]. TUB,2007.
[53]Leo Kroon, Dennis Huisman, Erwin Abbink, Pieter-Jan Fioole, Matteo Fischetti, Gabor Maroti, Alexander Schrijver, Adri Steenbeek and Roelof Ybema. The new Dutch timetable:The OR revolution[J]. Interfaces,2009,39(1):6-17.
[54]Christian Liebchen, Leon Peeters. Integral cycle bases for cyclic timetabling[J]. Discrete Optimization,2009,6(1):98-109.
[55]Christian Liebchen, Marco Lubbecke, Rolf Mohring, and Sebastian Stiller. The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications[J]. Lecture Notes in Computer Science,2009,5868:1-27.
[56]Christian Liebchen, Rolf H. Mohring. A case study in periodic timetabling[J]. Electronic Notes in Theoretical Computer Science,2002,66(6):18-31.
[57]Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida. A Lagrangian heuristic algorithm for a real-world train timetabling problem[J]. Discrete Applied Mathematics, 2006,154(5):738-753.
[58]Leon Peeters, Leo Kroon. An Optimization Approach to Railway Timetabling[R].2000.
[59]Anita Schobel. A model for the delay management problem based on mixed-integer-programming[J]. Electronic Notes in Theoretical Computer Science,2001, 50(1):1-10.
[60]R.Borndorfer, T. Schlechte. Models for railway track allocation[C].7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems(ATMOS 2007),2007.
[61]P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, M. A. Salido. A Genetic Algorithm for Railway Scheduling Problems[J]. Metaheuristics for Scheduling in Industrial and Manufacturing ApplicationsStudies in Computational Intelligence,2008,128:255-276.
[62]Gabrio Caimi, Dan Burkolter, Thomas Herrmann, Fabian Chudak, Marco Laumanns. Design of a railway scheduling model for dense services[J]. Networks and Spatial Economics,2009,9(1):25-46.
[63]Christian Liebchen. Symmetry for periodic railway timetables[J]. Electronic Notes in Theoretical Computer Science,2004,92(17):34-51.
[64]Steven Harrod. Capacity factors of a mixed speed railway network[J]. Transportation Research Part E:Logistics and Transportation Review,2009,45(5):830-841.
[65]Leo Kroon. Mathematics for railway timetabling[J]. ERCIM NEWS,2007.
[66]Richard M. Lusby, Jesper Larsen, Matthias Ehrgott, David Ryan. Railway track allocation:models and methods[J]. OR Spectrum,2011,33(4):843-883.
[67]Anita Schobel. Integer programming approaches for solving the delay management problem[J]. Lecture Notes in Computer Science,2007,4359:145-170.
[68]Fischer, Frank; Helmberg, Christoph; Janon, Jogen; Krostitz, Boris. Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation[J].8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems(ATMOS 2008),2008.
[69]Yusin Lee, Chuen-Yih Chen. A heuristic for the train pathing and timetabling problem[J]. Transportation Research Part B:Methodological,2009,43(8-9):837-851.
[70]Lei Nie, Ingo A. Hansen. System analysis of train operations and track occupancy at railway stations[J]. System analysis of train operations and track occupancy at railway stations,2005,5(1):31-54.
[71]Christian Liebchen. Finding short integral cycle bases for cyclic timetabling[R]. TUB, 2003.
[72]Valentina Cacchiani, Alberto Caprara, Paolo Toth. A column generation approach to train timetabling on a corridor[J].4OR,2008,6(2):125-142.
[73]Forsgren, Malin and Aronsson, Martin and Kreuger, Per and Dahlberg, Hans. The Maraca:a tool for minimizing resource conflicts in a non-periodic railway timetable[J]. RailRome 2011, Rome, Italy.
[74]Rob M.P. Goverde. A delay propagation algorithm for large-scale railway traffic networks[J]. Transportation Research Part C:Emerging Technologies,2010,18(3): 269-287.
[75]Julie Jespersen-Groth, Daniel Potthoff, Jens Clausen, Dennis Huisman, Leo Kroon, Gabor Maroti, Morten Nyhave Nielsen. Disruption management in passenger railway transportation[R]. ESE,2007.
[76]Michiel A. Odijk. A constraint generation algorithm for the construction of periodic railway timetables[J]. Transportation Research Part B:Methodological,1996,30(6): 455-464.
[77]Valentina Cacchiani. Models and algorithms for combinatorial optimization problems arising in railway applications[J].2009,7(1):109-112.
[78]B. Adenso-Diaz, M. Oliva Gonzalez, P. Gonzalez-Torre. On-line timetable re-scheduling in regional train services[J]. Transportation Research Part B:Methodological,1999, 33(6):387-398.
[79]Matteo Fischetti, Michele Monaci. Light Robustness[J]. Lecture Notes in Computer Science,2009,5868:61-84.
[80]R.M.P. Goverde, M.A. Odijk. Performance evaluation of network timetables using PETER[C]. Computers in Railways VIII, WIT Press, Southampton,2002.
[81]Christian Liebchen, Mark Proksch, Frank H. Wagner. Performance of algorithms for periodic timetable optimization[J]. Lecture Notes in Economics and Mathematical Systems,2008,600:151-180.
[82]Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren. Generation of classes of robust periodic railway timetables[J]. Computers & Operations Research,2006,33(8): 2283-2299.
[83]Ingo A. Hansen. Railway network timetabling and dynamic traffic management[C].2nd International Conference on Recent Advances in Railway Engineering(ICRARE-2009), Iran university of science and Technology, Tehran, I.R. Iran,2009.
[84]Caprara, A.; Fischetti, M.; Guida, P.L.; Monaci, M.; Sacco, G.; Toth, P.. Solution of real-world train timetabling problems[C]. Proceedings of the 34th Annual Hawaii International Conference on System Sciences,2001.
[85]Ralf Borndorfer, Thomas Schlechte, Steffen Weider. Railway track allocation by rapid branching[R]. ZIB,2010.
[86]Alex Landex, Anders H. Kaas, Bernd Schittenhelm, Jan Schneider-Tilli. Evaluation of railway capacity[R].2006.
[87]Dan BURKOLTER, Thomas HERRMANN, Gabrio CAIMI. GENERATING DENSE RAILWAY SCHEDULES[C]. Advanced OR and AI Methods in Transportation,2005.
[88]Xavier DELORME, Xavier GANDIBLEUX, Joaquin RODRIGUEZ. Stability evaluation of a railway timetable at station level[J]. European Journal of Operational Research, 2009,195(3):780-790.
[89]Dick Middelkoop, Michiel Bouwman. SIMONE:LARGE SCALE TRAIN NETWORK SIMULATIONS[C]. Proceedings of the 2001 Winter Simulation Conference,2001.
[90]Annabell Berger, Andreas Gebhardt, Matthias Muller-Hannemann, and Martin Ostrowski. Stochastic delay prediction in large train networks[C].11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS 2011), 2011.
[91]Christian Liebchen, Sebastian Stiller. Delay Resistant Timetabling[R]. TUB,2006.
[92]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, and Alfredo Navarra. Delay Management Problem:Complexity Results and Robust Algorithms[J]. Lecture Notes in Computer Science,2008,5165:458-468.
[93]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, and Alfredo Navarra. On the Interaction between Robust Timetable Planning and Delay Management[R]. ARRIVAL,2007.
[94]Christian Liebchen, Marco Lubbecke, Rolf H. Mohring, Sebastian Stiller. Recoverable Robustness[R]. ARRIVAL,2007.
[95]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra. Recoverable robust timetabling for single delay:Complexity and polynomial algorithms for special cases[J]. Journal of Combinatorial Optimization,2009,18(3): 229-257.
[96]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, and Cristina M. Pinotti. Recoverable Robust Timetables:an Algorithmic Approach on Trees[J]. IEEE Transactions on Computers,2011,60(3):433-446.
[97]Peter J. Zwaneveld, Leo G. Kroon, H. Edwin Romeijn and Marc Salomon, Stephane Dauzere-Peres, Stan P.M. van Hoesel, Harrie W. Ambergen. Routing Trains through Railway Stations:Model Formulation and Algorithms[J]. Transportation Science,1996, 30(3):181-194.
[98]Leo G. Kroon, H. Edwin Romeijn, Peter J. Zwaneveld. Routing trains through railway stations:complexity issues[J]. European Journal of Operational Research,1997,98(3): 485-498.
[99]Peter J. Zwaneveld, Leo G. Kroon, Stan P.M. van Hoesel. Routing trains through a railway station based on a node packing model[J]. European Journal of Operational Research,2001,128(1):14-33.
[100]Malachy Carey, Sinead Carville. Scheduling and platforming trains at busy complex stations[J]. Transportation Research Part A,2003,37:195-224.
[101]Xavier DELORME, Xavier GANDIBLEUX, Joaquin RODRIGUEZ. GRASP for set packing problems[J]. European Journal of Operational Research,2004,153(3):564-580.
[102]Rafael Velasque, M Ehrgott, D Ryan, A Schobel. A Set-packing Approach to Routing Trains Through Railway Stations[C]. Proceedings of the 40th Annual Conference of Operational Research Society of New Zealand,2005.
[103]Gabrio Caimi, Dan Burkolter, and Thomas Herrmann. Finding delay-tolerant train routing through stations[J]. Operations Research Proceedings,2005,2004(5):136-143.
[104]Malachy Carey, Ivan Crawford. Scheduling trains on a network of busy complex stations[J]. Transportation Research Part B,2007,41:159-178.
[105]Martin Fuchsberger. Solving the train scheduling problem in a main station via a resource constrained space-time integer multi-commodity flow[D]. Institute for Operations Research, ETH Zurich,2006.
[106]THOMAS MICHAEL HERRMANN. Stability of timetables and train routings through station regions[D]. SWISS FEDERAL INSTITUTE OF TECHNOLOGY, ZURICH, 2006.
[107]Peter J. Zwaneveld. Railway Planning:routing of trains and allocation of passenger lines[D]. Erasmus Universiteit Rotterdam,1997.
[108]Joaquin Rodriguez. A constraint programming model for real-time train scheduling at junctions[C]. Proceedings of RailDelft2005:the 1st International Seminar on Railway Operations Modelling and Analysis, Delft, The Netherlands,2005.
[109]Xavier Gandibleux, Julien Jorge, S'ebastien Angibaud, Xavier Delorme, Joaquin Rodriguez. An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure[C]. Proceedings of MIC2005:The Sixth Metaheuristics International Conference, Vienna, Austria,2005.
[110]Andreas Ginkel and Anita Schobel. To wait or not to wait? The bicriteria delay management problem in public transportation[J]. Transportation Science,2007,41(4): 527-538.
[111]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti. Recoverable robust timetables on trees[J]. Lecture Notes in Computer Science,2009, 5573:451-462.
[112]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schobel. Recoverable robustness in shunting and timetabling[J]. Lecture Notes in Computer Science,2009,5868:28-60.
[113]S. Cicerone, G. Di Stefano, M. Schachtebeck, and A. Sch"obel. Dynamic algorithms for recoverable robustness problems[C].8th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS 2008),2008.
[114]Christian Liebchen, Marco Liibbecke, Rolf Mohring, Sebastian Stiller. The concept of recoverable robustness, linear programming recovery, and railway applications[J]. Lecture Notes in Computer Science,2009,5868:1-27.
[115]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra. Recoverable-robust timetables for trains on single-line corridors[R]. ARRIVAL,2009.
[116]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra. Evaluation of recoverable-robust timetables on tree networks[J]. Lecture Notes in Computer Science, 2009,5874:24-35.
[117]Goerigk, Marc; Schobel, Anita. An empirical analysis of robustness concepts for timetabling[C].10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS 2010),2010.
[118]Valentina Cacchiani, Paolo Toth. Nominal and robust train timetabling problems[J]. European Journal of Operational Research,2012,219(3):727-737.
[119]Jean-Francois Cordeau, Paolo Toth and Daniele Vigo. A survey of optimization models for train routing and scheduling[J]. Transportation Science,1998,32(4):380-404.
[120]Lusby, Richard; Larsen, Jesper; Ryan, David; Ehrgott, Matthias. Routing trains through railway junctions:A new set packing approach[R]. IMM,2006.
[121]Andrea D'Ariano, Dario Pacciarelli, Marco Pranzo. A branch and bound algorithm for scheduling trains in a railway network[J]. European Journal of Operational Research, 2007,183(2):643-657.
[122]Xavier Delorme, Joaquin Rodriguez, Xavier Gandibleux. Heuristics for railway infrastructure saturation[J]. Electronic Notes in Theoretical Computer Science,2001, 50(1):39-53.
[123]Alex Landex. Methods to estimate railway capacity and passenger delays[D]. DTU,2008.
[124]A. Merel, X. Gandibleux, S. Demassey, R. Lusby. An improved Upper Bound for the Railway Infrastructure Capacity Problem on the Pierrefitte-Gonesse Junction[C]. ROADEF 2009,2009.
[125]Xavier Gandibleux, Pierre Riteau, Xavier Delorme. RECIFE:A MCDSS for Railway Capacity Evaluation[J]. Lecture Notes in Economics and Mathematical Systems,2010, 634:93-103.
[126]Aurelien Merel, Xavier Gandibleux, Sophie Demassey. A Collaborative Combination between Column Generation and Ant"Colony Optimization for Solving Set Packing Problems[C]. MIC 2011:The IX Metaheuristics International Conference,2011.
[127]Christian Liebchen, Romeo Rizzi. Classes of cycle bases[J]. Discrete Applied Mathematics,2007,155(3):337-355.
[128]Steven S. Harrod. A tutorial on fundamental model structures for railway timetable optimization[J]. Surveys in Operations Research and Management Science,2012,17(2): 85-96.
[129]Alex Landex, Anders H. Kass, Bernd Schittenhelm, et al. Evaluation of Railway Capacity[C]. Aalborg University Annual Transport Conference at Aalborg University, Denmark,2006.
[130]Alex Landex. Capacity at Railway Stations[C].9th World Congress on Railway Research, Lille,2011.
[131]张拥军,任民,杜文.高速列车开行方案研究[J].西南交通大学学报,1998,4：400-404.ZHANG Yong-jun, REN Min, DU Wen. Optimization of High Speed Train Operation[J]. Journal of South-East Jiaotong University,1998,4:400-404.
[132]查伟雄,符卓.直通旅客列车开行方案优化方法的研究[J].铁道学报,2000,22(5)：1-5.ZHA Wei-xiong, FU Zhuo. Research on the optimization method of through passenger train plan[J]. Journal of the China Railway Society,2000,22(5):1-5.
[133]史峰,邓连波,黎新华.高速铁路相关旅客列车开行方案研究[J].铁道学报,2004,26(2)：16-20.SHI Feng, DENG Lian-bo, LI Xin-hua, FANG Qi-gen. Research on Passenger Train Plans for Dedicated Passenger Traffic Lines [J]. Journal of the China Railway Society, 2004,26(2):16-20.
[134]史峰,邓连波.旅客换乘网络优化设计[J].铁道科学与工程学报,2004,1(1)：78-82.SHI Feng, DENG Lian-bo. Optimal design of passenger transfer network[J]. JOURNAL OF RAILWAY SCIENCE AND ENGINEERING,2004,1(1):78-82.
[135]何宇强,张好智,毛保华,陈团生.高速铁路旅客列车开行方案的多目标双层规划模型[J].铁道学报,2006,28(5)：6-10.HE Yu-qiang, ZHANG Hao-zhi, MAO Bao-hua, CHEN Tuan-sheng. Multiobjective Bi-level Programming Model of Making Train Working Plan for Passenger-only Line [J]. Journal of the China Railway Society,2006,28(5):6-10.
[136]史峰,邓连波,霍亮.旅客列车开行方案的双层规划模型和方法[J].中国铁道科学,2007,28(3)：110-116.SHI Feng, DENG Lian-bo, Huo Liang. Bi-Level Programming Model and Algorithm of Passenger Train Operation Plan[J]. CHINA RAILWAY SCIENCE,2007,28(3):110-116.
[137]史峰,周文梁,陈彦,邓连波.基于弹性需求的旅客列车开行方案优化研究[J].铁道学报,2008,30(3)：1-6.SHI Feng, ZHOU Wen-liang, CHEN Yan, DENG Lian-bo. Optimization study on Passenger Train Plans with Elastic Demands[J]. Journal of the China Railway Society, 2008,30(3):1-6.
[138]邓连波,史峰,周文梁.旅客列车停站设置方案优化[J].中国铁道科学,2009,30(4)：102-107.DENG Lian-bo, SHI Feng, ZHOU Wen-liang. Stop Schedule Plan Optimization for Passenger Train[J]. CHINA RAILWAY SCIENCE,2009,30(4):102-107.
[139]彭其渊等.高速铁路运输组织.北京：科学出版社,2007.
[140]汪波,杨浩,牛丰,王保华.周期性列车运行图优化模型与算法研究[J].铁道学报,2007,29(5)：1-6.WANG Bo, YANG Hao, NIU Feng, WANG Bao-hua. Study on Model and Algorithm of Periodic Train Diagram Generation[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(5):1-6.
[141]汪波,杨浩,张志华.基于周期性列车运行图的京津城际铁路列车开行方案研究[J].铁道学报,2007,29(2)：8-13.WANG Bo, YANG Hao, ZHANG Zhi-hua. The Research on the Train Operation Plan of the Beijing-Tianjin Intercity Railway Based on Periodic Train Diagrams[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(2):8-13.
[142]汪波.基于周期化运行的铁路列车开行方案和运行图研究[D].北京：北京交通大学,2008.
[143]谢美全,聂磊.周期性列车运行图优化模型研究[J].铁道学报,2009,31(4)：7-13.XIE Mei-quan, NIE Lei. Model of Cyclic Train Timetable[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2009,31(4):7-13.
[144]周文梁,史峰,陈彦,邓连波.高速铁路网络列车开行方案与运行图综合优化方法[J].铁道学报,2011,33(2)：1-7.ZHOU Wen-liang, SHI Feng, CHEN Yan, DENG Lian-bo. Method of Integrated Optimization of Train Operation Plan and Diagram for Network of Dedicated Passenger Lines[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2011,33(2):1-7.
[145]史峰,谢楚农,于桂芳.铁路车站咽喉区进路排列优化方法[J].铁道学报,2004,26(4)：5-9.SHI Feng, XIE Chu-nong, YU Gui-fang. Optimization Methods for Arranging Train Routes in Station Bottleneck[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY, 2004,26(4):5-9.
[146]刘澜,王南.车站咽喉通过能力网络优化模型及算法研究[J].铁道学报,2002,24(6)：1-5.LIU Lan, WANG Nan. A study of network optimization model and algorithm for carring capacity of station throat[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY, 2002,24(6):1-5.
[147]龙建成,高自友,马建军,李克平.铁路车站进路选择优化模型及求解算法的研究[J].铁道学报,2007,29(5)：7-14.LONG Jian-cheng, GAO Zhi-you, MA Jian-jun, LI Ke-ping. Research on Model and Algorithm of Routing Schedules for Railway Stations[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(5):7-14.
[148]叶怀珍,杨永兰,王彦.铁路旅客列车开行方案问题的探讨[J].西南交通大学学报,2000,35(2)：230-234.YE Huai-zhen, YANG Yong-lan, WANG Yan. The Discussion about the Operation of Long-Short Distance Passenger Trains[J]. JOURNAL OF SOUTHWEST JIAOTONG UNIVERSITY,2000,35(2):230-234.
[149]邓连波,史峰.旅客列车开行方案评价指标体系[J].中国铁道科学,2006,27(3)：106-110.
[150]赵鹏,杨浩.京沪高速铁路列车开行模式的研究[J].北京交通大学学报,2006,30(3)：5-9.ZHAO Peng, YANG Hao. Study on Passenger Train Plans for Jing-Hu High-Speed Railway[J]. JOURNAL OF BEIJING JIAOTONG UNIVERSITY,2006,30(3):5-9.
[151]邓连波.高速铁路相关旅客列车开行方案优化研究[D].中南大学,2007.
[152]李力.高速铁路旅客列车开行方案研究[D].西南交通大学,2010.
[153]张曙光.京沪高速铁路系统优化研究.中国：中国铁道出版社,2009.
[154]江南,史峰,卢红岩,邓连波.铁路旅客乘车方案优化决策模型研究[J].铁道学报,2007,29(3)：13-18.JIANG Nan, SHI Feng, LU Hong-yan, DENG Lian-bo. The Study on Optimization Decision Making Model of Passenger Traveling Plan by Train[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(3):13-18.
[155]兰淑梅,赵映莲,汤奇志.论京沪高速铁路客流及其组织方案[J].中国铁道科学,2002,23(3)：124-129.
[156]周文梁.高速铁路网络列车开行方案与运行图综合优化模型及算法[D].中南大学,2010.
[157]何宇强.高速铁路运输组织理论中若干问题的研究[D].北京交通大学,2006.
[158]左大杰.铁路快速客运网络旅客列车开行方案优化研究[D].西南交通大学,2010.
[159]史峰,陈彦,秦进,周文梁.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学,2009,30(6)：108-113.
[160]吕红霞.铁路大型客运站作业计划智能优化的优化技术和方法研究[D].西南交通大学,2008.
[161]李莹慧.铁路车站进路选择的免疫进化算法研究[D].北京交通大学,2006.
[162]夏明.高速铁路列车运行图网络协同优化优化方法与关键技术研究[D].北京交通大学,2011.
[163]何世伟,宋瑞,戴新鎏,杨永凯,雷中林.路网运输能力及计算方法的研究[J].铁道学报,2003,25(2)：5-9.HE Shi-wei, SONG Rui, DAI Xin-liu, YANG Yong-kai, LEI Zhong-lin. Study on optimal methods for evaluating the carring capacity of railroad network[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2003,25(2):5-9.
[164]杜彦华,刘春煌.层次扩展模糊时间Petri网及车站通过能力评定[J].系统仿真学报,2005,17(增刊)：178-183.DU Yan-hua, LIU Chun-huang. Hierarchical Fuzzy Timing Petri Net and Determining Carrying Capacities of Stations[J]. JOURNAL OF SYSTEM SIMULATION,2005,17: 178-183.
[165]蔡家军.分散自律调度集中CTC车站系统研究与仿真[D].西南交通大学,2010.
[166]秦树增.分散自律调度集中CTC中心研究与仿真[D].西南交通大学,2010.
[167]廖丽军.高速列车运行控制系统仿真[D].北京交通大学,2009.
[168]郭荣.高速铁路无线闭塞中心软件设计与实现[D].北京交通大学,2009.
[169]刘志明.高速铁路综合调度仿真系统关键技术的研究[C].世界轨道交通论坛,2005.
[170]韩弢,杨肇夏,刘军.基于HLA的铁路列车运行仿真系统研究[J].系统仿真技术及其应用,373-377.
[171]鲁工圆.客运专线车站作业仿真系统的研究及应用[D].西南交通大学,2007.
[172]陈建鑫.客运专线车站作业计划协同优化方法研究[D].北京交通大学,2007.
[173]李博.客运专线列车运行仿真研究[D].铁道科学研究院,2007.
[174]金炜东,章优仕,高四维.列车运行调整的优化与仿真[J].2007.
[175]蒋熙.面向铁路行车组织的仿真建模方法研究[D].北京交通大学,2008.
[176]宋瑞,何世伟.智能铁路联控列车群运行模拟模型及仿真研究[J].465-468.
[177]吴雅婧.CTCS-3级列控仿真测试平台——车站列控中心子系统研究[D].北京交通大学,2008.
[178]张维维.CTCS3级列控系统仿真测试平台——车载设备仿真子系统的研究[D].北京交通大学,2006.
[179]蒋红军.CTCS3级列控系统仿真测试平台——车站微机联锁仿真子系统的研究[D].北京交通大学,2007.
[180]蔡畅.CTCS3级列控系统仿真测试平台——车站CTC分机仿真子系统的研究[D].北京交通大学,2008.
[181]崔莹莹.CTCS3级列控系统仿真测试平台——轨旁设备仿真器、列车群模拟器的研究[D].北京交通大学,2007.
[182]孙玉鹏.CTCS3级列控系统仿真测试平台——列车运行仿真平台的研究[D].北京交通大学,2006.
[183]宋沛东.CTCS3级列控系统仿真测试平台——无线闭塞中心仿真子系统的研究[D].北京交通大学,2007.
[184]韩胤.CTCS3级列控系统仿真测试平台——RBC仿真子系统的研究[D].北京交通大学,2006.
[2]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A column-generation approach to line planning in public transport[J]. TRANSPORTATION SCIENCE,2007,41(1): 123-132.
[3]Michael R. Bussieck, Thomas Lindner, Marco E. Lubbecke. A fast algorithm for near cost optimal line plans[J]. Mathematical Methods of Operations Research,2004,59(2): 205-220.
[4]Anita Schobel, Silvia Schwarze. A game-theoretic approach to line planning[C].6th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS 2006),2006.
[5]Yu-Hern Chang, Chung-Hsing Yeh, Ching-Cheng Shen. A multiobjective model for passenger train services planning:application to Taiwan's high-speed rail line [J]. Transportation Research Part B:Methodological,2000,34(2):91-106.
[6]Wen-Jin HSIEH. A passenger's choice model of train service with elastic demand[J]. Journal of the Eastern Asia Society for Transportation Studies,2003,5:252-263.
[7]Katja Boos. Line planning in railway systems[J].
[8]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. Models for Line planning in Public Transport[R]. ZIB,2004.
[9]Jan-Willem Goossens, Stan van Hoesel, Leo Kroon. On solving multi-type railway line planning problems [J]. European Journal of Operational Research,2006,168(2):403-424.
[10]Marc E. Pfetsch, Ralf Borndorfer. Routing in Line Planning for Public Transport[J]. Operations Research Proceedings,2006,2005:405-410.
[11]Michael R. Bussieck. Optimal lines in public rail transport[D].1998.
[12]Michael R. Bussieck, Peter Kreuzer, Uwe T. Zimmermann. Optimal lines for railway systems[J]. European Journal of Operational Research,1997,96(1):54-63.
[13]Michiel J.C.M. Vromans, Rommert Dekker, Leo G. Kroon. Reliability and heterogeneity of railway services[J]. European Journal of Operational Research,2006,172(2):647-665.
[14]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A path-based model for line planning in public transport[R]. ZIB,2005.
[15]Michiel Vromans. Reliability of railway systems[D].2005.
[16]Dennis Huisman, Leo G. Kroon, Ramon M. Lentink and Michiel J. C. M. Vromans. Operations research in passenger railway transportation[J]. Statistica Neerlandica,2005, 59(4):467-497.
[17]Xuesong Zhou, Ming Zhong. Bicriteria train scheduling for high-speed passenger railroad planning applications[J]. European Journal of Operational Research,2005,167(3): 752-771.
[18]Schobel, Anita; Scholl, Susanne. Line planning with minimal traveling time[C].5th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS 2005),2005.
[19]Hooghiemstra, J.S., Teunisse, M.J.G.The use of simulation in the planning of the dutch railway services[J]. Simulation Conference Proceedings,1998,2:1139-1145.
[20]Mathias Michaelis, Anita Schobel. Integrating line planning, timetabling, and vehicle scheduling:a customer-oriented heuristic[J]. Public Transport,2009,1:211-232.
[21]Anita Schobel. Line planning in public transportation:models and methods[J]. OR Spectrum,2012,34(3):491-510.
[22]M. R. Bussieck, T. Winter, U. T. Zimmermann. Discrete optimization in public rail transport[J]. Mathematical Programming,1997,79(1-3):415-444.
[23]Schobel, Anita; Scholl, Susanne. Line planning with minimal transfers[C],6th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS 2006),2006.
[24]Michael J. Klier, Knut Haase. Line Optimization in Public Transport Systems[J]. Operations Research Proceedings,2008,2007:473-478.
[25]A. Abbas-Turki, R. Bouyekhf, O. Grunder, A. El Moudni. On the line planning problems of the hub public-transportation networks[J]. International Journal of Systems Science, 2004,35(12):693-706.
[26]Thomas Lindner. Train schedule optimization in public rail transport[D].2000.
[27]Leon Willem Petrus Peeters. Cyclic railway timetable optimization[D].2003.
[28]U. Brannlund, P. O. Lindberg, A. Nou and J.-E. Nilsson. Railway Timetabling Using Lagrangian Relaxation[J]. Transportation Science,1998,32(4):358-369.
[29]Alberto Caprara, Matteo Fischetti and Paolo Toth. Modeling and Solving the Train Timetabling Problem[J]. Operations Research,2002,50(5):851-861.
[30]Carlo Mannino, Alessandro Mascis. Optimal Real-Time Traffic Control in Metro Stations[J]. Operations Research,2009,57(4):1026-1039.
[31]Steven Harrod. Modeling Network Transition Constraints with Hypergraphs[J]. Transportation Science,2011,45(1):81-97.
[32]Leo G. Kroon and Leon W. P. Peeters. A variable trip time model for cyclic railway timetabling[J]. Transportation Science,2003,37(2):198-212.
[33]Christian Liebchen. The First Optimized Railway Timetable in Practice[J]. Transportation Science,2008,42(4):420-435.
[34]Leo G. Kroon, Rommert Dekker and Michiel J.C.M. Vromans. Cyclic Railway Timetabling:a Stochastic Optimization Approach[R]. ERIM,2005.
[35]Rob M.P. Goverde. Railway timetable stability analysis using max-plus system theory[J]. Transportation Research Part B:Methodological,2007,41(2):179-201.
[36]Michiel Adriaan Odijk. Railway timetable generation[D].1997.
[37]Matteo Fischetti, Domenico Salvagnin and Arrigo Zanette. Fast approaches to improve the robustness of a railway timetable[J]. Transportation Science,2009,43(3):321-335.
[38]Leon Peeters, Leo Kroon. A cycle based optimization model for the cyclic railway timetabling problem[J]. Lecture Notes in Economics and Mathematical Systems,2001, 505:275-296.
[39]Gabrio Caimi, Martin Fuchsberger, Marco Laumanns, and Kaspar Schupbach. Periodic railway timetabling with event flexibility [J]. Networks,2010,57(1):3-18.
[40]Christian Liebchen and Leon Peeters. On cyclic timetabling and cycles in graphs[R]. TUB,2002.
[41]Leo Kroon, Gabor Maroti, Mathijn Retel Helmrich, Michiel Vromans, Rommert Dekker. Stochastic improvement of cyclic railway timetables[J]. Transportation Research Part B: Methodological,2008,42(6):553-570.
[42]Fischetti, Matteo; Zanette, Arrigo; Salvagnin, Domenico. Fast Approaches to Robust Railway Timetabling[C].7th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2007),2007.
[43]Rob M.P. Goverde. Improving punctuality and transfer reliability by railway timetable optimization[D]. Delft,1999.
[44]L. Ingolotti, A. Lova, F. Barber, P. Tormos, M. A. Salido, M. Abril. New heuristics to solve the "CSOP" railway timetabling problem[J]. Lecture Notes in Computer Science, 2006,4031:400-409.
[45]Rob M.P. Goverde. Punctuality of railway operations and timetable stability analysis[D]. Delft,2005.
[46]M.A. Salido, F. Barber, L. Ingolotti. Robustness in railway transportation scheduling[C]. Proceedings of the 7th World Congress on Intelligent Control and Automation,2008.
[47]Christian Liebchen. A cut-based heuristic to produce almost feasible periodic railway timetables[J]. Lecture Notes in Computer Science,2005,3503:354-366.
[48]Kroon, L.G.; Huisman, D.; Maroti, G.. Railway timetabling from an operations research[R]. EUR,2007.
[49]M. Abril, F. Barber, L. Ingolotti, M.A. Salido, P. Tormos, A. Lova. An assessment of railway capacity[J]. Transportation Research Part E:Logistics and Transportation Review, 2008,44(5):774-806.
[50]Christian Liebchen, Rolf H. Mohring. The modeling power of the periodic event scheduling problem:railway timetables-and beyond[R]. TUB,2004.
[51]P. Vansteenwegen, D. Van Oudheusden. Developing railway timetables which guarantee a better service[J]. European Journal of Operational Research,2006,173(1):337-350.
[52]Christian Liebchen, Michael Schachtebeck, Anita Schobel, Sebastian Stiller, Andre Prigge. Computing delay resistant railway timetables[R]. TUB,2007.
[53]Leo Kroon, Dennis Huisman, Erwin Abbink, Pieter-Jan Fioole, Matteo Fischetti, Gabor Maroti, Alexander Schrijver, Adri Steenbeek and Roelof Ybema. The new Dutch timetable:The OR revolution[J]. Interfaces,2009,39(1):6-17.
[54]Christian Liebchen, Leon Peeters. Integral cycle bases for cyclic timetabling[J]. Discrete Optimization,2009,6(1):98-109.
[55]Christian Liebchen, Marco Lubbecke, Rolf Mohring, and Sebastian Stiller. The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications[J]. Lecture Notes in Computer Science,2009,5868:1-27.
[56]Christian Liebchen, Rolf H. Mohring. A case study in periodic timetabling[J]. Electronic Notes in Theoretical Computer Science,2002,66(6):18-31.
[57]Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida. A Lagrangian heuristic algorithm for a real-world train timetabling problem[J]. Discrete Applied Mathematics, 2006,154(5):738-753.
[58]Leon Peeters, Leo Kroon. An Optimization Approach to Railway Timetabling[R].2000.
[59]Anita Schobel. A model for the delay management problem based on mixed-integer-programming[J]. Electronic Notes in Theoretical Computer Science,2001, 50(1):1-10.
[60]R.Borndorfer, T. Schlechte. Models for railway track allocation[C].7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems(ATMOS 2007),2007.
[61]P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, M. A. Salido. A Genetic Algorithm for Railway Scheduling Problems[J]. Metaheuristics for Scheduling in Industrial and Manufacturing ApplicationsStudies in Computational Intelligence,2008,128:255-276.
[62]Gabrio Caimi, Dan Burkolter, Thomas Herrmann, Fabian Chudak, Marco Laumanns. Design of a railway scheduling model for dense services[J]. Networks and Spatial Economics,2009,9(1):25-46.
[63]Christian Liebchen. Symmetry for periodic railway timetables[J]. Electronic Notes in Theoretical Computer Science,2004,92(17):34-51.
[64]Steven Harrod. Capacity factors of a mixed speed railway network[J]. Transportation Research Part E:Logistics and Transportation Review,2009,45(5):830-841.
[65]Leo Kroon. Mathematics for railway timetabling[J]. ERCIM NEWS,2007.
[66]Richard M. Lusby, Jesper Larsen, Matthias Ehrgott, David Ryan. Railway track allocation:models and methods[J]. OR Spectrum,2011,33(4):843-883.
[67]Anita Schobel. Integer programming approaches for solving the delay management problem[J]. Lecture Notes in Computer Science,2007,4359:145-170.
[68]Fischer, Frank; Helmberg, Christoph; Janon, Jogen; Krostitz, Boris. Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation[J].8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems(ATMOS 2008),2008.
[69]Yusin Lee, Chuen-Yih Chen. A heuristic for the train pathing and timetabling problem[J]. Transportation Research Part B:Methodological,2009,43(8-9):837-851.
[70]Lei Nie, Ingo A. Hansen. System analysis of train operations and track occupancy at railway stations[J]. System analysis of train operations and track occupancy at railway stations,2005,5(1):31-54.
[71]Christian Liebchen. Finding short integral cycle bases for cyclic timetabling[R]. TUB, 2003.
[72]Valentina Cacchiani, Alberto Caprara, Paolo Toth. A column generation approach to train timetabling on a corridor[J].4OR,2008,6(2):125-142.
[73]Forsgren, Malin and Aronsson, Martin and Kreuger, Per and Dahlberg, Hans. The Maraca:a tool for minimizing resource conflicts in a non-periodic railway timetable[J]. RailRome 2011, Rome, Italy.
[74]Rob M.P. Goverde. A delay propagation algorithm for large-scale railway traffic networks[J]. Transportation Research Part C:Emerging Technologies,2010,18(3): 269-287.
[75]Julie Jespersen-Groth, Daniel Potthoff, Jens Clausen, Dennis Huisman, Leo Kroon, Gabor Maroti, Morten Nyhave Nielsen. Disruption management in passenger railway transportation[R]. ESE,2007.
[76]Michiel A. Odijk. A constraint generation algorithm for the construction of periodic railway timetables[J]. Transportation Research Part B:Methodological,1996,30(6): 455-464.
[77]Valentina Cacchiani. Models and algorithms for combinatorial optimization problems arising in railway applications[J].2009,7(1):109-112.
[78]B. Adenso-Diaz, M. Oliva Gonzalez, P. Gonzalez-Torre. On-line timetable re-scheduling in regional train services[J]. Transportation Research Part B:Methodological,1999, 33(6):387-398.
[79]Matteo Fischetti, Michele Monaci. Light Robustness[J]. Lecture Notes in Computer Science,2009,5868:61-84.
[80]R.M.P. Goverde, M.A. Odijk. Performance evaluation of network timetables using PETER[C]. Computers in Railways VIII, WIT Press, Southampton,2002.
[81]Christian Liebchen, Mark Proksch, Frank H. Wagner. Performance of algorithms for periodic timetable optimization[J]. Lecture Notes in Economics and Mathematical Systems,2008,600:151-180.
[82]Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren. Generation of classes of robust periodic railway timetables[J]. Computers & Operations Research,2006,33(8): 2283-2299.
[83]Ingo A. Hansen. Railway network timetabling and dynamic traffic management[C].2nd International Conference on Recent Advances in Railway Engineering(ICRARE-2009), Iran university of science and Technology, Tehran, I.R. Iran,2009.
[84]Caprara, A.; Fischetti, M.; Guida, P.L.; Monaci, M.; Sacco, G.; Toth, P.. Solution of real-world train timetabling problems[C]. Proceedings of the 34th Annual Hawaii International Conference on System Sciences,2001.
[85]Ralf Borndorfer, Thomas Schlechte, Steffen Weider. Railway track allocation by rapid branching[R]. ZIB,2010.
[86]Alex Landex, Anders H. Kaas, Bernd Schittenhelm, Jan Schneider-Tilli. Evaluation of railway capacity[R].2006.
[87]Dan BURKOLTER, Thomas HERRMANN, Gabrio CAIMI. GENERATING DENSE RAILWAY SCHEDULES[C]. Advanced OR and AI Methods in Transportation,2005.
[88]Xavier DELORME, Xavier GANDIBLEUX, Joaquin RODRIGUEZ. Stability evaluation of a railway timetable at station level[J]. European Journal of Operational Research, 2009,195(3):780-790.
[89]Dick Middelkoop, Michiel Bouwman. SIMONE:LARGE SCALE TRAIN NETWORK SIMULATIONS[C]. Proceedings of the 2001 Winter Simulation Conference,2001.
[90]Annabell Berger, Andreas Gebhardt, Matthias Muller-Hannemann, and Martin Ostrowski. Stochastic delay prediction in large train networks[C].11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS 2011), 2011.
[91]Christian Liebchen, Sebastian Stiller. Delay Resistant Timetabling[R]. TUB,2006.
[92]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, and Alfredo Navarra. Delay Management Problem:Complexity Results and Robust Algorithms[J]. Lecture Notes in Computer Science,2008,5165:458-468.
[93]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, and Alfredo Navarra. On the Interaction between Robust Timetable Planning and Delay Management[R]. ARRIVAL,2007.
[94]Christian Liebchen, Marco Lubbecke, Rolf H. Mohring, Sebastian Stiller. Recoverable Robustness[R]. ARRIVAL,2007.
[95]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra. Recoverable robust timetabling for single delay:Complexity and polynomial algorithms for special cases[J]. Journal of Combinatorial Optimization,2009,18(3): 229-257.
[96]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, and Cristina M. Pinotti. Recoverable Robust Timetables:an Algorithmic Approach on Trees[J]. IEEE Transactions on Computers,2011,60(3):433-446.
[97]Peter J. Zwaneveld, Leo G. Kroon, H. Edwin Romeijn and Marc Salomon, Stephane Dauzere-Peres, Stan P.M. van Hoesel, Harrie W. Ambergen. Routing Trains through Railway Stations:Model Formulation and Algorithms[J]. Transportation Science,1996, 30(3):181-194.
[98]Leo G. Kroon, H. Edwin Romeijn, Peter J. Zwaneveld. Routing trains through railway stations:complexity issues[J]. European Journal of Operational Research,1997,98(3): 485-498.
[99]Peter J. Zwaneveld, Leo G. Kroon, Stan P.M. van Hoesel. Routing trains through a railway station based on a node packing model[J]. European Journal of Operational Research,2001,128(1):14-33.
[100]Malachy Carey, Sinead Carville. Scheduling and platforming trains at busy complex stations[J]. Transportation Research Part A,2003,37:195-224.
[101]Xavier DELORME, Xavier GANDIBLEUX, Joaquin RODRIGUEZ. GRASP for set packing problems[J]. European Journal of Operational Research,2004,153(3):564-580.
[102]Rafael Velasque, M Ehrgott, D Ryan, A Schobel. A Set-packing Approach to Routing Trains Through Railway Stations[C]. Proceedings of the 40th Annual Conference of Operational Research Society of New Zealand,2005.
[103]Gabrio Caimi, Dan Burkolter, and Thomas Herrmann. Finding delay-tolerant train routing through stations[J]. Operations Research Proceedings,2005,2004(5):136-143.
[104]Malachy Carey, Ivan Crawford. Scheduling trains on a network of busy complex stations[J]. Transportation Research Part B,2007,41:159-178.
[105]Martin Fuchsberger. Solving the train scheduling problem in a main station via a resource constrained space-time integer multi-commodity flow[D]. Institute for Operations Research, ETH Zurich,2006.
[106]THOMAS MICHAEL HERRMANN. Stability of timetables and train routings through station regions[D]. SWISS FEDERAL INSTITUTE OF TECHNOLOGY, ZURICH, 2006.
[107]Peter J. Zwaneveld. Railway Planning:routing of trains and allocation of passenger lines[D]. Erasmus Universiteit Rotterdam,1997.
[108]Joaquin Rodriguez. A constraint programming model for real-time train scheduling at junctions[C]. Proceedings of RailDelft2005:the 1st International Seminar on Railway Operations Modelling and Analysis, Delft, The Netherlands,2005.
[109]Xavier Gandibleux, Julien Jorge, S'ebastien Angibaud, Xavier Delorme, Joaquin Rodriguez. An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure[C]. Proceedings of MIC2005:The Sixth Metaheuristics International Conference, Vienna, Austria,2005.
[110]Andreas Ginkel and Anita Schobel. To wait or not to wait? The bicriteria delay management problem in public transportation[J]. Transportation Science,2007,41(4): 527-538.
[111]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti. Recoverable robust timetables on trees[J]. Lecture Notes in Computer Science,2009, 5573:451-462.
[112]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schobel. Recoverable robustness in shunting and timetabling[J]. Lecture Notes in Computer Science,2009,5868:28-60.
[113]S. Cicerone, G. Di Stefano, M. Schachtebeck, and A. Sch"obel. Dynamic algorithms for recoverable robustness problems[C].8th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS 2008),2008.
[114]Christian Liebchen, Marco Liibbecke, Rolf Mohring, Sebastian Stiller. The concept of recoverable robustness, linear programming recovery, and railway applications[J]. Lecture Notes in Computer Science,2009,5868:1-27.
[115]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra. Recoverable-robust timetables for trains on single-line corridors[R]. ARRIVAL,2009.
[116]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra. Evaluation of recoverable-robust timetables on tree networks[J]. Lecture Notes in Computer Science, 2009,5874:24-35.
[117]Goerigk, Marc; Schobel, Anita. An empirical analysis of robustness concepts for timetabling[C].10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems(ATMOS 2010),2010.
[118]Valentina Cacchiani, Paolo Toth. Nominal and robust train timetabling problems[J]. European Journal of Operational Research,2012,219(3):727-737.
[119]Jean-Francois Cordeau, Paolo Toth and Daniele Vigo. A survey of optimization models for train routing and scheduling[J]. Transportation Science,1998,32(4):380-404.
[120]Lusby, Richard; Larsen, Jesper; Ryan, David; Ehrgott, Matthias. Routing trains through railway junctions:A new set packing approach[R]. IMM,2006.
[121]Andrea D'Ariano, Dario Pacciarelli, Marco Pranzo. A branch and bound algorithm for scheduling trains in a railway network[J]. European Journal of Operational Research, 2007,183(2):643-657.
[122]Xavier Delorme, Joaquin Rodriguez, Xavier Gandibleux. Heuristics for railway infrastructure saturation[J]. Electronic Notes in Theoretical Computer Science,2001, 50(1):39-53.
[123]Alex Landex. Methods to estimate railway capacity and passenger delays[D]. DTU,2008.
[124]A. Merel, X. Gandibleux, S. Demassey, R. Lusby. An improved Upper Bound for the Railway Infrastructure Capacity Problem on the Pierrefitte-Gonesse Junction[C]. ROADEF 2009,2009.
[125]Xavier Gandibleux, Pierre Riteau, Xavier Delorme. RECIFE:A MCDSS for Railway Capacity Evaluation[J]. Lecture Notes in Economics and Mathematical Systems,2010, 634:93-103.
[126]Aurelien Merel, Xavier Gandibleux, Sophie Demassey. A Collaborative Combination between Column Generation and Ant"Colony Optimization for Solving Set Packing Problems[C]. MIC 2011:The IX Metaheuristics International Conference,2011.
[127]Christian Liebchen, Romeo Rizzi. Classes of cycle bases[J]. Discrete Applied Mathematics,2007,155(3):337-355.
[128]Steven S. Harrod. A tutorial on fundamental model structures for railway timetable optimization[J]. Surveys in Operations Research and Management Science,2012,17(2): 85-96.
[129]Alex Landex, Anders H. Kass, Bernd Schittenhelm, et al. Evaluation of Railway Capacity[C]. Aalborg University Annual Transport Conference at Aalborg University, Denmark,2006.
[130]Alex Landex. Capacity at Railway Stations[C].9th World Congress on Railway Research, Lille,2011.
[131]张拥军,任民,杜文.高速列车开行方案研究[J].西南交通大学学报,1998,4：400-404.ZHANG Yong-jun, REN Min, DU Wen. Optimization of High Speed Train Operation[J]. Journal of South-East Jiaotong University,1998,4:400-404.
[132]查伟雄,符卓.直通旅客列车开行方案优化方法的研究[J].铁道学报,2000,22(5)：1-5.ZHA Wei-xiong, FU Zhuo. Research on the optimization method of through passenger train plan[J]. Journal of the China Railway Society,2000,22(5):1-5.
[133]史峰,邓连波,黎新华.高速铁路相关旅客列车开行方案研究[J].铁道学报,2004,26(2)：16-20.SHI Feng, DENG Lian-bo, LI Xin-hua, FANG Qi-gen. Research on Passenger Train Plans for Dedicated Passenger Traffic Lines [J]. Journal of the China Railway Society, 2004,26(2):16-20.
[134]史峰,邓连波.旅客换乘网络优化设计[J].铁道科学与工程学报,2004,1(1)：78-82.SHI Feng, DENG Lian-bo. Optimal design of passenger transfer network[J]. JOURNAL OF RAILWAY SCIENCE AND ENGINEERING,2004,1(1):78-82.
[135]何宇强,张好智,毛保华,陈团生.高速铁路旅客列车开行方案的多目标双层规划模型[J].铁道学报,2006,28(5)：6-10.HE Yu-qiang, ZHANG Hao-zhi, MAO Bao-hua, CHEN Tuan-sheng. Multiobjective Bi-level Programming Model of Making Train Working Plan for Passenger-only Line [J]. Journal of the China Railway Society,2006,28(5):6-10.
[136]史峰,邓连波,霍亮.旅客列车开行方案的双层规划模型和方法[J].中国铁道科学,2007,28(3)：110-116.SHI Feng, DENG Lian-bo, Huo Liang. Bi-Level Programming Model and Algorithm of Passenger Train Operation Plan[J]. CHINA RAILWAY SCIENCE,2007,28(3):110-116.
[137]史峰,周文梁,陈彦,邓连波.基于弹性需求的旅客列车开行方案优化研究[J].铁道学报,2008,30(3)：1-6.SHI Feng, ZHOU Wen-liang, CHEN Yan, DENG Lian-bo. Optimization study on Passenger Train Plans with Elastic Demands[J]. Journal of the China Railway Society, 2008,30(3):1-6.
[138]邓连波,史峰,周文梁.旅客列车停站设置方案优化[J].中国铁道科学,2009,30(4)：102-107.DENG Lian-bo, SHI Feng, ZHOU Wen-liang. Stop Schedule Plan Optimization for Passenger Train[J]. CHINA RAILWAY SCIENCE,2009,30(4):102-107.
[139]彭其渊等.高速铁路运输组织.北京：科学出版社,2007.
[140]汪波,杨浩,牛丰,王保华.周期性列车运行图优化模型与算法研究[J].铁道学报,2007,29(5)：1-6.WANG Bo, YANG Hao, NIU Feng, WANG Bao-hua. Study on Model and Algorithm of Periodic Train Diagram Generation[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(5):1-6.
[141]汪波,杨浩,张志华.基于周期性列车运行图的京津城际铁路列车开行方案研究[J].铁道学报,2007,29(2)：8-13.WANG Bo, YANG Hao, ZHANG Zhi-hua. The Research on the Train Operation Plan of the Beijing-Tianjin Intercity Railway Based on Periodic Train Diagrams[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(2):8-13.
[142]汪波.基于周期化运行的铁路列车开行方案和运行图研究[D].北京：北京交通大学,2008.
[143]谢美全,聂磊.周期性列车运行图优化模型研究[J].铁道学报,2009,31(4)：7-13.XIE Mei-quan, NIE Lei. Model of Cyclic Train Timetable[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2009,31(4):7-13.
[144]周文梁,史峰,陈彦,邓连波.高速铁路网络列车开行方案与运行图综合优化方法[J].铁道学报,2011,33(2)：1-7.ZHOU Wen-liang, SHI Feng, CHEN Yan, DENG Lian-bo. Method of Integrated Optimization of Train Operation Plan and Diagram for Network of Dedicated Passenger Lines[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2011,33(2):1-7.
[145]史峰,谢楚农,于桂芳.铁路车站咽喉区进路排列优化方法[J].铁道学报,2004,26(4)：5-9.SHI Feng, XIE Chu-nong, YU Gui-fang. Optimization Methods for Arranging Train Routes in Station Bottleneck[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY, 2004,26(4):5-9.
[146]刘澜,王南.车站咽喉通过能力网络优化模型及算法研究[J].铁道学报,2002,24(6)：1-5.LIU Lan, WANG Nan. A study of network optimization model and algorithm for carring capacity of station throat[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY, 2002,24(6):1-5.
[147]龙建成,高自友,马建军,李克平.铁路车站进路选择优化模型及求解算法的研究[J].铁道学报,2007,29(5)：7-14.LONG Jian-cheng, GAO Zhi-you, MA Jian-jun, LI Ke-ping. Research on Model and Algorithm of Routing Schedules for Railway Stations[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(5):7-14.
[148]叶怀珍,杨永兰,王彦.铁路旅客列车开行方案问题的探讨[J].西南交通大学学报,2000,35(2)：230-234.YE Huai-zhen, YANG Yong-lan, WANG Yan. The Discussion about the Operation of Long-Short Distance Passenger Trains[J]. JOURNAL OF SOUTHWEST JIAOTONG UNIVERSITY,2000,35(2):230-234.
[149]邓连波,史峰.旅客列车开行方案评价指标体系[J].中国铁道科学,2006,27(3)：106-110.
[150]赵鹏,杨浩.京沪高速铁路列车开行模式的研究[J].北京交通大学学报,2006,30(3)：5-9.ZHAO Peng, YANG Hao. Study on Passenger Train Plans for Jing-Hu High-Speed Railway[J]. JOURNAL OF BEIJING JIAOTONG UNIVERSITY,2006,30(3):5-9.
[151]邓连波.高速铁路相关旅客列车开行方案优化研究[D].中南大学,2007.
[152]李力.高速铁路旅客列车开行方案研究[D].西南交通大学,2010.
[153]张曙光.京沪高速铁路系统优化研究.中国：中国铁道出版社,2009.
[154]江南,史峰,卢红岩,邓连波.铁路旅客乘车方案优化决策模型研究[J].铁道学报,2007,29(3)：13-18.JIANG Nan, SHI Feng, LU Hong-yan, DENG Lian-bo. The Study on Optimization Decision Making Model of Passenger Traveling Plan by Train[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2007,29(3):13-18.
[155]兰淑梅,赵映莲,汤奇志.论京沪高速铁路客流及其组织方案[J].中国铁道科学,2002,23(3)：124-129.
[156]周文梁.高速铁路网络列车开行方案与运行图综合优化模型及算法[D].中南大学,2010.
[157]何宇强.高速铁路运输组织理论中若干问题的研究[D].北京交通大学,2006.
[158]左大杰.铁路快速客运网络旅客列车开行方案优化研究[D].西南交通大学,2010.
[159]史峰,陈彦,秦进,周文梁.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学,2009,30(6)：108-113.
[160]吕红霞.铁路大型客运站作业计划智能优化的优化技术和方法研究[D].西南交通大学,2008.
[161]李莹慧.铁路车站进路选择的免疫进化算法研究[D].北京交通大学,2006.
[162]夏明.高速铁路列车运行图网络协同优化优化方法与关键技术研究[D].北京交通大学,2011.
[163]何世伟,宋瑞,戴新鎏,杨永凯,雷中林.路网运输能力及计算方法的研究[J].铁道学报,2003,25(2)：5-9.HE Shi-wei, SONG Rui, DAI Xin-liu, YANG Yong-kai, LEI Zhong-lin. Study on optimal methods for evaluating the carring capacity of railroad network[J]. JOURNAL OF THE CHINA RAILWAY SOCIETY,2003,25(2):5-9.
[164]杜彦华,刘春煌.层次扩展模糊时间Petri网及车站通过能力评定[J].系统仿真学报,2005,17(增刊)：178-183.DU Yan-hua, LIU Chun-huang. Hierarchical Fuzzy Timing Petri Net and Determining Carrying Capacities of Stations[J]. JOURNAL OF SYSTEM SIMULATION,2005,17: 178-183.
[165]蔡家军.分散自律调度集中CTC车站系统研究与仿真[D].西南交通大学,2010.
[166]秦树增.分散自律调度集中CTC中心研究与仿真[D].西南交通大学,2010.
[167]廖丽军.高速列车运行控制系统仿真[D].北京交通大学,2009.
[168]郭荣.高速铁路无线闭塞中心软件设计与实现[D].北京交通大学,2009.
[169]刘志明.高速铁路综合调度仿真系统关键技术的研究[C].世界轨道交通论坛,2005.
[170]韩弢,杨肇夏,刘军.基于HLA的铁路列车运行仿真系统研究[J].系统仿真技术及其应用,373-377.
[171]鲁工圆.客运专线车站作业仿真系统的研究及应用[D].西南交通大学,2007.
[172]陈建鑫.客运专线车站作业计划协同优化方法研究[D].北京交通大学,2007.
[173]李博.客运专线列车运行仿真研究[D].铁道科学研究院,2007.
[174]金炜东,章优仕,高四维.列车运行调整的优化与仿真[J].2007.
[175]蒋熙.面向铁路行车组织的仿真建模方法研究[D].北京交通大学,2008.
[176]宋瑞,何世伟.智能铁路联控列车群运行模拟模型及仿真研究[J].465-468.
[177]吴雅婧.CTCS-3级列控仿真测试平台——车站列控中心子系统研究[D].北京交通大学,2008.
[178]张维维.CTCS3级列控系统仿真测试平台——车载设备仿真子系统的研究[D].北京交通大学,2006.
[179]蒋红军.CTCS3级列控系统仿真测试平台——车站微机联锁仿真子系统的研究[D].北京交通大学,2007.
[180]蔡畅.CTCS3级列控系统仿真测试平台——车站CTC分机仿真子系统的研究[D].北京交通大学,2008.
[181]崔莹莹.CTCS3级列控系统仿真测试平台——轨旁设备仿真器、列车群模拟器的研究[D].北京交通大学,2007.
[182]孙玉鹏.CTCS3级列控系统仿真测试平台——列车运行仿真平台的研究[D].北京交通大学,2006.
[183]宋沛东.CTCS3级列控系统仿真测试平台——无线闭塞中心仿真子系统的研究[D].北京交通大学,2007.
[184]韩胤.CTCS3级列控系统仿真测试平台——RBC仿真子系统的研究[D].北京交通大学,2006.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |