RUS  ENG
Full version
JOURNALS // Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie // Archive

Vestnik YuUrGU. Ser. Mat. Model. Progr., 2021 Volume 14, Issue 3, Pages 61–76 (Mi vyuru607)

This article is cited in 3 papers

Programming and Computer Software

On the scheduling problem of cargo transportation on a railway network segment and algorithms for its solution

A. N. Ignatov

Moscow Aviation Institute, Moscow, Russian Federation

Abstract: We consider the problem of scheduling cargo transportation on a railway network segment. The railway network is represented by an undirected multigraph. The traffic along the edges of the multigraph is carried out only at certain intervals – using “subthreads”. We formulate a new mathematical model of traffic along the edges of the multigraph. A universal criterion of optimality for the scheduling problem is proposed. We propose an algorithm to find a suboptimal solution. A meaningful example is given.

Keywords: multigraph, cargo transportation, railway network, timetable, mixed integer linear programming.

UDC: 519.85

MSC: 90C90, 90C11, 05C38

Received: 27.04.2021

Language: English

DOI: 10.14529/mmp210305



© Steklov Math. Inst. of RAS, 2026