交通运输系统工程与信息 ›› 2025, Vol. 25 ›› Issue (1): 133-145.DOI: 10.16097/j.cnki.1009-6744.2025.01.014

• 系统工程理论与方法 • 上一篇    下一篇

限定便乘位置的城轨乘务排班计划编制方法研究

田志强*1,2,王付霞1,连惠1,靳欣妮1,孙国锋3   

  1. 1. 兰州交通大学,交通运输学院,兰州730070;2.高原铁路运输智慧管控铁路行业重点实验室,兰州730070;3. 北京交通大学,交通运输学院,北京100044
  • 收稿日期:2024-11-09 修回日期:2024-12-10 接受日期:2024-12-23 出版日期:2025-02-25 发布日期:2025-02-21
  • 作者简介:田志强(1981—),男,甘肃武威人,教授,博士。
  • 基金资助:
    国家自然科学基金(72161023, 71761023);西部铁路智能运维与管控关键技术研究(24ZYQA044)。

Urban Rail Crew Scheduling Plan Optimization Method with Limited Deadheading Position

TIAN Zhiqiang*1,2, WANG Fuxia1, LIAN Hui1, JIN Xinni1, SUN Guofeng3   

  1. 1. School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China; 2. Key Laboratory of Railway Industry on Plateau Railway Transportation Intelligent Management and Control, Lanzhou 730070, China; 3. School of Traffic and Transportation, Beijing Jiaotong University, Bejing 100044, China
  • Received:2024-11-09 Revised:2024-12-10 Accepted:2024-12-23 Online:2025-02-25 Published:2025-02-21
  • Supported by:
    National Natural Science Foundation of China (72161023, 71761023);Research on Key Technologies of Intelligent Operation and Maintenance and Control of Western Railway(24ZYQA044)。

摘要: 在城市轨道交通乘务计划中,限定乘务人员便乘位置可以减少乘务班次使用数量,增加计划灵活性。首先,以乘务班次数量最少、非必要劳动时间及便乘时间最短为优化目标,考虑值乘区段覆盖、间休接续、工作时长限制、出退勤时间窗和就餐接续等约束,构建限定便乘位置的乘务排班计划0-1整数规划模型;其次,设计列生成算法求解模型,分解模型为集合覆盖线性松弛主问题和受资源约束最短路的定价子问题,通过构建基于列车时刻表的时空轴线网络,设计求解定价子问题的双向标签算法;最后,以某城市轨道交通1号线为背景验证模型和算法的有效性。结果表明:该案例生成早班、白班和夜班的数量分别为47、53和48;限定便乘位置后,各乘务班次的工作时长呈下降趋势,有效提高了乘务班次工作效率;与标签算法相比,双向标签算法的求解效率提升了40%。

关键词: 城市交通, 限定便乘位置, 列生成算法, 乘务排班计划, 标签算法

Abstract: In the urban rail transit crew plan, limiting the deadheading position of the crew can reduce the number of crew shifts and increase the flexibility of the plan. First, with the minimum number of crew shifts, the shortest non-essential labor time and the shortest convenience time as the optimization goals, this paper proposes the 0-1 integer programming model of the crew scheduling plan with limited deadheading positions considering the constraints of the coverage of the multiplying section, the intermittent continuation, the limitation of working hours, the time window for departure and departure, and the continuation of meals. Then, the column generation algorithm is designed to solve the model, and the decomposition model is divided into the main problem of linear relaxation covered by the set and the shortest circuit of the pricing sub-problem. The bi-directional labeling algorithm for solving the pricing sub-problem is designed by constructing the spatio-temporal axis network based on the train timetable. The effectiveness of the model and algorithm is verified by a case study in a city rail transit line 1. The results showed that the number of morning, day and night shifts was respectively 47, 53 and 48. After limiting the deadheading position, the working time of each crew shift showed a downward trend, which could effectively improve the efficiency of the crew shift. Compared with the labeling algorithm, the solving efficiency of the two-way labeling algorithm is improved by 40%.

Key words: urban traffic, limited deadheading position, column generation algorithm, crew scheduling plan, label algorithm

中图分类号: