Rail Crew Scheduling Based on a Pooling Mode for High Speed Passenger Lines

Yindong Shen, Shijun Chen, Xuan Su
{"title":"Rail Crew Scheduling Based on a Pooling Mode for High Speed Passenger Lines","authors":"Yindong Shen, Shijun Chen, Xuan Su","doi":"10.1109/LEITS.2010.5665032","DOIUrl":null,"url":null,"abstract":"Rail high-speed passenger lines (HSPL) have been developed rapidly in China; however, the traditional rail crew scheduling mode called responsible mode, in which crews are bundled with vehicles, is hard to adapt to the transit characteristic of HSPL. Moreover, the utilization of rail crew resources is commonly inefficient and the scheduling methods are generally behindhand. To reduce the pressure of high cost and lacking qualified crew in HSPL, a pooling crew scheduling mode should be applied and would be a trend, which can help rail agencies increase the utilization of crew resources and managerial levels. Under the pooling mode, the crew scheduling problem becomes much more complicated, known to be NP-hard. A set covering model is applied, in which the variables represent precompiled potential shifts and each shift must conform to a set of labor agreement rules. The model is solved by ILOG - an advanced optimization tool and tested with a real-world problem instance, which is abstracted from Guangzhou-Shenzhen high-speed line. The computational results show that the model and method are effective and efficient.","PeriodicalId":173716,"journal":{"name":"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LEITS.2010.5665032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Rail high-speed passenger lines (HSPL) have been developed rapidly in China; however, the traditional rail crew scheduling mode called responsible mode, in which crews are bundled with vehicles, is hard to adapt to the transit characteristic of HSPL. Moreover, the utilization of rail crew resources is commonly inefficient and the scheduling methods are generally behindhand. To reduce the pressure of high cost and lacking qualified crew in HSPL, a pooling crew scheduling mode should be applied and would be a trend, which can help rail agencies increase the utilization of crew resources and managerial levels. Under the pooling mode, the crew scheduling problem becomes much more complicated, known to be NP-hard. A set covering model is applied, in which the variables represent precompiled potential shifts and each shift must conform to a set of labor agreement rules. The model is solved by ILOG - an advanced optimization tool and tested with a real-world problem instance, which is abstracted from Guangzhou-Shenzhen high-speed line. The computational results show that the model and method are effective and efficient.
基于合流模式的高速客运线路乘员调度
高速客运铁路(HSPL)在中国发展迅速;然而,传统的列车班组调度模式,即将班组与车辆捆绑在一起的责任调度模式,很难适应高铁的运输特点。此外,铁路人员资源的利用效率普遍低下,调度方法普遍滞后。为了减轻高铁高成本和缺乏高素质班组人员的压力,应采用合组班组调度模式,这将是一个趋势,可以帮助铁路机构提高班组资源的利用率和管理水平。在池化模式下,机组调度问题变得更加复杂,被称为np困难。采用集合覆盖模型,其中变量表示预编译的潜在班次,每个班次必须符合一组劳动协议规则。利用先进的优化工具ILOG对模型进行求解,并以广深高铁抽象的实际问题实例进行了验证。计算结果表明,该模型和方法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信