Scheduling the Two-Way Traffic on a Single-Track Railway with a Siding


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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.

About the authors

Y. Zinder

Technical University of Sydney

Author for correspondence.
Email: yakov.zinder@uts.edu.au
Australia, Sydney

A. A. Lazarev

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences; Lomonosov State University; National Research University Higher School of Economics; Moscow Institute of Physics and Technology (State University)

Email: yakov.zinder@uts.edu.au
Russian Federation, Moscow; Moscow; Moscow; Moscow

E. G. Musatova

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences

Email: yakov.zinder@uts.edu.au
Russian Federation, Moscow

I. A. Tarasov

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences; Lomonosov State University

Email: yakov.zinder@uts.edu.au
Russian Federation, Moscow; Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.