Skip to main content
Log in

Rake linking for suburban train services

  • Application Paper
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

In the planning of operations in suburban train services, an important issue is rake linking. In this, physical train units called rakes (in this context, a standardized set of cars, including motor coaches in their composition) are to be assigned to services that are planned as part of the timetable. Doing this optimally (with as few rakes as possible or with as little empty running as possible) has a significant impact on the overall costs and reliability of services. We have modeled this problem as a network flow problem and implemented it on a real life operation (Western Railway, in Mumbai). This exercise also generates rake cycles which describe the sequence of services to be done by each rake, and a perturbation analysis on parameters to identify actions for improvement. A subsequent decision is the allocation of platforms and stabling lines at terminals. The Rake Linker has been tested on a service network involving more than a thousand services on Western Railway on the Mumbai suburban railway network.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, 1993.

    Google Scholar 

  2. N. Rangaraj, and M. Sohoni. Time-tabling of Suburban Train Services. http://www.cse.iitb.ac.in/~sohoni/ttable.ps.gz

  3. Western Railway, (15th August, 2002). Working Time Table No. 68. Mumbai Division (Suburban Section).

  4. D. P. Bertsekas, and P. Tseng. Relax IV: A faster version to the Relax code for solving minimum cost flow problems. LIDS-Report, 1994.

  5. L. R. Ford, and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, 1962.

    Google Scholar 

  6. C. H. Papadimitriou, K. Steiglitz. Combinatorial Optimization : Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Narayan Rangaraj.

Additional information

A preliminary version of this paper was presented at the International Conference on Operations Research for Development. Chennai, 2002.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rangaraj, N., Sohoni, M., Puniya, P. et al. Rake linking for suburban train services. OPSEARCH 43, 103–116 (2006). https://doi.org/10.1007/BF03398768

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398768

Keywords

Navigation