Skip to main content

Urban Railway Operation Plan Subject to Disruption

  • Chapter
  • First Online:
Transactions on Computational Science XXV

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 9030))

Abstract

The life cycle of an urban railway system is about thirty years, and therefore, any small improvement in operation, results huge savings. The daily operation follows a headway distribution, which itself computed based on the traffic volume. Passing the block sections and stopping in stations are always contaminated with disruptions. The disruptions affect the traffic especially when the headway is in minimum. In this paper, computing the exact practical travel and dwell times is studied. At the first stage a formula is proposed to compute the remained disruptions at the end of the last period in minimum headway. It is supposed that the travel and dwell times take values according to a symmetric distribution. The amount of supplementary times to reach the desired reliability is defined based on the probability of non-absorbed disruptions at the end of the last period. It is concluded that as the number of disrupted travel and dwell times increases the amount of required supplementary times to reach the same level of reliability, increases but in a descending rate. This finding improves the current method to reach the reliability in urban railway operation plans. Finally, the Karaj Metro Line 2 is studied and analyzed as the case study.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shafia, M.A., Pourseyed Aghaee, M., Sadjadi, S.J., Jamili, A.: Robust train timetabling problem: mathematical model and branch and bound algorithm. IEEE Trans. Intell. Transp. Syst. 13(1), 307–317 (2012)

    Article  Google Scholar 

  2. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Khan, M.B., Zhou, X.: Stochastic optimization model and solution algorithm for robust double-track train timetabling problem. IEEE Trans. Intell. Transp. Syst. 11(1), 81–89 (2010)

    Article  Google Scholar 

  4. Liebchen, C., Chachtebeck, M., Schoebel, A., Stiller, S., Prigge, A.: Computing delay resistant railway timetables. Comput. Oper. Res. 37(5), 857–868 (2010)

    Article  MATH  Google Scholar 

  5. Carey, M.: Ex ante heuristic measures of schedule reliability. Transp. Res. Part B 33, 473–494 (1999)

    Article  MathSciNet  Google Scholar 

  6. Vansteenwegen, P., Oudheusden, D.V.: Developing railway timetables which guarantee a better service. Eur. J. Oper. Res. 173, 337–350 (2006)

    Article  MATH  Google Scholar 

  7. Fischetti, M., Monaci, M.: Light robustness. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 61–84. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. D’Angelo, G., Di Stefano, G., Navarra, A.: Evaluation of recoverable-robust timetables on tree networks. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 24–35. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Shafia, M.A., Sadjadi, S.J., Jamili, A., Tavakkoli-Moghaddam, R., Pourseyed Aghaee, M.: The periodicity and robustness in a single-track train scheduling problem. Appl. Soft Comput. J. 12, 440–452 (2012)

    Article  Google Scholar 

  10. Jamili, A., Ghannadpour, S.F.: Computing the supplementary times and the number of required trains in operation plan studies under stochastic perturbations. In: Proceedings of 16th International IEEE Conference on Intelligent Transportation Systems, The Netherlands (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amin Jamili .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jamili, A. (2015). Urban Railway Operation Plan Subject to Disruption. In: Gavrilova, M., Tan, C., Saeed, K., Chaki, N., Shaikh, S. (eds) Transactions on Computational Science XXV. Lecture Notes in Computer Science(), vol 9030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47074-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47074-9_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47073-2

  • Online ISBN: 978-3-662-47074-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics