基于非值乘时间成本的乘务排班计划优化编制方法研究  

Research on Optimization of Crew Scheduling Based on the Cost of Non-duty Time

作　　者：马竞驰 徐展治 MA Jingchi;XU Zhanzhi(School of Urban Rail Transit,Shanghai University of Engineering Science,Shanghai 201620,China)

机构地区：[1]上海工程技术大学城市轨道交通学院,上海201620

出　　处：《物流科技》2024年第4期8-13,40,共7页Logistics Sci-Tech

摘　　要：乘务排班计划是城市轨道交通运输计划的重要组成部分,其编制方案优劣直接影响企业运营安全与乘务支出。在班制规定工作时间内,非值乘时间占比越高,工作所需人力资源越多,运营支出效益越低。文章通过缩减乘务人员非值乘时间中的非必要整备时间,从时间成本角度出发,构建最小费用模型。同时设计以爬山算法作为局部搜索策略的文化基因算法,用于优化传统遗传算法对于解的早熟或不收敛导致局部最优的潜在可能。最后以上海市轨道交通某条线路作为案例研究,结果表明模型能够在满足运营需求的前提下,优化乘务人员数量,从而降低乘务支出。其研究结果可为城市轨道交通精细化管理提供理论依据和参考。Crew scheduling plan is an important part of urban rail transportation plan,and the quality of its compilation program directly affects the enterprise operation safety and crew expenditure.The higher proportion of non⁃duty time in the working time of the shift system,the more human resources are needed,and the lower benefits of the operation expenditure.This paper constructs the minimum cost model from the perspective of time cost by reducing the non⁃essential preparation time in non⁃duty time of the crew.Meanwhile,the cultural genetic algorithm with hill⁃climbing algorithm as the local search strategy is designed for optimizing the potential of the traditional genetic algorithm for the solution's precocity or non⁃convergence.Finally,a line of Shanghai rail transit is used as a case study,and the results show that the model in this paper can optimize the number of crew members under the premise of meeting the operational demand,thus reducing the expenditure on crewing.The results can provide theoretical basis and references for urban rail transit refinement management.

关 键 词：乘务排班计划 非值乘时间损耗 最小费用 文化基因算法 

分 类 号：F253[经济管理—国民经济] U293.1[交通运输工程—交通运输规划与管理]