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.
Citation:
A. N. Ignatov, “On the scheduling problem of cargo transportation on a railway network segment and algorithms for its solution”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 14:3 (2021), 61–76
\Bibitem{Ign21}
\by A.~N.~Ignatov
\paper On the scheduling problem of cargo transportation on a railway network segment and algorithms for its solution
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2021
\vol 14
\issue 3
\pages 61--76
\mathnet{http://mi.mathnet.ru/vyuru607}
\crossref{https://doi.org/10.14529/mmp210305}
Linking options:
https://www.mathnet.ru/eng/vyuru607
https://www.mathnet.ru/eng/vyuru/v14/i3/p61
This publication is cited in the following 3 articles:
Citation in format AMSBIB
Contact us: