The shunting scheduling of EMU first-level maintenance in a stub-end depot
The shunting scheduling of EMU first-level maintenance in a stub-end depot
复制标题
尾端车辆段动车组一级检修调车调度
DOI：
10.1007/s10696-022-09459-6
复制
发表时间：
2022-08
影响因子：
2.7
通讯作者：
Zikai Zhang
中科院分区：
文献类型：
--
作者：
Ming He;Qiuhua Tang;Jatinder N. D. Gupta;Di Yin;Zikai Zhang
在解决动车组一级检修调车计划问题时，现有文献大多假定所有列车只有一条检修进路，只考虑一个直通车辆段。它忽略了不同的维护路线和末梢仓库方面的特定问题特征，导致在这种特殊情况下生成的计划不可行。因此，本文研究了具有横向堆场结构的车辆段检修路线灵活的SSEFM问题。首先，建立了一个多目标混合整数线性规划(MILP)模型，以最大化存储区域的保留时间，最小化清洗和检查区域的超期停留时间。协调灵活的维护进路、列车调车冲突、轨道占用冲突、列车到发车时刻等约束之间的关系。针对这一NP难问题，提出了一种基于启发式的改进粒子群优化算法(EPSO)，并对其进行了两点改进。具体而言，设计了深度优先作业轨道分配、无冲突瓶颈轨道分配和右移轨道占用修复三条启发式规则，以保证调车计划的可行性。相应地，设计了三级译码机制，以获得接近最优的调车计划和较好的列车和进路序列。对交叉算子和变异算子进行了两点改进，提高了算法的探测和开发能力。最后，通过中国实际案例验证了所提模型和算法的有效性和高效性。实验结果表明，EPSO算法比所有比较的算法都更有效。
While solving the shunting scheduling of EMU first-level maintenance (SSEFM), most existing literature assumed a single maintenance route for all trains and considered only a through depot. It neglects the problem-specific characteristics in terms of varied maintenance routes and a stub-end depot, causing the infeasibility of the generated schedule in such particular circumstances. Therefore, the SSEFM problem with flexible maintenance routes in a stub-end depot with a transversal yard configuration is considered in this work. First, a multi-objective mixed-integer linear programming (MILP) model is formulated to maximize the reservation time in the storage area, and minimize the overstay time in the cleaning and inspecting areas. The relationship between constraints including flexible maintenance routes, train shunting conflicts, track occupation conflicts, and train arrival/departure times, are coordinated. Subsequently, a heuristic-based enhanced particle swarm optimization algorithm (EPSO) with two improvements is proposed to tackle this NP-hard problem. Specifically, three heuristic rules about the depth-first operation track allocation, the conflict-free bottleneck track allocation, and the right-shift track occupancy repair are designed to ensure the feasibility of the shunting schedule. Accordingly, a three-level decoding mechanism is designed to achieve a near-optimal shunting schedule with great train and route sequences. Two improvements on crossover and mutation operators are developed to enhance the exploration and exploitation ability. Finally, a real-world instance in China is solved to verify the effectiveness and efficiency of the proposed model and algorithm. Experimental results show that EPSO is relatively more effective than all the compared algorithms.
登录
查看更多内容
DOI：
10.1145/2598394.2605342
发表时间：
2014-07
期刊：
Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
影响因子：
--
作者：
A. Engelbrecht
通讯作者：
A. Engelbrecht
使用离散 Jaya 算法灵活地重新安排作业车间以插入新作业
影响因子：
11.8
作者：
Gao Kaizhou;Yang Fajun;Zhou MengChu;Pan Quanke;Suganthan Ponnuthurai Nagaratnam
通讯作者：
Suganthan Ponnuthurai Nagaratnam
DOI：
10.1016/b978-0-12-409547-2.14581-0
发表时间：
2020
期刊：
Comprehensive Chemometrics
影响因子：
--
作者：
Federico Marini;Beata Walczak
通讯作者：
Federico Marini;Beata Walczak
利用增强型粒子群优化算法优化电力动车段调车调度
影响因子：
--
作者：
Wang Jiaxi;Lin Boliang;Jin Junchen
通讯作者：
Jin Junchen
总流程时间最小化阻塞流水车间问题的离散引力搜索算法
影响因子：
5.3
作者：
Zhao Fuqing;Xue Feilong;Zhang Yi;Ma Weimin;Zhang Chuck;Song Houbin
通讯作者：
Song Houbin