Abstract:The model for organizing railway transportation on a long stretch of road between two node stations connected by a large number of intermediate stations is investigated. It allows to predict dynamics of load of the stations and flows arising in transport network at the set procedure of the movement of freight traffic. Such model is given by a system of differential equations with discontinuous right parts and satisfying the conditions setting resource restrictions. The numerical realization of this system is c… Show more
“…The second group, in particular, is represented by the tasks of forming the timetable of freight trains, as well as the tasks of forming freight flows [5,6]. One of the approaches to the formation of cargo traffic is presented in the works of Khachatryan and Beklaryan [7][8][9][10][11][12][13][14][15][16]. These articles present macroscopic dynamic models in which the process of organizing railway freight transportation is the formation of freight traffic based on the interaction of neighboring stations.…”
This paper considers the problem of optimal management of a fleet of freight cars by a transport railway operator. The solution to this problem is an optimal plan, which is a timetable for the movement of freight and empty railway cars, following which the transport operator will receive the maximum profit for the estimated period of time. This problem is reduced to the problem of linear programming of large dimension. Unlike the works of other authors on this topic, which mainly deal with methods of numerical solution of the corresponding linear programming problems, this article focuses on an algorithm that allows one to reduce their dimensionality. This can be achieved by excluding from the calculation those routes that obviously cannot be involved in the solution, or whose probability of participation in the final solution is estimated as extremely low. The effectiveness of the proposed modified algorithm was confirmed both on a model example (several stations, a short planning horizon) and on a real example (more than 1.000 stations, a long planning horizon). In the first case, there was a decrease in the dimension of the problem by 44%, while in the second – by 30 times.
“…The second group, in particular, is represented by the tasks of forming the timetable of freight trains, as well as the tasks of forming freight flows [5,6]. One of the approaches to the formation of cargo traffic is presented in the works of Khachatryan and Beklaryan [7][8][9][10][11][12][13][14][15][16]. These articles present macroscopic dynamic models in which the process of organizing railway freight transportation is the formation of freight traffic based on the interaction of neighboring stations.…”
This paper considers the problem of optimal management of a fleet of freight cars by a transport railway operator. The solution to this problem is an optimal plan, which is a timetable for the movement of freight and empty railway cars, following which the transport operator will receive the maximum profit for the estimated period of time. This problem is reduced to the problem of linear programming of large dimension. Unlike the works of other authors on this topic, which mainly deal with methods of numerical solution of the corresponding linear programming problems, this article focuses on an algorithm that allows one to reduce their dimensionality. This can be achieved by excluding from the calculation those routes that obviously cannot be involved in the solution, or whose probability of participation in the final solution is estimated as extremely low. The effectiveness of the proposed modified algorithm was confirmed both on a model example (several stations, a short planning horizon) and on a real example (more than 1.000 stations, a long planning horizon). In the first case, there was a decrease in the dimension of the problem by 44%, while in the second – by 30 times.
“…In the papers(see [11], [12], [13], [14], [15]) a model of the organization of cargo transportation on an extended route between two node stations is investigated. It is assumed that there is a special area between the two neighboring stations where part of the cargo can be temporarily stored in case of high load of stations.…”
This article is devoted to the study of the model of the organization of railway cargo transportation on the section of the railway network between two node stations. The main characteristic of the stations is the inconsistency degree between the reception and dispatch of goods, which is the difference between the volume of incoming and outgoing cargo per unit of time. It is important for the smooth organization of cargo transportation that the specified characteristic has small values over time at all stations. The modes of cargo transportation under which this will be carried out have been identified.
“…This article presents a macroscopic dynamic model describing the movement of railway transport between two node stations. The main difference from similar models (see [18], [19], [20], [21], [22]) is the rejection of the assumption that there are special roads between stations for temporary storage of part of the cargo in case of high load of stations, as well as modification of the station capacity setting. To the initial node station cargo it is received with some intensity within its capacity.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.