IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v31y2023i2d10.1007_s11750-022-00641-5.html
   My bibliography  Save this article

Timetable compression using max-plus automata applied to large railway networks

Author

Listed:
  • Jolien Uyttendaele

    (KU Leuven Institute for Mobility-CIB, KU Leuven)

  • Inneke Van Hoeck

    (KU Leuven Institute for Mobility-CIB, KU Leuven)

  • Nikola Besinovic

    (TU Delft)

  • Pieter Vansteenwegen

    (KU Leuven Institute for Mobility-CIB, KU Leuven)

Abstract

Demand for railway transportation keeps on growing. Therefore, a thorough understanding of the capacity of railway networks is crucial. In this paper, the well-known compression method based on max-plus algebra is extended. A number of challenges are addressed to apply this compression method to large and complex networks, such as the one considered in this paper. Some trains have to be split artificially, while keeping the parts together during the compression. The trains should also be ordered explicitly, since there is no part of the infrastructure used by all trains. The results in this paper indicate that it is possible to thoroughly analyse the capacity by the adjusted compression method for large and complex networks, but the results should be interpreted with care. The results show, for instance, that the capacity occupation heavily depends on the size of the network that is considered and that it is not easy to give a clear, practical interpretation of the capacity occupation. Nevertheless, the method allowed to determine a number of critical paths and, even more importantly, a number of critical resources in the zones considered.

Suggested Citation

  • Jolien Uyttendaele & Inneke Van Hoeck & Nikola Besinovic & Pieter Vansteenwegen, 2023. "Timetable compression using max-plus automata applied to large railway networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 414-439, July.
    • Handle: RePEc:spr:topjnl:v:31:y:2023:i:2:d:10.1007_s11750-022-00641-5
    DOI: 10.1007/s11750-022-00641-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-022-00641-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11750-022-00641-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:topjnl:v:31:y:2023:i:2:d:10.1007_s11750-022-00641-5. 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.