Two-staged algorithm for freight traffic’s route finding in constrained railway network
Informacionnye tehnologii i vyčislitelnye sistemy, no. 3 (2021), pp. 96-105
Cet article a éte moissonné depuis la source Math-Net.Ru
The article deals with the problem of freight trains’ route constructing in railway networks having capacity restrictions on stations and segments of lines that connect stations. This paper describes solving two-staged algorithm for this problem based on two approaches: methods of shortest path finding in graphs and linear problem solving methods. Developed algorithm quadratically depends of number of stations and linearly depends of number of freights, practical recommendations of reducing dependency of stations to linear is given in this article. This paper contains calculations until 10$^\wedge$10 dimension, comparative analysis of both approaches and their comparison with exact solution of this problem.
Keywords:
routing problem, railway network, freight traffic, cargo delivery.
@article{ITVS_2021_3_a8,
author = {A. Yu. Kuznetsova},
title = {Two-staged algorithm for freight traffic{\textquoteright}s route finding in constrained railway network},
journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
pages = {96--105},
year = {2021},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ITVS_2021_3_a8/}
}
TY - JOUR AU - A. Yu. Kuznetsova TI - Two-staged algorithm for freight traffic’s route finding in constrained railway network JO - Informacionnye tehnologii i vyčislitelnye sistemy PY - 2021 SP - 96 EP - 105 IS - 3 UR - http://geodesic.mathdoc.fr/item/ITVS_2021_3_a8/ LA - ru ID - ITVS_2021_3_a8 ER -
A. Yu. Kuznetsova. Two-staged algorithm for freight traffic’s route finding in constrained railway network. Informacionnye tehnologii i vyčislitelnye sistemy, no. 3 (2021), pp. 96-105. http://geodesic.mathdoc.fr/item/ITVS_2021_3_a8/