Optimal Addition's Algorithms of the Traffic Schedule for Railways with Mobile Blocking Sections

Authors

  • A. Doroševienė Kaunas University of Technology
  • S. Bartkevičius Kaunas University of Technology
  • V. Bagdonas Kaunas University of Technology

Abstract

Article analyses formation problem of flexible traffic schedule. Ad hoc request must be submitted, inserting additional (not planned before) track into made traffic schedules. Handling importance of ad hoc requests is emphasized in EU directive 2001/14/EB. Task is to analyse optimal insertion of an additional (reserved) train track's into already made schedule: task formulation and possible ways of solution. Task also can be solved applying Monte-Carlo, genetic algorithm or variants re-selection methods. All these methods are equally exact and can be implemented with modern computers with quit short time costs. Ill. 2, bibl.4 (in Lithuanian; summaries in Lithuanian, English and Russian).

Downloads

Published

2005-05-20

How to Cite

Doroševienė, A., Bartkevičius, S., & Bagdonas, V. (2005). Optimal Addition’s Algorithms of the Traffic Schedule for Railways with Mobile Blocking Sections. Elektronika Ir Elektrotechnika, 61(5), 79-84. Retrieved from https://eejournal.ktu.lt/index.php/elt/article/view/10435

Issue

Vol. 61 No. 5 (2005)

Section

T 125 AUTOMATION, ROBOTICS

License

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.