基于改进蚁群算法的高铁乘务计划编制分析  

Analysis of High-speed Rail Crew Plan Based on Improved Ant Colony Algorithm

作　　者：张睿 ZHANG Rui(Shaanxi Institute of Technology,Xi’an Shaanxi 710300)

机构地区：[1]陕西国防工业职业技术学院,陕西西安710300

出　　处：《陕西国防职教研究》2022年第2期45-47,共3页Shaanxi Guofang Vocational Education Research

摘　　要：乘务编制计划问题是一个具有时空变化的单基础多旅客指派问题,它提高了列车乘务计划的质量和效率。针对单元线间冗余连接时间最短、最均衡的问题,建立了单循环单元计划问题的数学模型,并以改进蚁群算法为例,首先建立满足空间时间约束的初始解,将信息素浓度分别放在各单元的路径节点上;建立连续路径。在提出的模型和算法验证方面,采用微粒群算法,实验结果表明,在相同的模型条件下,基于改进蚁群算法的交通服务月平均乘务计划时数减少8.5%,计划周期缩短9.4%,拥挤率达到0%,可缩短乘务运行周期,降低乘务成本,补偿乘务利用率,避免乘务超负荷运行。The crew planning problem is a single-base multi-passenger assignment problem with space-time variation,which improves the quality and efficiency of train crew plans.For the shortest and most balanced redundant connection time between cell lines,the mathematical model of single cycle unit planning is established.and the improved ant colony algorithm is taken as an example,the initial solution that meets the spacetime constraint is established,and the pheromone concentration is placed on the path node of each unit;the continuous path is established.In terms of the proposed model and algorithm verification,using the particle group algorithm,the experimental results show that under the same model conditions,the average monthly traffic service time decreases by 8.5%,shorten the plan period by 9.4%,and the crowding rate reaches 0%,which can shorten the crew operation cycle,reduce the crew cost,compensate the crew utilization,and avoid the crew overload operation.

关 键 词：蚁群算法 改进 高速铁路 乘务排班计划编制 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] U292.4[自动化与计算机技术—计算机科学与技术]