Email this article Two-directional traffic scheduling problem solution for a single-track railway with siding
- Authors: Lazarev A.A.1,2,3,4, Musatova E.G.1, Tarasov I.A.1,2
-
Affiliations:
- Trapeznikov Institute of Control Sciences
- Lomonosov State University
- National Research University Higher School of Economics
- Moscow Physical and Technical Institute (State University)
- Issue: Vol 77, No 12 (2016)
- Pages: 2118-2131
- Section: Topical Issue
- URL: https://journal-vniispk.ru/0005-1179/article/view/150490
- DOI: https://doi.org/10.1134/S0005117916120031
- ID: 150490
Cite item
Open Access
Access granted
Subscription Access
Abstract
The paper is concerned with scheduling trains moving in both directions between two stations connected by a single-track railway with a siding. The paper presents dynamic programming based algorithms which minimizes two objective functions: maximum lateness and total weighted completion time. The complexity of these algorithms is O(n2).
About the authors
A. A. Lazarev
Trapeznikov Institute of Control Sciences; Lomonosov State University; National Research University Higher School of Economics; Moscow Physical and Technical Institute (State University)
Author for correspondence.
Email: jobmath@mail.ru
Russian Federation, Moscow; Moscow; Moscow; Dolgoprudnyi
E. G. Musatova
Trapeznikov Institute of Control Sciences
Email: jobmath@mail.ru
Russian Federation, Moscow
I. A. Tarasov
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
Russian Federation, Moscow; Moscow
Supplementary files
