Weekly crew scheduling for freight rail engineers: A network approach

IF 2.6 Q3 TRANSPORTATION
Jinhua Lyu, Jonathan F. Bard
{"title":"Weekly crew scheduling for freight rail engineers: A network approach","authors":"Jinhua Lyu,&nbsp;Jonathan F. Bard","doi":"10.1016/j.jrtpm.2025.100519","DOIUrl":null,"url":null,"abstract":"<div><div>Freight rail engineers and conductors have long faced unpredictable and inflexible work schedules, leading to on-the-job fatigue, compromised safety, and poor work-life balance. This paper aims to construct robust weekly schedules for these crew members to alleviate the pressures associated with irregular and unpredictable work hours. The scheduling problem is formulated as a multi-commodity network flow problem on a directed time-space graph. Both two-city and three-city districts are addressed. To account for the variability in travel times, a set of scenarios is defined in which demand is increased by up to 20% to build slack into the schedules. The results are validated using Monte Carlo simulation where 100 random weekly instances are generated for each city pair and key performance metrics assessed. Major findings show that (i) optimal weekly schedules can be constructed in minutes for engineers in crew districts with two cities, and in several hours for engineers in crew districts with three cities, (ii) different percentages of demand increase significantly affect the degree of robustness, and (iii) forming crew districts with three cities rather than two gives better results in terms of required number of engineers and trip coverage rates.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"34 ","pages":"Article 100519"},"PeriodicalIF":2.6000,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Rail Transport Planning & Management","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210970625000162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

Freight rail engineers and conductors have long faced unpredictable and inflexible work schedules, leading to on-the-job fatigue, compromised safety, and poor work-life balance. This paper aims to construct robust weekly schedules for these crew members to alleviate the pressures associated with irregular and unpredictable work hours. The scheduling problem is formulated as a multi-commodity network flow problem on a directed time-space graph. Both two-city and three-city districts are addressed. To account for the variability in travel times, a set of scenarios is defined in which demand is increased by up to 20% to build slack into the schedules. The results are validated using Monte Carlo simulation where 100 random weekly instances are generated for each city pair and key performance metrics assessed. Major findings show that (i) optimal weekly schedules can be constructed in minutes for engineers in crew districts with two cities, and in several hours for engineers in crew districts with three cities, (ii) different percentages of demand increase significantly affect the degree of robustness, and (iii) forming crew districts with three cities rather than two gives better results in terms of required number of engineers and trip coverage rates.
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.10
自引率
8.10%
发文量
41
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信