Skip to main content

Rotation Planning of Locomotive and Carriage Groups with Shared Capacities

  • Conference paper

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

Abstract

In a large railway passenger traffic network, a given set of trips or service blocks are to be serviced by equipment consisting of several groups of locomotives/carriages. The allowed groups per service block are predefined as patterns or multisets of locomotives and carriages. A given type of locomotive/carriage may occur with varying numbers in several groups. We search for a cost-minimal assignment of locomotive/carriage groups to rotations taking special restrictions into account, especially, we shall find the optimal mix of groups obeying given capacities on the level of locomotive and carriage units for each type.

Our solution approach is based on a multi-layer (multi-commodity) network flow model where each layer represents a locomotive/carriage group, and the requirement of servicing each trip exactly once is modeled by cover/partitioning constraints. In this paper, we concentrate on railway specific requirements and present special techniques to model and optimize locomotive and carriage groups with shared capacities. These techniques erable us to solve large-scale practical problem instances of German Railways into optimality.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbink, E., van den Berg, B., Kroon, L., Salomon, M.: Allocation of railway rolling stock for passenger trains. Transportation Science 38(1), 33–41 (2004)

    Article  Google Scholar 

  2. Ben-Kheder, N., Kintanar, J., Queille, C., Strainling, W.: Schedule optimization at SNCF: From conception to day of departure. Interfaces 28, 6–23 (1998)

    Google Scholar 

  3. Brucker, P., Hurink, J., Rolfes, T.: Routing of Railway Carriages. Journal of global optimization 27, 313–332 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cordeau, J.-F., Thoth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation Science 32, 380–404 (1998)

    MATH  Google Scholar 

  5. Cordeau, J.-F., Soumis, F., Desrosiers, J.: A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science 34(2), 133–149 (2000)

    Article  MATH  Google Scholar 

  6. Cordeau, J.-F., Soumis, F., Desrosiers, J.: Simultaneous assignment of locomotives and cars to passenger trains. Operations Research 49(4), 531–548 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kliewer, N., Mellouli, T., Suhl, L.: Multi-depot vehicle scheduling: a time-space network based exact optimization approach. In: Presented at the 9-th Meeting of the EURO Working Group on transportation. Bari. Italy (2002)

    Google Scholar 

  8. Löbel, A.: Optimal Vehicle Scheduling in Public Transit. PhD thesis, ZIB, Berlin. Shaker, Aachen (1998)

    Google Scholar 

  9. Mellouli, T.: A Network Flow Approach to Crew Scheduling based on an Analogy to a Train/Aircraft Maintenance Routing Problem. In: Voß (ed.) Computer-Aided Scheduling of Public Transport. LNEMS, vol. 505, pp. 91–120. Springer, Berlin (2001)

    Google Scholar 

  10. Mellouli, T.: Scheduling and Routing Processes in Public Transport Systems. Habilitation Thesis. University of Paderborn, Germany (2003)

    Google Scholar 

  11. Ramani, K.V., Mandal, B.K.: Operational planning of passenger trains in Indian Railways. Interfaces 22(2), 39–51 (1992)

    Article  Google Scholar 

  12. Suhl, L.: Computer-Aided Scheduling: An Airline Perspective. Gabler–DUV, Wiesbaden (1995)

    Google Scholar 

  13. Suhl, L., Mellouli, T.: Requirements for, and Design of, an Operations Control System for Railways. In: Wilson, N. (ed.) Computer-Aided Transit Scheduling. LNEMS, vol. 471, pp. 371–390. Springer, Heidelberg (1999)

    Google Scholar 

  14. Suhl, L., Mellouli, T., Biederbick, C., Goecke, J.: Managing and preventing delays in railway traffic by simulation and optimization. In: Pursula, M., Niittymäki, J. (eds.) Mathematical methods on optimization in transportation systems. Applied Optimization. ch. 1, vol. 48, pp. 3–16. Kluwer, Dordrecht (2001)

    Google Scholar 

  15. Zirati, K., Soumis, F., Desrosiers, J., Gélinas, S., Saintonge, A.: Locomotive assignment with heterogeneous consists at CN North America. European Journal of OR 97, 281–292 (1997)

    Article  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

Mellouli, T., Suhl, L. (2007). Rotation Planning of Locomotive and Carriage Groups with Shared Capacities. 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_15

Download citation

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

  • 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