RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2018 Issue 3, Pages 144–166 (Mi at14789)

This article is cited 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.

Presented by the member of Editorial Board: V. M. Vishnevsky

Received: 17.05.2017


 English version:
Automation and Remote Control, 2018, 79:3, 506–523

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025