This paper describes a new approach for train calendars textual generation, that is a heuristic algorithm designed to automatically generate a text to final customers, concisely and clearly, from a service calendar represented by a boolean vector as input. This niche problem belongs to the transportation field, specifically, to railway services. The new heuristic algorithm, developed in the C programming language, guarantees a constant computation time, between 0 and 16 ms. Tested on several real railway timetables, this new approach was extensively compared with existing mathematical programming models presented in Amorosi et al. (2019), with a significant reduction of computation times that makes it applicable in practical contexts.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Fast and Effective Greedy Heuristic for On-line Train Calendars Generation


    Beteiligte:


    Erscheinungsdatum :

    2021-06-16


    Format / Umfang :

    5911948 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Research on Greedy Train Rescheduling Algorithm

    He, Z. / Li, H. / Miao, J. et al. | British Library Conference Proceedings | 2009


    An Effective Meta-Heuristic Technique for Solving Train Scheduling Problem

    Khan, M. B. / Fan, Wangbo / Zhang, Dianye | ASCE | 2007


    An Effective Meta-Heuristic Technique for Solving Train Scheduling Problem

    Khan, M.B. / Fan, W. / Zhang, D. et al. | British Library Conference Proceedings | 2007