Integrated Crew Scheduling and Roster Problem for Trainmasters of Passenger Railway Transportation

Dung Ying Lin, Meng Rung Tsai

研究成果: Article同行評審

10 引文 斯高帕斯(Scopus)

摘要

Train crew management is an imperative task in a passenger railway system and is typically decomposed into two sub-problems: crew scheduling problem and crew rostering problem. The decomposition can make the problem easier to solve but may produce degraded solutions. In this paper, we propose a formulation to integrate these two critical sub-problems and develop a branch-and-price-and-cut algorithm and a depth-first search-based algorithm to solve the composite problem. The numerical results show that an integrated framework can yield better solutions than the decomposition strategy. Furthermore, results also show that the rostering constraints have a more notable effect on the results compared with the scheduling constraints in the integrated framework. This type of observation can only be accurately characterized when these two sub-problems are considered in an integrated manner.

原文English
文章編號8643912
頁(從 - 到)27362-27375
頁數14
期刊IEEE Access
7
DOIs
出版狀態Published - 2019

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)
  • 材料科學(全部)
  • 工程 (全部)

指紋

深入研究「Integrated Crew Scheduling and Roster Problem for Trainmasters of Passenger Railway Transportation」主題。共同形成了獨特的指紋。

引用此