Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
Transportation Science
Simultaneous Assignment of Locomotives and Cars to Passenger Trains
Operations Research
Journal of Global Optimization
Maintenance Routing for Train Units: The Transition Model
Transportation Science
Circulation of railway rolling stock: a branch-and-price approach
Computers and Operations Research
Circulation of railway rolling stock: a branch-and-price approach
Computers and Operations Research
Robust rolling stock in rapid transit networks
Computers and Operations Research
A search-based approach to the railway rolling stock allocation problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Models and algorithms for the train unit assignment problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A Lagrangian heuristic for a train-unit assignment problem
Discrete Applied Mathematics
Hi-index | 0.00 |
Railway rolling stock is one of the most significant cost components for operators of passenger trains. The efficient circulation of rolling stock is therefore one of the main objectives pursued in practice. This paper focuses on the determination of appropriate numbers of train units of different types together with their efficient circulation on a single line. To utilize the train units on this line in an efficient way, they are coupled to or uncoupled from the trains in certain stations according to the passengers' seat demand in peak and off-peak hours. Because coupling and uncoupling train units must respect specific rules related to the shunting possibilities in the stations, it is important to take into account the order of the train units in the trains. This aspect strongly increases the complexity of the rolling stock circulation problem. This paper presents a solution approach based on an integer multicommodity flow model with several additional constraints related to the shunting processes at the stations. The approach is applied to a real-life case study based on the timetable of NS Reizigers, the main Dutch operator of passenger trains.