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

On Optimally Allocating Tracks in Complex Railway Stations

In: Operations Research Proceedings 2015

Author

Listed:
  • Reyk Weiß

    (TU Dresden)

  • Michael Kümmling

    (TU Dresden)

  • Jens Opitz

    (TU Dresden)

Abstract

Timetabling and capacity planning of railway transport faces ever-growing challenges. Due to the high number of different influences on capacity, timetable optimization in the railway network cannot be efficiently handled by manual effort. The software system TAKT is a state-of-the-art realization, which allows to compute automatically strictly synchronized and conflict-free timetables for very large railway networks. The complexity increases significantly in the consideration of single tracks and highly frequented main railway stations which may also have a extensive track layout. This work shows how the complexity of the timetables process can be reduced by ignoring selected minimum headway constraints. As a result, timetables with possible conflicts in those covered regions will be computed. Consequently, there is the need for efficient algorithms and its corresponding conjunction to solve the remaining conflicts by detecting alternative stopping positions and routes within a main railway station and the optimized selection.

Suggested Citation

  • Reyk Weiß & Michael Kümmling & Jens Opitz, 2017. "On Optimally Allocating Tracks in Complex Railway Stations," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 287-292, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_39
    DOI: 10.1007/978-3-319-42902-1_39
    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_39. 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.