Abstract

Planned maintenance and construction activities are crucial for heavily used railway networks to cope with the ever increasing demand. These activities lead to changes in the timetable and rolling stock schedule (often for multiple days) and can have a major impact on the crew schedule, as the changes can render many planned duties infeasible. In this paper, we propose a novel integrated approach to crew re-planning, i.e., the construction of new duties and rosters for the employees given changes in the timetable and rolling stock schedule. In current practice, the feasibility of the new rosters is ‘assured’ by allowing the new duties to deviate only slightly from the original ones. This allows the problem to be solved on a day-by-day basis. In the Integrated Crew Re-Planning Problem (ICRPP), we loosen this requirement and allow for more flexibility: The ICRPP considers the re-scheduling of crew for multiple days simultaneously, thereby explicitly taking the feasibility of the rosters into account. By integrating the scheduling and rostering decisions, we can allow for larger deviations from the original duties. We propose a mathematical formulation for the ICRPP, strengthen it using a family of valid cover inequalities, and develop a column generation approach to solve the problem. We apply our solution approach to practical instances from Netherlands Railways, and show the benefits of integrating the re-planning process.

Highlights

  • Large maintenance and construction projects are crucial for heavily used railway networks to cope with the ever increasing demand

  • The Integrated Crew Re-Planning Problem (ICRPP) further complicates the Crew Re-Scheduling Problem (CRSP) due to (i) the size of the problem, as multiple days need to be re-scheduled at once, and (ii) the possibility of larger shifts in start and end time, implying that the feasibility of the rosters should be taken into account explicitly

  • We introduced the Integrated Crew Re-Planning Problem (ICRPP), an integrated approach for crew re-scheduling over multiple days

Read more

Summary

A Column Generation Approach for the Integrated Crew Re-Planning Problem

We propose a column generation approach for crew re-planning, i.e., the construction of new duties and rosters for the employees, given changes in the timetable and rolling stock schedule. The feasibility of the new rosters is ‘assured’ by allowing the new duties to deviate only slightly from the original ones. In the Integrated Crew Re-Planning Problem (ICRPP), we loosen this requirement and allow more flexibility: The ICRPP considers the re-scheduling of crew for multiple days simultaneously, thereby explicitly taking the feasibility of the rosters into account, and allowing arbitrary deviations from the original duties. We propose a mathematical formulation for the ICRPP and develop a column generation approach to solve the problem. We apply our solution approach to practical instances from NS, and show the benefit of integrating the re-scheduling process

Introduction
Problem Description
Literature Review
Mathematical Formulation
Solution Approach
Iterative Selection Procedure
Selecting Alternative Rosters
Pricing Problem
Acceleration Strategies
Computational Experiments
Case Study
Analysis of Acceleration Strategies
Results Iterative Selection Procedure
Objective
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.