| Title |
Eismo grafiko optimalaus papildymo uždavinys ir jo sprendimo būdai / |
| Another Title |
Optimal addition's task of the traffic schedule and its solution’s ways. |
| Authors |
Doroševienė, A ; Bartkevičius, S ; Bagdonas, V |
| Full Text |
|
| Is Part of |
Elektronika ir elektrotechnika.. Kaunas : Technologija. 2004, Nr. 6, p. 66-70.. ISSN 1392-1215. eISSN 2029-5731 |
| Abstract [eng] |
Article analyses formation problem of flexible traffic schedule. Special request must be submitted, inserting additional (not planned before) track into made traffic schedules. Handling importance of special 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. This task in essence is search task, whose particularity is a not fixed initial and final tops, of the shortest (according to waste) way in graphs. Task also can be solved applying methods of dynamic programming and full variants re-selection. All these methods are equally exact and can be implemented with modern computers with short enough time consumption. |
| Published |
Kaunas : Technologija |
| Type |
Journal article |
| Language |
Lithuanian |
| Publication date |
2004 |
| CC license |
|
