Algorithm for Optimal Supplement of Train Traffic Schedule
Article analyses a problem of train traffic schedule optimal addition according to minimum overall expenditure criteria. 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/EU. 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 with modern computers with short enough time consumption. Ill. 2, bibl.8 (in English; summaries in English, Russian and Lithuanian).
How to Cite
The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.
By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.