IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-92575-7_50.html
   My bibliography  Save this book chapter

Sorting Criteria for Line-Based Periodic Timetabling Heuristics

Author

Listed:
  • Patricia Ebert

    (Zuse Institute Berlin
    Hochschule für Technik und Wirtschaft Berlin)

  • Berenike Masing

    (Zuse Institute Berlin)

  • Niels Lindner

    (Zuse Institute Berlin)

  • Ambros Gleixner

    (Zuse Institute Berlin
    Hochschule für Technik und Wirtschaft Berlin)

Abstract

It is well-known that optimal solutions are notoriously hard to find for the Periodic Event Scheduling Problem (PESP), which is the standard mathematical formulation to optimize periodic timetables in public transport. We consider a class of incremental heuristics that have been demonstrated to be effective by Lindner and Liebchen (2023), however, for only one fixed sorting strategy of lines along which a solution is constructed. Thus, in this paper, we examine a variety of sortings based on the number, weight, weighted span, and lower bound of arcs, and test for each setting various combinations of the driving, dwelling, and transfer arcs of lines. Additionally, we assess the impact on the incremental extension of the event-activity network by minimizing resp. maximizing a connectivity measure between subsets of lines. We compare our 27 sortings on the railway instances of the benchmarking library PESPlib within the ConcurrentPESP solver framework. We are able to find five new incumbent solutions, resulting in improvements of up to $$2\%$$ 2 % .

Suggested Citation

  • Patricia Ebert & Berenike Masing & Niels Lindner & Ambros Gleixner, 2025. "Sorting Criteria for Line-Based Periodic Timetabling Heuristics," Lecture Notes in Operations Research,, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-92575-7_50
    DOI: 10.1007/978-3-031-92575-7_50
    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
    for a similarly titled item that would be available.

    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:spr:lnopch:978-3-031-92575-7_50. 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.