Otwarty dostęp

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


Zacytuj

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

[2]. Frank, O., Two-way traffic on a single line of railway [J]. Operations Research. 1965, (14):801-81110.1287/opre.14.5.801Search in Google Scholar

[3]. Petersen, E.R., Taylor, A.J., Design of a single-track rail line for high speed trains [J]. Transportation Research Part A. 1987,21(1):47-5710.1016/0191-2607(87)90023-9Search in Google Scholar

[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-24Search in Google Scholar

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

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

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

[8]. Jovanovic, D., Haricer, P.T. Tactical scheduling of rail operations: the SCANI system [J]. Transportation Science. 1991,25(l):46-6410.1287/trsc.25.1.46Search in Google Scholar

[9]. Carey, M., Lockwood, D. A model, algorithms and strategy for train pathing [J]. Journal of the Operational Research Society. 1995, (46): 988-100510.1057/jors.1995.136Search in Google Scholar

[10]. Carey, M., Carville, S., Scheduling and platforming trains at busy complex stations [J]. Transportation Research Part A. 2003,37(3): 195-22410.1016/S0965-8564(02)00012-5Search in Google Scholar

[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-16110.1016/0191-2615(95)00022-4Search in Google Scholar

[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. 2007,41(3):320-34110.1016/j.trb.2006.05.003Search in Google Scholar

[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-7210.1002/atr.5670200105Search in Google Scholar

[14]. Brannlund, U., Lindberg, P.O., Nou, A.,Nilsson, J. E.. Railway timetabling using Lagrangian relaxation [J], Transportation Science. 1998,32(4): 358-6910.1287/trsc.32.4.358Search in Google Scholar

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

[l6]. Caprara. A., Fischetti, M., Toth., Modeling and solving the train timetabling problem [J]. Operations Research. 2002,50(5):851-86110.1287/opre.50.5.851.362Search in Google Scholar

[17]. Caprara, A., Monacix P., Guida., P.L.. A lagrangian heuristic algorithm for a real-world train timetabling problem [J].Discrete Applied Mathematics. 2006,154(5):738-75310.1016/j.dam.2005.05.026Search in Google Scholar

[18]. Valentina, V., Caprara, A., Toth,P.. Scheduling extra freight trains on railway networks [J]. Transportation Research Part B. 2010,44(2):215-23110.1016/j.trb.2009.07.007Search in Google Scholar

[19]. Kraay,D., Harker, P.T.,Chen,B - Optimal pacing of trains in freight railroads: model formulation and solution [J]. Operations Research. 1991,39(l):82-9910.1287/opre.39.1.82Search in Google Scholar

[20]. Zhou, X., Zhong,M.. Bi-criteria train scheduling for high-speed passenger railroad planning applications [J]. European Journal of Operational Research.2005,167(3):752-77110.1016/j.ejor.2004.07.019Search in Google Scholar

[21]. Serafini, R, Kovich, W.U.. A mathematical model for periodic event scheduling problems [J].SIAM Journal on Discrete Mathematics. 1989,2(4):550-58110.1137/0402049Search in Google Scholar

[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-46410.1016/0191-2615(96)00005-7Search in Google Scholar

[23]. Odijk, M,A.. Railway timetable generation [D].Ph.D. Dissertation. Delft University of Technology. 1997Search in Google Scholar

[24]. Goverde,R.M.P.. Improving punctuality and transfer reliability by railway timetable optimization [R].In Proceedings of the 5 TRAIL Congress. Delft University Press. 1999Search in Google Scholar

[25]. Lindner,T.. Train schedule optimization in public rail transport [D]. Ph.D. Dissertation. University Braunschweig. 2000Search in Google Scholar

[26]. Liebchen,C., Mohring,R.H.. A case study in periodic timetabling [J], Electronic Notes in Theoretical Computer Science. 2002,66(6): 1-1410.1016/S1571-0661(04)80526-7Search in Google Scholar

[27]. Liebchen,C..Symmetry for periodic railway timetables [J]. Electronic Notes in Theoretical Computer Science. 2004,92(17):34-5110.1016/j.entcs.2003.12.021Search in Google Scholar

[28]. Peeters,L.. Cyclic railway timetable optimization [D]. Ph.D.Dissertation. Erasmus University Rotterdam. 2003Search in Google Scholar

[29]. Wong,R.C.W., Leung,J.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, 2008Search in Google Scholar

[30]. Wong, R.C.W., Yuen, T.W.Y., Fung, K.W., Leung, Optimizing timetable synchronization for rail mass transit [J]. Transportation Science. 2008,42(1):57-6910.1287/trsc.1070.0200Search in Google Scholar

[31]. Carey, M., Carville, S.. Scheduling and platforming trains at busy complex stations [J]. Transportation Research Part A. 2003,(3): 194-22410.1016/S0965-8564(02)00012-5Search in Google Scholar

[32]. De Luca Cardillo, D., Mione, N.. K L-list τ colouring of graphs [J]. European Journal of Operational Research. 1998,(106): 160-16410.1016/S0377-2217(98)00299-9Search in Google Scholar

[33]. Billionnet, A.. Using integer programming to solve the train-platforming problem [J], Transportation Science. 2003,37(2):213-22210.1287/trsc.37.2.213.15250Search in Google Scholar

[34]. Zwaneveld, P.., Kroon, L.G, Romeijn, H.E., et al. Routing trains through railway stations: Model formulation and algorithms [J]. Transportation Science. 1996,30(3): 181-19410.1287/trsc.30.3.181Search in Google Scholar

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

[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.2000,20(6):75-78 (in Chinese)Search in Google Scholar

[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. 2000,35(3):255-258 (in Chinese)Search in Google Scholar

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

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

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

[41]. Carey,M.. Extending a train pathing model from one-way to two-way track [J], Transportation Research Part B. 1994,28(5):395-40010.1016/0191-2615(94)90038-8Search in Google Scholar

[42]. Carey, M., Crawford. Scheduling trains on a networic of busy complex stations [J].Transportation Research Part B. 2007,41(2): 159-17810.1016/j.trb.2006.02.002Search in Google Scholar

[43]. Jovanovic, D., Harker, P.T.. Tactical scheduling of rail operations: the SCAN I system [J], Transportation Science. 1991,25(1):46-6410.1287/trsc.25.1.46Search in Google Scholar

[44]. Zhou Leishan, Hu Siji. Network Hierarchy Parallel Algorithmof Automatic Train Scheduling [J]. Journalofthe China Railway Society.1998,20(3):15-21Search in Google Scholar

[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)Search in Google Scholar

[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)Search in Google Scholar

[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)Search in Google Scholar

[48]. Yusin Lee, Chuen-Yih Chen. A heuristic for the train pathing and timetabling problem [J]. Transportation Research Part B. 2009,43(8-9):837-85110.1016/j.trb.2009.01.009Search in Google Scholar

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

[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)Search in Google Scholar

[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. 2003,12(1): 13-15 (in Chinese)Search in Google Scholar

[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)Search in Google Scholar

[53] Yusin Lee, Chuen-Yih Chen. A heuristic for the train pathing and timetabling problem [J]. Transportation Research Part B. 2009,43(8-9):837-85110.1016/j.trb.2009.01.009Search in Google Scholar

eISSN:
2286-2218
Język:
Angielski