To meet the operational requirements and to ensure safe operations, train units of a passenger railway operator require inspection and/or cleaning at the maintenance depots after running a specified mileage or time period. Accordingly, these inspection and cleaning activities are called depot services. In this paper, we propose an integer linear programming (ILP) model for the integrated optimization problem of depot service scheduling, train parking, and train routing. Both short trains (8 marshaling) and long trains (16 marshaling) are considered in the ILP model which is a combinational optimization problem in the dead-end tracks scenario. Moreover, a real-world case study of the Shanghai South Depot, China is carried out to further examine the effectiveness and efficiency of the proposed methodology. Computational results indicate that our method is able to generate optimized shunting plans for the linearized INLP within reasonable solution time for real-life applications, outperforming the manual method in terms of the solution quality and the computation speed.
3 June 2023 in Transportation Research Part B: Methodological
As air pollution becomes increasingly severe, express trains play a more important role in shifting road freight and reducing carbon emissions. Thus, the design of railway express shipment service networks has become a key issue, which needs to be addressed urgently both in theory and practice. The railway express shipment service network design problem (RESSNDP) not only involves the selection of train services and determination of service frequency, but it is also associated with shipment routing, which can be viewed as a service network design problem (SNDP) with railway characteristics. This paper proposes a non-linear integer programming model (INLP) which aims at finding a service network and shipment routing plan with minimum cost while satisfying the transportation time constraints of shipments, carrying capacity constraints of train services, flow conservation constraint and logical constraints among decision variables. In addition, a linearization technique was adopted to transform our model into a linear one to obtain a global optimal solution. To evaluate the effectiveness and efficiency of our approach, a small trial problem was solved by the state-of-the-art mathematical programming solver Gurobi 7.5.2.
This paper presents the formulation of a train formation problem in rail loading stations (TFLS) from the systematic perspective. Several patterns of train formation are analyzed thoroughly before modeling, including direct single-commodity trains, direct multi-commodity trains created in the loading stations, and direct trains originating from reclassification yards. One of the crucial preconditions is that the loading and unloading efficiencies in the loading stations and the relational unloading stations are symmetric. Based on this, a non-linear 0–1 programming model is designed with the aim of minimizing the total car-hour cost incurred by the loading, unloading, and reclassification operations, and the commercial software Lingo is employed as the solving approach. A small-scale example is carried out first to illustrate the validity of the presented model and the effectiveness of the proposed method. Then, a series of numerical cases are devised to test the model and solving approach. The computational results show that our model can be regarded as a theoretical foundation of the TFLS problem.
5 October 2020 in IEEE Intelligent Transportation Systems Magazine