IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-89920-6_96.html
   My bibliography  Save this book chapter

Timetable Sparsification by Rolling Stock Rotation Optimization

In: Operations Research Proceedings 2017

Author

Listed:
  • Ralf Borndörfer

    (Zuse Institute Berlin)

  • Matthias Breuer

    (DB Fernverkehr AG)

  • Boris Grimm

    (Zuse Institute Berlin)

  • Markus Reuther

    (LBW Optimization GmbH)

  • Stanley Schade

    (Zuse Institute Berlin)

  • Thomas Schlechte

    (LBW Optimization GmbH)

Abstract

Rolling stock optimization is a task that naturally arises by operating a railway system. It could be seen with different level of details. From a strategic perspective to have a rough plan which types of fleets to be bought to a more operational perspective to decide which coaches have to be maintained first. This paper presents a new approach to deal with rolling stock optimisation in case of a (long term) strike. Instead of constructing a completely new timetable for the strike period, we propose a mixed integer programming model that is able to choose appropriate trips from a given timetable to construct efficient tours of railway vehicles covering an optimized subset of trips, in terms of deadhead kilometers and importance of the trips. The decision which trip is preferred over the other is made by a simple evaluation method that is deduced from the network and trip defining data.

Suggested Citation

  • Ralf Borndörfer & Matthias Breuer & Boris Grimm & Markus Reuther & Stanley Schade & Thomas Schlechte, 2018. "Timetable Sparsification by Rolling Stock Rotation Optimization," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 723-728, Springer.
  • Handle: RePEc:spr:oprchp:978-3-319-89920-6_96
    DOI: 10.1007/978-3-319-89920-6_96
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-89920-6_96. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.