考虑非遍历的抢修任务多目标动态调度  

Multi-objective and Dynamic Scheduling of Battlefield Rush-repair Tasks Based on Non-ergodicity

作　　者：陈春良[1] 陈伟龙[1] 陈康柱[2] 刘彦[1] 史宪铭[3] 

机构地区：[1]装甲兵工程学院技术保障工程系,北京100072 [2]装甲兵工程学院训练部,北京100072 [3]军械工程学院装备指挥与管理系,河北石家庄050003

出　　处：《兵工学报》2017年第8期1593-1602,共10页Acta Armamentarii

摘　　要：针对进攻作战中战损装备众多而抢修时间与抢修力量有限的矛盾,进行了进攻作战抢修任务动态调度研究。提出考虑非遍历的抢修任务多目标动态调度的现实军事问题,建立多目标规划数学模型,分析了非遍历、修理能力差异、待修装备优先级3个重要影响因素;根据所建模型的特点,设计了基于遗传算法的模型求解算法;运用Matlab软件进行了39辆待修装备、3个抢修组的动态调度示例仿真与分析。示例结果表明:通过实施机动伴随抢修和抢修任务动态调度,进攻作战部队能够获得约185 h的二次作战总时间,进而增强部队的持续作战能力,并大大减少决策工作量和决策时间、降低人为决策风险。In the offensive operation, equipment is constantly damaged, but the battlefield rush-repair time and power are limited. The dynamic scheduling of battlefield rush-repair tasks in the offensive opera- tion is studied. A multi-objective and dynamic scheduling of battlefield rush-repair tasks based on non-er- godicity, which is a real military problem, is presented. A mathematical model of multi-objective pro- gramming is established. Three key factors, including non-ergodicity, repair ability difference and priori- ty of equipment to be repaired, are analyzed. A scheduling example of 39 equipment to be repaired and 3 repair groups is simulated and analyzed by using Matlab. The simulated result shows that the proposed model is scientific and reasonable, and the algorithm is correct and efficient, whi the difficult problem of non-ergodic optimization and dynamically track the change ch can effectively solve of the optimal solution.

关 键 词：兵器科学与技术 战场抢修 动态调度 非遍历 遗传算法 

分 类 号：E92[军事—军事装备学]