Advertisement

OD-Dependent Train Scheduling for an Urban Rail Transit Line

  • Yihui WangEmail author
  • Bin Ning
  • Ton van den Boom
  • Bart De Schutter
Chapter
  • 758 Downloads
Part of the Advances in Industrial Control book series (AIC)

Abstract

In this chapter, in order to capture more detailed information about passengers we consider train scheduling with origin–destination-dependent (OD-dependent ) passenger demands for an urban rail transit line. A stop-skipping strategy is adopted to reduce the total passenger travel time and the energy consumption. The resulting train scheduling problem is a mixed integer nonlinear programming problem. A bi-level approach and a limited bi-level approach are proposed to solve this problem. These two approaches are compared through a case study inspired by real data from the Beijing Yizhuang subway line. The results discussed in this chapter are based on Wang et al. (IEEE Trans Intell Transp Syst 15:2658–2670, 2014) [1]; Wang et al. (Proceedings of the 93rd annual meeting of the transportation research board, Washington, DC, 2014) [2].

Keywords

Terminal Station Schedule Period Total Travel Time Mixed Integer Nonlinear Programming Train Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Wang Y, De Schutter B, van den Boom T, Ning B, Tang T (2014) Efficient bi-level approach for urban rail transit operation with stop-skipping. IEEE Trans Intell Transp Syst 15:2658–2670Google Scholar
  2. 2.
    Wang Y, De Schutter B, van den Boom T, Ning B, Tang T (2014) Origin-destination dependent train scheduling problem with stop-skipping for urban rail transit systems. In: Proceedings of the 93rd annual meeting of the transportation research board, Washington, DCGoogle Scholar
  3. 3.
    Elberlein X, Wilson N, Bernstein D (2001) The holding problem with real-time information available. Transp Sci 35:1–18CrossRefzbMATHGoogle Scholar
  4. 4.
    Wang H, Schmid F, Chen L, Roberts C, Xu T (2013a) A topology-based model for railway train control systems. IEEE Trans Intell Transp Syst 14:819–827CrossRefGoogle Scholar
  5. 5.
    Boggs P, Tolle J (1995) Sequential quadratic programming. Acta Numerica 4:1–51MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Hooke R, Jeeves T (1961) “Direct search” solution of numerical and statistical problems. J Assoc Comput Mach 8:212–229CrossRefzbMATHGoogle Scholar
  7. 7.
    Gembicki F, Haimes Y (1975) Approach to performance and sensitivity multiobjective optimization the goal attainment method. IEEE Trans Autom Control 20:769–771CrossRefGoogle Scholar
  8. 8.
    Kiresuk T, Sherman R (1968) Goal attainment scaling a general method for evaluating comprehensive community mental health programs. IEEE Trans Autom Control 4:443–453Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Yihui Wang
    • 1
    Email author
  • Bin Ning
    • 1
  • Ton van den Boom
    • 2
  • Bart De Schutter
    • 2
  1. 1.State Key Laboratory of Rail Traffic Control and SafetyBeijing Jiaotong UniversityBeijingChina
  2. 2.Delft Center for Systems and ControlDelft University of TechnologyDelftThe Netherlands

Personalised recommendations