Skip to main content

A Capacity Test for Shunting Movements

  • Conference paper
Algorithmic Methods for Railway Optimization

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4359))

Abstract

One of the bottlenecks in the logistic planning process at Netherlands Railways is the capacity of the infrastructure at the larger railway stations. To provide passenger trains with the right composition of rolling stock, many shunting movements between platform tracks and shunting areas are necessary, especially just before and after the peak hours. These shunting movements use the same infrastructure as the timetabled passenger and cargo trains.

In this paper we describe a capacity test that has been developed to test at any moment during the planning process, whether the capacity of the infrastructure between the platform tracks and the shunting areas is sufficient for facilitating all the shunting movements that have to be planned in between the already timetabled train movements. With this test it is not necessary anymore to plan every detail of the shunting movements far before the actual operations.

The capacity test is based on a mixed integer programming model. The running time of the Branch-and-Bound algorithm of CPLEX 9.0 is sufficiently small, as was observed in computational experiments related to three stations in the Netherlands.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Van den Broek, J.J.J.: Toets op Inplanbaarheid van Rangeerbewegingen (in Dutch), M.Sc. thesis, Eindhoven University of Technology (2002)

    Google Scholar 

  2. Billionnet, A.: Using Integer Programming to Solve the Train-platforming Problem. Transportation Science 37, 213–222 (2003)

    Article  Google Scholar 

  3. Blasum, U., Bussieck, M.R., Hochstättler, W., Moll, C., Scheel, H.-H., Winter, T.: Scheduling Trams in the Morning. Mathematical Methods of Operations Research 49, 137–148 (2000)

    Google Scholar 

  4. Bussieck, M.R., Winter, T., Zimmermann, U.T.: Discrete Optimization in Public Rail Transport. Mathematical Programming 79, 415–444 (1997)

    MathSciNet  Google Scholar 

  5. Cordeau, J.F., Toth, P., Vigo, D.: A Survey of Optimization Models for Train Routing and Scheduling. Transportation Science 32(4), 380–404 (1998)

    MATH  Google Scholar 

  6. Cornelsen, S., Di Stefano, G.: Platform Assignment (to appear)

    Google Scholar 

  7. Di Miele, F., Gallo, G.: Dispatching Buses in Parking Depots. Transportation Science 35(3), 322–330 (2001)

    Article  MATH  Google Scholar 

  8. Duinkerken, E.: Toets op Opstelcapaciteit, M.Sc. thesis (in Dutch), University of Amsterdam (2003)

    Google Scholar 

  9. Di Stefano, G., Koci, M.L.: A Graph Theoretical Approach to the Shunting Problem. In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization for Railways (ATMOS 2003) Electronic Notes in Theoretical Computer Science, vol. 92 (2004)

    Google Scholar 

  10. Freling, R., Lentink, R.M., Kroon, L.G., Huisman, D.: Shunting of Passenger Train Units in a Railway Station. Transportation Science 39, 261–272 (2005)

    Article  Google Scholar 

  11. Hamdouni, M., Desaulniers, G., Marcotte, O., Soumis, F., Van Putten, M.: Dispatching Buses in a Depot Using Block Patterns. Technical report G-2004-051. GÉRAD, Montréal (2004)

    Google Scholar 

  12. Tomii, N., Zhou, L.J., Fukumara, N.: An Algorithm for Station Shunting Scheduling Problems Combining Probabilistic Local Search and PERT. In: Imam, I., et al. (eds.) Multiple approaches to intelligent systems: 12th international conference on industrial and engineering applications of artificial intelligence and expert systems, pp. 788–797. Springer, Berlin (1999)

    Google Scholar 

  13. Tomii, N., Zhou, L.J.: Depot Shunting Scheduling Using Combined Genetic Algorithm and PERT. In: Allen, J., et al. (eds.) Computers in Railways VII, pp. 437–446. WIT Press, Southampton (2000)

    Google Scholar 

  14. Winter, Th., Zimmermann, U.T.: Real-time Dispatch of Trams in Storage Yards, Annals of Operations Research 96, 287–315 (2000)

    Google Scholar 

  15. Zwaneveld, P.J.: Railway Planning, Routing of Trains and Allocation of Passenger Lines, Ph.D. thesis, Erasmus University Rotterdam (1997)

    Google Scholar 

  16. Zwaneveld, P.J., Dauzère-Pérès, S., van Hoesel, C.P.M., Kroon, L.G., Romeijn, H.E., Salomon, M., Ambergen, H.W.: Routing Trains Through Railway Stations: Model Formulation and Algorithms. Transportation Science 30, 181–194 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Frank Geraets Leo Kroon Anita Schoebel Dorothea Wagner Christos D. Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van den Broek, J., Kroon, L. (2007). A Capacity Test for Shunting Movements. In: Geraets, F., Kroon, L., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds) Algorithmic Methods for Railway Optimization. Lecture Notes in Computer Science, vol 4359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74247-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74247-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74245-6

  • Online ISBN: 978-3-540-74247-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics