基于Pareto改进VNS-MMAS的定点修理任务多目标动态调度

针对战时定点修理任务重、修理时间有限、约束复杂的问题,进行了面向定点修理的战时装备维修任务多目标动态调度研究。提出了战时定点修理装备维修任务调度军事问题,考虑修理时间窗、非遍历性等约束,构建了战时装备维修任务多目标动态调度模型。采取分步求解思路处理修理小组分配以及修理任务排序两阶段优化问题,并从状态转移规则、信息素更新规则、先验信息获取3个方面对最大最小蚂蚁系统(max-min ant system, MMAS)算法进行改进,结合变邻域搜索(variable neighborhood search, VNS)算法增强算法的局部搜索能力,设计了基于Pareto改进VNS-MMAS算法实现模型求解,并通过示例仿真验证了模型及算法的科学性与有效性。

Multi-objective dynamic scheduling of fixed-point repairing tasksbased on Pareto improved VNS-MMAS

To deal with the problem of heavy repair tasks, limited repair time and complicated constraints in wartime, the multi-objective dynamic scheduling of the wartime equipment maintenance tasks for fixed-point repairing is studied. The military problem of wartime fixed-point repairing maintenance task scheduling is proposed. Considering the constraints of repair time window and non-traversal, a multi-objective dynamic scheduling model of the wartime equipment maintenance task is constructed. The step-by-step solution is adopted to deal with the two-stage optimization problem of repair team allocation and repair task sorting. The max-min ant system (MMAS) algorithm is improved from three aspects: state transition rule, pheromone update rule and a priori information acquisition. The local search of the variable neighborhood search (VNS) algorithm is combined with the enhanced algorithm. Based on the ability, the model solving algorithm based on Pareto improved VNS-MMAS is designed. Through example simulation and analysis, the rationality and effectiveness of the model and the algorithm are verified.