铁路客运乘务排班计划编制模型及算法  

Model and Algorithm for Railway Passenger Crew Rostering Plan

作　　者：杨国元[1] 史天运[2] 张秋亮[2] 

机构地区：[1]中国铁道科学研究院,北京100081 [2]中国铁道科学研究院电子计算技术研究所,北京100081

出　　处：《交通运输系统工程与信息》2016年第4期159-164,共6页Journal of Transportation Systems Engineering and Information Technology

基　　金：铁道部科技研究开发计划项目(2011X014-D);中国铁道科学研究院基金项目(2010YJ07)~~

摘　　要：针对铁路客运部门对乘务排班计划编制的问题,分析了车次、交路、乘务员、乘务工时之间的关系.在已知乘务员标准月度乘务工时的前提下,以交路和乘务工时为主要约束条件,以减少乘务班组、降低乘务费用为优化目标,建立客运乘务排班计划编制模型.根据车次之间到发站、到发时间的接续关系,求解符合乘务工时的车次与交路匹配的可行性路径集合,以该集合为基础,提出了求解模型,并设计了基于遗传算法的模型求解算法.通过对某一客运段的车次、班组数据进行算例分析,仿真实验,验证了所提出模型和设计算法可有效解决客运乘务排班计划的编制问题,可降低乘务费用.For the question of the crew rostering planning of railway passenger transport department, it is analyzed the relationship of the trains, train routes, crews, and crew working hours. On the premise of known the standard monthly crew working hours, a crew rostering plan model is built for railway passenger transport department. The model is based on the constraints of train routes and crew working hours. The optimization objective of the model is to reduce crew team and crew cost. According to the train connection relationship between arriving station and departing station and between arriving time and departing time, the feasible paths set of matching trains and train routes of meeting crew working hours is solved. Based on this set, the solving model is proposed and the solving algorithm based on genetic algorithm is designed in this paper. By analyzing and stimulating an example of trains and crew teams of a passenger department, it shows that the proposed model and designed algorithm can effectively solve the problem of passenger transport crew rostering planning and reduce crew cost.

关 键 词：信息技术 铁路客运 乘务排班计划 乘务交路 遗传算法 

分 类 号：U292.4[交通运输工程—交通运输规划与管理]