The research of this work is motivated by the Timetable Synchronization Problem in public transport. The problem is formulated as a multi-criteria Quadratic Semi-Assignment Problem (QSAP). This type of problem is known to be NP-hard. Therefore, the real life problem instances are solved with metaheuristics. To evaluate the quality of the solutions, lower bounds are generated by using the Reformulation Linearization Technique (RLT). This work contains new polyhedral results for the QSAP and analyzes the characteristics of the RLT solutions. A graph structure that causes untight solutions is presented and its minimality is proven. Exploiting these results, the natural stepwise structure of the RLT can be softened up to generate new algorithms for fast lower bound computations. The competitiveness of the approach is demonstrated by means of the real life instances.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    RLT approaches to QSAPs: Applied to timetable synchronization in public transport


    Beteiligte:

    Erscheinungsdatum :

    2010


    Format / Umfang :

    245 Seiten, Bilder, Tabellen, 65 Quellen



    Medientyp :

    Hochschulschrift


    Format :

    Print


    Sprache :

    Englisch




    Integrated public transport timetable synchronization with vehicle scheduling

    Liu, Tao / Ceder, Avishai (Avi) / Chowdhury, Subeh | Taylor & Francis Verlag | 2017


    User and Operator Perspectives in Public Transport Timetable Synchronization Design

    Liu, Tao / Ceder, Avishai (Avi) | Transportation Research Record | 2017


    Periodic timetable optimization in public transport

    Liebchen, Christian | Tema Archiv | 2006


    Periodic timetable optimization in public transport

    Liebchen, Christian | TIBKAT | 2006