A hierarchical line planning approach for a large-scale high speed rail network: The China case

被引:97
作者
Fu, Huiling [1 ,2 ]
Nie, Lei [2 ]
Meng, Lingyun [1 ]
Sperry, Benjamin R. [3 ]
He, Zhenhuan [2 ]
机构
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
[2] Beijing jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
[3] Ohio Univ, Dept Civil Engn, Athens, OH 45701 USA
基金
中国国家自然科学基金;
关键词
High speed rail network; Line planning problem; Bi-level programming; Heuristics; Timetable scheduling; PASSENGER; ALGORITHM; MODEL;
D O I
10.1016/j.tra.2015.03.013
中图分类号
F [经济];
学科分类号
02 ;
摘要
Planning a set of train lines in a large-scale high speed rail (HSR) network is typically influenced by issues of longer travel distance, high transport demand, track capacity constraints, and a non-periodic timetable. In this paper, we describe an integrated hierarchical approach to determine line plans by defining the stations and trains according to two classes. Based on a bi-level programming model, heuristics are developed for two consecutive stages corresponding to each classification. The approach determines day-period based train line frequencies as well as a combination of various stopping patterns for a mix of fast trunk line services between major stations and a variety of slower body lines that offer service to intermediate stations, so as to satisfy the predicted passenger transport demand. Efficiencies of the line plans described herein concern passenger travel times, train capacity occupancy, and the number of transfers. Moreover, our heuristics allow for combining many additional conflicting demand-supply factors to design a line plan with predominantly cost-oriented and/or customer-oriented objectives. A range of scenarios are developed to generate three line plans for a real-world example of the HSR network in China using a decision support system. The performance of potential train schedules is evaluated to further examine the feasibility of the obtained line plans through graphical timetables. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:61 / 83
页数:23
相关论文
共 25 条
  • [21] Integral cycle bases for cyclic timetabling
    Liebchen, Christian
    Peeters, Leon
    [J]. DISCRETE OPTIMIZATION, 2009, 6 (01) : 98 - 109
  • [22] Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables
    Meng, Lingyun
    Zhou, Xuesong
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 : 208 - 234
  • [23] Scholl S., 2005, THESIS U KAISERSLAUT
  • [24] Optimal All-Stop, Short-Turn, and Express Transit Services Under Heterogeneous Demand
    Ulusoy, Yavuz Y.
    Chien, Steven I-Jy
    Wei, Chien-Hung
    [J]. TRANSPORTATION RESEARCH RECORD, 2010, (2197) : 8 - 18
  • [25] Working out an incomplete cyclic train timetable for high-speed railways by computer
    Yang, D.
    Nie, L.
    Tan, Y.
    He, Z.
    Zhang, Y.
    [J]. COMPUTERS IN RAILWAYS XII: COMPUTER SYSTEM DESIGN AND OPERATION IN RAILWAYS AND OTHER TRANSIT SYSTEMS, 2010, 114 : 889 - 900