The passenger transportation-like organisation strategy is conducive to enhancing the market competitiveness of railway container transportation. However, many problems incurred by this strategy should be solved. This study focuses on the daily container-to-train assignment problem. Considering the fluctuations of daily container demand, an integer linear programming model is formulated to deal with the normal, congested, and insufficient demand scenarios. The objectives correspond to the three scenarios are to minimise the total transportation time of all containers, the number of remaining containers, and the number of operating trains, respectively. Finally, numerical experiments were conducted on a hypothetical railway line and the Lianyungang-Alataw pass railway corridor to demonstrate the application of the proposed approach.
6 October 2023 in Journal of Rail Transport Planning & Management
This paper focuses on daily freight train scheduling and dynamic railcar routing problems for rail freight transportation at the operational level. Two mixed integer linear programming models that adopted different strategies were formulated based on a continuous two-layer time-space network. We simultaneously considered the benefits of railroad company and service quality when setting the objective function. By solving the models, we can distribute the dynamic railcar flows to the train paths in the basic train timetable to obtain the daily train operation plan over a short time horizon (e.g. a day), which will be helpful for dispatchers to make decisions such as the empty railcar distribution and car routing (trip planning). Finally, we compared two models on a part of the Chinese railroad network. The results show that the second model can effectively improve the efficiency of railroad freight transportation.