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

A New Hierarchical Approach for Optimized Train Path Assignment with Traffic Days

In: Operations Research Proceedings 2015

Author

Listed:
  • Daniel Pöhle

    (DB Netz AG)

  • Matthias Feil

    (DB Netz AG)

Abstract

German Railways Infrastructure division DB Netz has started to gradually introduce a new process for its rail freight timetabling. This process contains two main stages: at first a pre-planning of standardized train paths (called slots) and afterwards the assignment of train path applications to the pre-planned slots. The current implemented train path assignment optimization model by Nachtigall and Opitz 2014 has a model scope of one single traffic day. However, current train path applications for the network timetable have multiple and diverse traffic days (e.g. Monday till Friday or Tuesday and Thursday) and cannot be assigned appropriately today. At first it will be illustrated by what a good train path assignment with multiple traffic days is characterized from the point of view of an infrastructure manager and its customers. Subsequently, a new hierarchical approach for train path assignment with different traffic days will be presented which is derived from the analysis of present train path applications. The analyses of a German long term timetable scenario indicate that this new approach generates promising results.

Suggested Citation

  • Daniel Pöhle & Matthias Feil, 2017. "A New Hierarchical Approach for Optimized Train Path Assignment with Traffic Days," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 613-619, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_83
    DOI: 10.1007/978-3-319-42902-1_83
    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-42902-1_83. 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.