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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Forward Cycle Bases and Periodic Timetabling



    Erscheinungsdatum :

    01.01.2021



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    004 / 388




    Forward Cycle Bases and Periodic Timetabling

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

    Freier Zugriff

    Forward and Line-Based Cycle Bases for Periodic Timetabling

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

    Freier Zugriff

    Forward and Line-Based Cycle Bases for Periodic Timetabling

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

    Freier Zugriff

    Forward and Line-Based Cycle Bases for Periodic Timetabling

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

    Freier Zugriff

    Recoverable Robust Periodic Timetabling

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

    Freier Zugriff