Working out an incomplete cyclic train timetable for high-speed railways by computer

被引:7
作者
Yang, D. [1 ]
Nie, L. [1 ]
Tan, Y. [1 ]
He, Z. [1 ]
Zhang, Y. [1 ]
机构
[1] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing, Peoples R China
来源
COMPUTERS IN RAILWAYS XII: COMPUTER SYSTEM DESIGN AND OPERATION IN RAILWAYS AND OTHER TRANSIT SYSTEMS | 2010年 / 114卷
关键词
incomplete cyclic train timetable; Beijing-Shanghai high-speed railway; computer system;
D O I
10.2495/CR100801
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Cyclic train timetables as a popular mode of train operation have been successfully applied for many years in European railways, especially in high-speed railways (hereinafter referred to as 'HSR'). However, in China, most studies on the train timetables of HSR still follow the traditional mode. By analyzing the characteristics of Chinese HSR, this paper proposes an incomplete cyclic timetable mode that will be more suitable for the Chinese situation. The characteristics and process of working out incomplete a cyclic train timetable are discussed. There are four key issues involved in developing this kind of timetable: (1) Adaptability analyzing. This paper analyzes the proportion of trains that can be operated cyclically in terms of the technical condition and passenger flow of each HSR in order to determine the structure of the timetable. (2) Model developing. By analyzing the condition of the Chinese HSR, the existing model is improved to solve the problem more precisely and practically. (3) Non-cyclic train path insertion. According to the travel demand of passengers, the principles and technologies of inserting non-cyclic train paths into cyclic train paths is developed. (4) Seasonal expanding. The seasonal fluctuation of passenger flow makes more non-cyclic train paths. The ways to balance the disaccord in different periods are discussed to keep the operation efficient. Furthermore, a system using VC++ is designed with consideration of the four issues in its functions and working process, based on inputting the solution of the model. Finally, a successful case of the Beijing-Shanghai HSR shows the feasibility of the incomplete cyclic timetable and the practical value of the system.
引用
收藏
页码:889 / 900
页数:12
相关论文
共 14 条
  • [1] Assad Arjang, 1980, TRANSPORTATION RES, V14
  • [2] Chen Yong, 2000, RAILWAY COMPUTER APP, V9, P4
  • [3] DOMSCHKE W, 1989, OR SPEKTRUM, V11, P17
  • [4] Giesemann C., 2002, SEM ALG MOD RAILW OP
  • [5] Hao Shi, 2000, J CHINA RAILWAY SOC, V22, P92
  • [6] Jia Yong-gang, 2005, RAILWAY TRANSPORTATI, V28, P76
  • [7] Liebchen C, 2002, CYCLIC TIMETABLING C
  • [8] Lindner Thomas, 2000, THESIS TU BRAUNSCHWE
  • [9] Nachtigall Karl, 1996, COMPUTERS OPERATIONA, V23
  • [10] A constraint generation algorithm for the construction of periodic railway timetables
    Odijk, MA
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1996, 30 (06) : 455 - 464