The article analyses the problem of train traffic schedule optimal addition according to minimum overall expenditure criteria. The task is to analyze optimal insertion of an additional train track into already made schedule. The methodology is all‐right applicable for ad hoc requests submission. Handling importance of ad hoc requests is emphasized in EU directive 2001/14/EB. The task can be solved applying Monte‐Carlo, genetic algorithms, variants reselection methods or methods of the shortest (according to waste) way in graphs. All these methods are equally exact and can be implemented in modern computers with short enough time consumption. First Published Online: 27 Oct 2010


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Algorithm for optimal correction of train traffic schedule


    Beteiligte:


    Erscheinungsdatum :

    2006




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Algorithm for optimal correction of train traffic schedule

    I. Mišauskaitė / V. Bagdonas | DOAJ | 2006

    Freier Zugriff


    Issues of regulation of fillability of a train traffic schedule

    Bessonenko Sergey / Badazhkov Mikhail | DOAJ | 2018

    Freier Zugriff

    Train Traffic Simulation with Coloured Petri Nets and Schedule Optimisation

    Bartkevičius, S. / Bagdonas, V. / Juraška, M. et al. | BASE | 2005

    Freier Zugriff

    Optimal train schedule with headway and passenger flow dynamic models

    Sun, Xubin / Zhang, Shaobo / Dong, Hairong et al. | IEEE | 2013