Applying Constraint Programming and Integer Programming to Solve the Crew Scheduling Problem for Railroad Systems: Model Formulation and a Case study

Crew scheduling is one of the crucial processes in railroad operation planning. Based on current regulations, working and break time requirements, as well as the operational rules, this process aims to find a duty arrangement with minimal cost that covers all trips. Most past studies considered this subject for railroad systems as an optimization problem and solve it with mathematical programming based methods or heuristic algorithms, despite numerous logical constraints embedded in this problem. Few studies have applied constraint programming approaches to tackle the railroad crew scheduling problem. In this paper, the authors propose a hybrid approach to solve the problem with a constraint programming model for duty generation, and an integer programming model for duty optimization. The authors have applied these models to the Kaohsiung depot of Taiwan Railways Administration, the largest and the only railroad operator in Taiwan. The encouraging results show that the proposed approach is more efficient than the manual process and can achieve 30% savings of driver cost. Moreover, the approach is robust and provides flexibility to easily accommodate related operational concerns such as minimizing the number of overnight duties. Thus, this hybrid two-phase approach seems to have the potential for applications to the railroad crew scheduling problems outside Taiwan.

Language

  • English

Media Info

  • Media Type: Digital/other
  • Features: Figures; Maps; References; Tables;
  • Pagination: 19p

Subject/Index Terms

Filing Info

  • Accession Number: 01763784
  • Record Type: Publication
  • Report/Paper Numbers: TRBAM-21-01120
  • Files: TRIS, TRB, ATRI
  • Created Date: Dec 23 2020 11:11AM