|
Avtomatika i Telemekhanika, 2018, Issue 3, Pages 144–166
(Mi at14789)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Optimization, System Analysis, and Operations Research
Scheduling the two-way traffic on a single-track railway with a siding
Y. Zindera, A. A. Lazarevbcde, E. G. Musatovab, I. A. Tarasovbc a Technical University of Sydney, Sydney, Australia
b Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
c Lomonosov State University, Moscow, Russia
d National Research University Higher School of Economics, Moscow, Russia
e Moscow Institute of Physics and Technology (State University), Moscow, Russia
Abstract:
The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for various objective functions an optimal schedule can be constructed in polynomial time using the method of dynamic programming. Based on this result, the paper also presents a polynomial-time algorithm minimising the weighted number of late trains.
Keywords:
dynamic programming, polynomial algorithm, railway planning, scheduling theory.
Citation:
Y. Zinder, A. A. Lazarev, E. G. Musatova, I. A. Tarasov, “Scheduling the two-way traffic on a single-track railway with a siding”, Avtomat. i Telemekh., 2018, no. 3, 144–166; Autom. Remote Control, 79:3 (2018), 506–523
Linking options:
https://www.mathnet.ru/eng/at14789 https://www.mathnet.ru/eng/at/y2018/i3/p144
|
Statistics & downloads: |
Abstract page: | 288 | Full-text PDF : | 41 | References: | 42 | First page: | 22 |
|