期刊文献+

城市轨道交通乘务夜早任务搭配模型研究 被引量:4

Early and Late Tasks Pairing Model for Urban Rail Transit Crew
下载PDF
导出
摘要 乘务夜早任务连乘是我国城市轨道交通(以下简为"城轨")乘务普遍采用的轮转策略。编制良好的乘务夜早任务搭配方案可保证乘务员工作的均衡性和安全性。根据城轨乘务夜早任务连乘需求,建立了相应的最优分配模型(NMC模型),设计了夜早连乘任务综合费用函数,并结合传统的匈牙利算法对NMC模型进行了求解。以某地铁线路为例,进行了算例分析。结果表明,NMC模型所编制的夜早连乘方案能够满足现场需求,可提高乘务夜早任务搭配的效率。 The early and late tasks pairing rotation strategy is widely adopted by urban rail transit crew in China.A good composition of the early and late tasks pairing scheme can ensure the balance and security of attendants work.Based on the demands of early and late tasks pairing tasks,an optimal allocation model(NMC)is established and a cost function of early and late tasks pairing rotation is designed combined with the traditional Hungarian algorithm to solve the NMC model.A numerical example of a certain rail transit line is analyzed,and the result indicates that the scheme complied by model could meet the field demands and improve the efficiency of the tasks.
出处 《城市轨道交通研究》 北大核心 2016年第7期30-34,共5页 Urban Mass Transit
基金 中国博士后科学基金项目(2014M551454) 国家自然科学基金项目(71271153)
关键词 城市轨道交通 乘务计划编制 夜早任务搭配 最优分配 urban rail transit crew schedule plan early and late tasks pairing optimal allocation
  • 相关文献

参考文献11

  • 1王英,辛继伟,陈海建,张平,刘呈雅.地铁乘务管理体系标准化探讨[J].都市快轨交通,2013,26(3):62-65. 被引量:8
  • 2石俊刚,史宏杰,徐瑞华.城市轨道交通乘务任务划分模型及算法研究[J].铁道学报,2014,36(5):1-7. 被引量:16
  • 3石俊刚,周峰,徐瑞华.城轨交通乘务任务配对的集合分割模型及算法[J].同济大学学报(自然科学版),2015,43(2):232-238. 被引量:8
  • 4BEASLEY J E. An algorithm for set covering problems[J]. European Journal of Operational Research, 1987,31 (1) .. 85. 被引量:1
  • 5KARLAL, HOFFMAN, MANFRED Padberg. Solving airline crew scheduling problems by branch-and-cut [J]. Management Science, 1993,39 (6) : 657. 被引量:1
  • 6MARSTEN R E,SHEPARDSON F. Exact solutionof crew scheduling problems using the set partitioning model: recent successful applications[J]. Networks, 1981,11 (2) .. 165. 被引量:1
  • 7WEDELIN Dag. An algorithm for large scale 0 - 1 integer programming with applicationto airline crew scheduling[J]. Annals of Operations Research, 1995,57 ( 1 ) : 283. 被引量:1
  • 8LAN Guanghui, DEPUY Gail W, WHITEHOUSE Gary E. An effective and simple heuristic for the set covering Problem[J]. European Journal of Operational Research, 2007,176(3) : 1387. 被引量:1
  • 9KOHLNiklas. Airline crew rostering: problem types, modeling and optimization [ J ]. Annals of Operations Research,2004,127(1 - 4) :223. 被引量:1
  • 10傅家良..运筹学方法与模型[M],2006.

二级参考文献36

共引文献36

同被引文献13

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部