Rolling Stock Rostering Optimization Under Maintenance Constraints

  title={Rolling Stock Rostering Optimization Under Maintenance Constraints},
  author={Giovanni Luca Giacco and Andrea D’Ariano and Dario Pacciarelli},
  journal={Journal of Intelligent Transportation Systems},
  pages={105 - 95}
This article presents a mixed-integer linear-programming formulation for integrating short-term maintenance planning in a network-wide railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires covering a given set of services and maintenance works with a minimum amount of rolling stock units. In our formulation, a rostering solution is viewed as a minimal cost Hamiltonian cycle in a graph with service pairings, empty runs, and short-term… 

Integrated Optimization of Rolling Stock Rotations for Intercity Railways

A generic hypergraph-based mixed-integer programming model for the considered rolling stock rotation problem and an integrated algorithm for its solution are proposed that is able to handle a large spectrum of industrial railway requirements.

Optimization of Rolling Stock Rostering Under Mutual Direct Operation

This paper aims to create an optimal schedule for a railway line where “mutual direct operation” is being conducted, and extends the formulation to create a schedule for multiple companies to apply to mutual direct operation.

Re-Optimization of Rolling Stock Rotations

An integrated modeling and algorithmic approach to the Rolling Stock Rotation Problem as well as computational results for industrial problem instances of DB Fernverkehr AG are presented.

A Mixed Integer Linear Programming Approach to a Rolling Stock Rostering Problem with Splitting and Combining

A mixed integer linear programming model is presented so that the amount of splitting and combining is reduced together with the roster length and the distance of empty runs and with respect to the reasonableness of the resultant rosters.

Short-term rolling stock rostering and maintenance scheduling optimization [Ottimizzazione della circolazione del materiale rotabile e dei processi manutentivi nel breve periodo]

This paper describes an optimization framework for rolling stock rostering and maintenance scheduling at a busy workshop and shows how the proposed method can be used as an effective tool to absorb real-time timetable perturbations while respecting the agreed level of service.

Optimized Train-Set Rostering Plan for Taiwan High-Speed Rail

An exact optimization model and a heuristic method to automate the rolling stock rostering efficiency process and improve the efficiency of rolling stock utilization are developed.



Maintenance Routing for Train Units: The Transition Model

It turns out that the feasibility problem for a single urgent train unit is polynomially solvable but the optimisation version is NP-hard, so a less involved multicommodity flow type model for this maintenance routing problem is described.

A Hypergraph Model for Railway Vehicle Rotation Planning

A hypergraph model that is able to handle the challenging technical requirements as well as very general stipulations with respect to the "regularity" of a schedule is proposed, and large-scale real world instances of DB Fernverkehr can be solved.

Scheduling preventive railway maintenance activities

This paper presents two versions of the PMSP, one with fixed intervals between two consecutive executions of the same routine work, and one with only a maximum interval, and compares the performance of these heuristics with the optimal solution using some randomly generated instances.

A Lagrangian heuristic algorithm for a real-world train timetabling problem

Railway Track Allocation - Simulation and Optimization

A renewed planning process due to the liberalization in Europe and a general framework to support the integration of simulation and optimization for railway capacity allocation are presented.

Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations

This paper heuristically modify network based solutions to account for remaining constraints, and presents experimental results from this approach on real data from the German Railway and Swiss Federal Railway.

Efficient Circulation of Railway Rolling Stock

This paper presents aninteger programming approach to solve the circulation of train units on a single line and applies this approach to a real life case study based on the 2001-2002 timetable of NS Reizigers, the major Dutch operator of passenger trains.

Network Models in Railroad Planning and Scheduling

Algorithms are described that can solve very large-scale integer programming problems containing billions or even trillions of integer variables within one to two hours of computational time, which are currently being solved manually by U.S. railroads.

Flexible Train Rostering

This work considers whether allowing certain flexibility in the departure times of scheduled routes may reduce the number of vehicles needed, and forms the question as the Flexible Train Rostering problem.