Optimizing Rolling Stock Deadhead Routing Problem before Operation Period of Urban Rail Transit Line

被引:0
|
作者
Zhong Q. [1 ]
Zhao J. [1 ]
Wen C. [1 ]
Peng Q. [1 ]
机构
[1] School of Transportation and Logistics, Southwest Jiaotong University, Chengdu
来源
Zhao, Jun (junzhao@swjtu.edu.cn) | 2018年 / Science Press卷 / 40期
关键词
Deadhead routing problem; Integer linear programming; Rolling stock scheduling; Train timetabling; Urban rail transit;
D O I
10.3969/j.issn.1001-8360.2018.03.005
中图分类号
学科分类号
摘要
In an urban rail transit line, many trains that run during the initial operation period require to be served by rolling stocks that depart from depots. Hence, before the operation period, these rolling stocks consecutively leave depots, and run without passengers to the origin station where they serve as operating trains using either a direct or an indirect route. This paper investigated the rolling stock scheduling problem with multiple line plans, multiple depots and multiple rolling stocks, assigning the origin depot and corresponding deadhead route for the rolling stock required by each train during the initial operation period. By considering the depot maintenance capacity and departure capacity as well as the switchback station capacity, a mixed integer linear programming model was built to minimize the total deadhead mileage. The size of the model is polynomial with respect to the number of depots, switch stations and trains, with which large-scale problems can be quickly solved to optimality by commercial optimization solvers. The computational results demonstrate that the optimization approach is better than the empirical method used in practice in terms of solution quality, while opening closed switchback stations or prolonging available depot departure time are expected to further shorten the total rolling stock deadhead mileage. © 2018, Department of Journal of the China Railway Society. All right reserved.
引用
收藏
页码:29 / 38
页数:9
相关论文
共 14 条
  • [1] Niu H., Zhou X., Optimizing Urban Rail Timetable under Time-dependent Demand and Oversaturated Conditions, Transportation Research Part C: Emerging Technologies, 36, 11, pp. 212-230, (2013)
  • [2] Niu H., Zhou X., Gao R., Train Scheduling for Minimizing Passenger Waiting Time with Time-dependent Demand and Skip-stop Patterns: Nonlinear Integer Programming Models with Linear Constraints, Transportation Research Part B: Methodological, 76, pp. 117-135, (2015)
  • [3] Sun L., Jin J.G., Lee D.H., Et al., Demand-driven Timetable Design for Metro Services, Transportation Research Part C: Emerging Technologies, 46, pp. 284-299, (2014)
  • [4] Barrena E., Canca D., Coelho L.C., Et al., Exact Formulationsand Algorithm for the Train Timetabling Problem with Dynamic Demand, Computers & Operations Research, 44, 3, pp. 66-74, (2014)
  • [5] Barrena E., Canca D., Coelho L.C., Et al., Single-Line Rail Rapid Transit Timetablingunder Dynamic Passenger Demand, Transportation Research Part B: Methodological, 70, C, pp. 134-150, (2014)
  • [6] Xu H., Ma J., Long J., Et al., Study on Model and Method of Train Working Diagram of Urban Rail Transit, Journal of Beijing Jiaotong University, 30, 3, pp. 10-14, (2006)
  • [7] Jiang Z., Xu R., Wu Q., Et al., Shared-path Routing Timetable Computer Designing in Rail Transit System, Journal of Tongji University (Natural Science), 38, 5, pp. 692-696, (2010)
  • [8] Cadarso L., Marin A., Robust Rolling Stock in Rapid Transit Networks, Computers & Operations Research, 38, 8, pp. 1131-1142, (2011)
  • [9] Cadarso L., Marin A., Robust Routing of Rapid Transit Rolling Stock, Public Transport, 2, 1, pp. 51-68, (2010)
  • [10] Cadarso L., Marin A., Improving Robustness of Rolling Stock Circulations in Rapid Transit Networks, Computers & Operations Research, 51, 3, pp. 146-159, (2014)