Periodic timetable optimization problems in public transport can be modeled as mixed-integer linear programs by means of the Periodic Event Scheduling Problem (PESP). In order to keep the branch-and-bound tree small, minimum integral cycle bases have been proven successful. We examine forward cycle bases, where no cycle is allowed to contain a backward arc. After reviewing the theory of these bases, we describe the construction of an integral forward cycle basis on a line-based event-activity network. Adding turnarounds to the instance R1L1 of the benchmark library PESPlib, we computationally evaluate three types of forward cycle bases in the Pareto sense, and come up with significant improvements concerning dual bounds.


    Access

    Download


    Export, share and cite



    Title :

    Forward Cycle Bases and Periodic Timetabling



    Publication date :

    2021-01-01



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    004 / 388




    Forward Cycle Bases and Periodic Timetabling

    Lindner, Niels / Liebchen, Christian / Masing, Berenike | BASE | 2021

    Free access

    Forward and Line-Based Cycle Bases for Periodic Timetabling

    Masing, Berenike / Lindner, Niels / Ebert, Patricia | BASE | 2023

    Free access

    Forward and Line-Based Cycle Bases for Periodic Timetabling

    Masing, Berenike / Lindner, Niels / Ebert, Patricia | BASE | 2023

    Free access

    Forward and Line-Based Cycle Bases for Periodic Timetabling

    Masing, Berenike / Lindner, Niels / Ebert, Patricia | BASE | 2023

    Free access

    Recoverable Robust Periodic Timetabling

    Grafe, Vera / Schöbel, Anita | DataCite | 2023

    Free access