Optimization of the Synergies Between Preparation of High-Speed Railway Train Running Diagram and Station Route Allocation Plan

Open access


Introduction. Station route allocation plan is an important extension of the train running diagram and the both are closely intertwined so the overall research on the synergetic preparation method is more beneficial in improving the preparation quality of the train running diagram and providing better service for passengers. Therefore, the research topic has practical significance.

Methodology. Based on extensive literatures, this paper studies the synergetic preparation method of train running diagram and station route allocation plan in detail and analyses their association for providing a theoretical basis for the synergetic preparation method.

Results. This work introduces the synergetic, analyses the systematic characteristics of the operation organization system of high speed railway and puts forward the optimization strategy of train running diagram and station route allocation plan.

Conclusions. The work provides the solution for the preparation of the train running diagram and station route allocation plan by solving the examples based on the relevant optimization factors, such as train running in districts and train arrangement.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1]. Szpigel B. ―Optimal train scheduling on a single-track railway‖ [J]. Operational Research. 1973: 343-352

  • [2]. Frank O. Two-way traffic on a single line of railway [J]. Operations Research. 1965 (14):801-811

  • [3]. Petersen E.R. Taylor A.J. Design of a single-track rail line for high speed trains [J]. Transportation Research Part A. 198721(1):47-57

  • [4]. Smith M.E. Keeping trains on schedule: On-line planning systems for the advanced railroad electronics system (ARES) [J]. Journal of the Transportation Research Forum. 1990 (31):17-24

  • [5]. River R.E. Tzierepoulos P. Interactive graphics models for railway operational planning [J]. The Practice of Transportation Planning. 1985:245-259

  • [6]. Rivier R.E. Tzieropoulos P. Computer-aided planning of railway networks lines and stations [J]. Computers in Railway Management. 1987:3-16

  • [7]. Chxirchod A. Emerry D. Computer-aided planning for major railway stations [J]. Computers in Railway Installations Track and Signaling. 1987:3-19

  • [8]. Jovanovic D. Haricer P.T. Tactical scheduling of rail operations: the SCANI system [J]. Transportation Science. 199125(l):46-64

  • [9]. Carey M. Lockwood D. A model algorithms and strategy for train pathing [J]. Journal of the Operational Research Society. 1995 (46): 988-1005

  • [10]. Carey M. Carville S. Scheduling and platforming trains at busy complex stations [J]. Transportation Research Part A. 200337(3): 195-224

  • [11]. Higgins A. Kozan E. Ferreira L. Optimal scheduling of trains on a single line track [J]. Transportation Research Part B.1996 30B (2): 147-161

  • [12]. Zhou X. Zhong M. Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds [J]. Transportation Research Part B. 200741(3):320-341

  • [13]. Petersen E.R. Taylor A.J. Martland C.D. An introduction to computer-assisted train dispatch [J] Journal of Advanced Transportation. 1986 20(1): 63-72

  • [14]. Brannlund U. Lindberg P.O. Nou A.Nilsson J. E.. Railway timetabling using Lagrangian relaxation [J] Transportation Science. 199832(4): 358-69

  • [15]. Nou A. Railway timetabling-lagrangian heuristics. Technical report TRITA/MAT-97-OS12 [R].Royal Institute of Technology Stockholm Sweden. 1997

  • [l6]. Caprara. A. Fischetti M. Toth. Modeling and solving the train timetabling problem [J]. Operations Research. 200250(5):851-861

  • [17]. Caprara A. Monacix P. Guida. P.L.. A lagrangian heuristic algorithm for a real-world train timetabling problem [J].Discrete Applied Mathematics. 2006154(5):738-753

  • [18]. Valentina V. Caprara A. TothP.. Scheduling extra freight trains on railway networks [J]. Transportation Research Part B. 201044(2):215-231

  • [19]. KraayD. Harker P.T.ChenB - Optimal pacing of trains in freight railroads: model formulation and solution [J]. Operations Research. 199139(l):82-99

  • [20]. Zhou X. ZhongM.. Bi-criteria train scheduling for high-speed passenger railroad planning applications [J]. European Journal of Operational Research.2005167(3):752-771

  • [21]. Serafini R Kovich W.U.. A mathematical model for periodic event scheduling problems [J].SIAM Journal on Discrete Mathematics. 19892(4):550-581

  • [22]. Odijk M.A.. A constraint generation algorithm for the construction of the construction of periodic railway timetable [J]. Transportation Research Part B. 1996 30(6):455-464

  • [23]. Odijk MA.. Railway timetable generation [D].Ph.D. Dissertation. Delft University of Technology. 1997

  • [24]. GoverdeR.M.P.. Improving punctuality and transfer reliability by railway timetable optimization [R].In Proceedings of the 5 TRAIL Congress. Delft University Press. 1999

  • [25]. LindnerT.. Train schedule optimization in public rail transport [D]. Ph.D. Dissertation. University Braunschweig. 2000

  • [26]. LiebchenC. MohringR.H.. A case study in periodic timetabling [J] Electronic Notes in Theoretical Computer Science. 200266(6): 1-14

  • [27]. LiebchenC..Symmetry for periodic railway timetables [J]. Electronic Notes in Theoretical Computer Science. 200492(17):34-51

  • [28]. PeetersL.. Cyclic railway timetable optimization [D]. Ph.D.Dissertation. Erasmus University Rotterdam. 2003

  • [29]. WongR.C.W. LeungJ.M.Y.. Timetable synchronization for mass transit railway [R]. In Proceedings of the 9th International Conference on Computer-Aided Scheduling of Public Transport. San Diego. CA USA 2008

  • [30]. Wong R.C.W. Yuen T.W.Y. Fung K.W. Leung Optimizing timetable synchronization for rail mass transit [J]. Transportation Science. 200842(1):57-69

  • [31]. Carey M. Carville S.. Scheduling and platforming trains at busy complex stations [J]. Transportation Research Part A. 2003(3): 194-224

  • [32]. De Luca Cardillo D. Mione N.. K L-list τ colouring of graphs [J]. European Journal of Operational Research. 1998(106): 160-164

  • [33]. Billionnet A.. Using integer programming to solve the train-platforming problem [J] Transportation Science. 200337(2):213-222

  • [34]. Zwaneveld P.. Kroon L.G Romeijn H.E. et al. Routing trains through railway stations: Model formulation and algorithms [J]. Transportation Science. 199630(3): 181-194

  • [35]. QING Xue-jiang MA Guo-zhong. Application of Genetic Algorithm in Receiving-Departure Tracks in District Stations [J] Journal of Southwest Jiaotong University. 199833(4): 387-393 (in Chinese)

  • [36]. LI Wen-quan WANG Wei CHENG Shi-hui. Ranking Model and Algorithm for Receiving-Departure Tracks in Marshaling Stations of Railway [J]. Systems Engineering — Theory & Practice.200020(6):75-78 (in Chinese)

  • [37]. LV Hong-xia NI Shao-quan JI Hong-ye. Supporting System for Dispatching Decision-making Technical Station — Rational Utilization of Receiving-Departure Tracks in Technical Station [J]. Journal of Southwest Jiaotong University. 200035(3):255-258 (in Chinese)

  • [38]. WANG Zheng-bin DU Wen. Adjustment Model and Algorithm for Receiving-Departure Tracks in Technical Station [J].Journal of Southwest Jiaotong University. 200641(2): 202-205 (in Chinese)

  • [39]. CUI Bing-mou MA Diao-pei ZHANG Pu. Optimization Algorithm for Dispatching of Route in Marshaling Station [J].China Railway Science. 200729(3): HXM04 (in Chinese)

  • [40] LIU Lan WANG Nan DU Wen. Network Optimization: Models & Algorithms for Carrying Capacity of Station Throat [J]. Journal of the China Railway Society. 200224(6) 1-5 (in Chinese)

  • [41]. CareyM.. Extending a train pathing model from one-way to two-way track [J] Transportation Research Part B. 199428(5):395-400

  • [42]. Carey M. Crawford. Scheduling trains on a networic of busy complex stations [J].Transportation Research Part B. 200741(2): 159-178

  • [43]. Jovanovic D. Harker P.T.. Tactical scheduling of rail operations: the SCAN I system [J] Transportation Science. 199125(1):46-64

  • [44]. Zhou Leishan Hu Siji. Network Hierarchy Parallel Algorithmof Automatic Train Scheduling [J]. Journalofthe China Railway Society.199820(3):15-21

  • [45]. PENG Qi-yuan WANG Pei. Mathematical Model and Algorithm for Train Diagram in Railway Network [J].Journal of the China Railway Society.2001 23(1):1-8 (in Chinese)

  • [46]. CHEN Jian-xin. Methods for Synergetic Optimization of Station Operation Plan in Passenger Dedicated Line [M]. Master Dissertation.Beijing Jiaotong University. 2007 (in Chinese)

  • [47]. MAO Bao-hua WANG Bao-shan. XU Bin. Methods for Integrated Preparation of Train Operation Plan in Railways in China [J].Journal of Transportation Systems Engineering and Information Technology. 2009(2):1-7 (in Chinese)

  • [48]. Yusin Lee Chuen-Yih Chen. A heuristic for the train pathing and timetabling problem [J]. Transportation Research Part B. 200943(8-9):837-851

  • [49] MIAO Jian-rui. Methods for Preparation of Train Running Diagram in High Speed Railway [D].Doctor Dissertation.Beijing Jiaotong University. 2010 (in Chinese)

  • [50] SUN Yan LI Zhi-zhong LI Fengliang. Methods for Optimizing Initial Distribution of Train Running Diagram [J].Journal of Changsha Railway University. 1997(4): 80-87 (in Chinese)

  • [51] LIU Ai-jiang XU Chang-feng HE Da-ke. Paired Model for Initial Distribution of Train Running Diagram based on Genetic Algorithm [J] Railway Computer Application. 200312(1): 13-15 (in Chinese)

  • [52] MA Jian-jun. Preparation Theory of Train Running Diagram in Beijing-Shanghai High Speed Railway based on Railway Network [D]. Doctor Dissertation.Beijing Jiaotong University. 2002 (in Chinese)

  • [53] Yusin Lee Chuen-Yih Chen. A heuristic for the train pathing and timetabling problem [J]. Transportation Research Part B. 200943(8-9):837-851

Journal information
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 245 171 2
PDF Downloads 221 156 2