运输组织基于固定区段轮乘制的列车乘务交路计划编制方法研究
|
摘要
为充分利用高速铁路列车密度大的规模效应灵活编制乘务交路,提高乘务间休时间和减少外段过夜次数,研究固定区段轮乘制下高速铁路列车乘务交路计划的编制问题。建立以乘务交路总接续费用和过夜费用最小的双目标优化模型,并采用改进的蚁群算法求解。以京沪高速铁路本线和部分跨线列车为研究对象,对比研究现有乘务模式与固定区段轮乘制乘务模式的优劣性。研究结果显示:所有方案中,原乘务方案所需乘务组数最少;2个分界点方案过夜次数最少;所需乘务组数随着分界点的增加而增加。
The high traffic density on high-speed railway makes it possible for operators to adopt a flexible crew scheduling system that may bring more rest hours and less night shifts on neighboring territories.This paper discusses measures to improve crew scheduling on high-speed railway lines under the Fixed-Section Pooling(FSP) mode,and it introduces a dual-objective model that highlights a combination of duties covering all trips at minimal cost.The augmented ant colony algorithm is applied to generate the solution.This paper conducts a case study on BeijingShanghai High-Speed Railway line to analyze the strengths and weaknesses of FSP over other models.The paper's findings include: 1.FSP requires less crew than a set of potential alternatives.2.The two-demarcation-point crew scheduling results in less night shifts.3.The size of train crew expands along with the increase of the demarcation points.
The high traffic density on high-speed railway makes it possible for operators to adopt a flexible crew scheduling system that may bring more rest hours and less night shifts on neighboring territories.This paper discusses measures to improve crew scheduling on high-speed railway lines under the Fixed-Section Pooling(FSP) mode,and it introduces a dual-objective model that highlights a combination of duties covering all trips at minimal cost.The augmented ant colony algorithm is applied to generate the solution.This paper conducts a case study on BeijingShanghai High-Speed Railway line to analyze the strengths and weaknesses of FSP over other models.The paper's findings include: 1.FSP requires less crew than a set of potential alternatives.2.The two-demarcation-point crew scheduling results in less night shifts.3.The size of train crew expands along with the increase of the demarcation points.
引文
[1]LUCAS P V,DANIEL P,DENNIS H,et al.Railway Crew Rescheduling with Retiming[J].Transportation Research Part C,2012(20):95-110.
[2]GUVENC S,BIROL Y.Tactical Crew Planning in Railways[J].Transportation Research Part E,2011(47):1221-1243.
[3]刘冰,崔艳萍,刘启钢.日本新干线乘务运用与启示[J].铁道运输与经济,2013,35(12):63-67.LIU Bing,CUI Yan-ping,LIU Qi-gang.Crew Using and Revelation of Japanese Shinkansen[J].Railway Transport and Economy,2013:35(12):63-67.
[4]聂磊,赵鹏,贾利民,等.客运专线运输组织技术[M].北京:北京交通大学出版社,2008.
[5]于得水.客运专线乘务计划编制系统的设计与实现[D].成都:西南交通大学,2007.
[6]赵鹏.高速铁路动车组和乘务员运用的研究[D].北京:北方交通大学,1998.
[7]邹红德.繁忙干线区段防止机车乘务员超劳对策分析[J].铁道运输与经济,2016,38(7):72-76.ZOU Hong-de.Analysis on Countermeasures of Preventing Locomotive Trainman Over-Working in Busy Main Line Section[J].Railway Transport and Economy,2016,38(7):72-76.
[8]林枫.基于Martins算法的联合运输最优路径规划[J].西南交通大学学报,2015,50(3):543-549.LIN Feng.Optimal Intermodal Transport Path Planning based on Martins Algorithm[J].Journal of Southwest Jiaotong University,2015,50(3):543-549.
[9]文永军.旅行商问题的两种智能算法[D].西安:西安电子科技大学,2010.
[10]王媛媛,周成晨,倪少权.基于蚁群算法的客运专线乘务交路计划编制方法研究[J].铁路计算机应用,2009,18(7):11-14.WANG Yuan-yuan,ZHOU Cheng-chen,NI Shao-quan.Study on Algorithm of Crew Routing Scheduling for Passenger Dedicated Line based on Ant Colony Optimization[J].Railway Computer Application,2009,18(7):11-14.
[2]GUVENC S,BIROL Y.Tactical Crew Planning in Railways[J].Transportation Research Part E,2011(47):1221-1243.
[3]刘冰,崔艳萍,刘启钢.日本新干线乘务运用与启示[J].铁道运输与经济,2013,35(12):63-67.LIU Bing,CUI Yan-ping,LIU Qi-gang.Crew Using and Revelation of Japanese Shinkansen[J].Railway Transport and Economy,2013:35(12):63-67.
[4]聂磊,赵鹏,贾利民,等.客运专线运输组织技术[M].北京:北京交通大学出版社,2008.
[5]于得水.客运专线乘务计划编制系统的设计与实现[D].成都:西南交通大学,2007.
[6]赵鹏.高速铁路动车组和乘务员运用的研究[D].北京:北方交通大学,1998.
[7]邹红德.繁忙干线区段防止机车乘务员超劳对策分析[J].铁道运输与经济,2016,38(7):72-76.ZOU Hong-de.Analysis on Countermeasures of Preventing Locomotive Trainman Over-Working in Busy Main Line Section[J].Railway Transport and Economy,2016,38(7):72-76.
[8]林枫.基于Martins算法的联合运输最优路径规划[J].西南交通大学学报,2015,50(3):543-549.LIN Feng.Optimal Intermodal Transport Path Planning based on Martins Algorithm[J].Journal of Southwest Jiaotong University,2015,50(3):543-549.
[9]文永军.旅行商问题的两种智能算法[D].西安:西安电子科技大学,2010.
[10]王媛媛,周成晨,倪少权.基于蚁群算法的客运专线乘务交路计划编制方法研究[J].铁路计算机应用,2009,18(7):11-14.WANG Yuan-yuan,ZHOU Cheng-chen,NI Shao-quan.Study on Algorithm of Crew Routing Scheduling for Passenger Dedicated Line based on Ant Colony Optimization[J].Railway Computer Application,2009,18(7):11-14.