IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v196y2025ics0191261525000621.html
   My bibliography  Save this article

A bi-level optimization model for project scheduling and traffic flow routing in railway networks

Author

Listed:
  • Lidén, Tomas
  • Kristofersson, Filip
  • Aronsson, Martin

Abstract

Long-term tactical infrastructure planning for a transportation network consists of deciding on renewals and major maintenance works. Such projects constitute large budget volumes and will impair the available traffic capacity during their execution, especially for railway systems. Quantitative methods that schedule and coordinate infrastructure projects together with traffic flow adaptations is however largely lacking today.

Suggested Citation

  • Lidén, Tomas & Kristofersson, Filip & Aronsson, Martin, 2025. "A bi-level optimization model for project scheduling and traffic flow routing in railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 196(C).
  • Handle: RePEc:eee:transb:v:196:y:2025:i:c:s0191261525000621
    DOI: 10.1016/j.trb.2025.103213
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261525000621
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2025.103213?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Trivella, Alessio & Corman, Francesco & Koza, David F. & Pisinger, David, 2021. "The multi-commodity network flow problem with soft transit time constraints: Application to liner shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:transb:v:196:y:2025:i:c:s0191261525000621. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.