|
Avtomatika i Telemekhanika, 2016, Issue 11, Pages 158–174
(Mi at14603)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Topical issue
Two-directional traffic scheduling problem solution for a single-track railway with siding
A. A. Lazarevabcd, E. G. Musatovaa, I. A. Tarasovab a Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
b Lomonosov State University, Moscow, Russia
c National Research University Higher School of Economics, Moscow, Russia
d Moscow Physical and Technical Institute (State University), Dolgoprudnyi, Russia
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(n^2)$.
Citation:
A. A. Lazarev, E. G. Musatova, I. A. Tarasov, “Two-directional traffic scheduling problem solution for a single-track railway with siding”, Avtomat. i Telemekh., 2016, no. 11, 158–174; Autom. Remote Control, 77:12 (2016), 2118–2131
Linking options:
https://www.mathnet.ru/eng/at14603 https://www.mathnet.ru/eng/at/y2016/i11/p158
|
Statistics & downloads: |
Abstract page: | 213 | Full-text PDF : | 30 | References: | 31 | First page: | 15 |
|