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

doi:10.3969/j.issn.1000-1093.2017.08.018

兵工学报 ›› 2017, Vol. 38 ›› Issue (8): 1593-1602.doi: 10.3969/j.issn.1000-1093.2017.08.018

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

陈春良¹, 陈伟龙¹, 陈康柱², 刘彦¹, 史宪铭³

(1.装甲兵工程学院技术保障工程系, 北京 100072； 2.装甲兵工程学院训练部, 北京 100072；3.军械工程学院装备指挥与管理系, 河北石家庄 050003)

收稿日期:2017-01-05 修回日期:2017-01-05 上线日期:2017-10-10
作者简介:陈伟龙（1988—），男，博士研究生。E-mail:amose_chen@163.com

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

CHEN Chun-liang¹, CHEN Wei-long¹, CHEN Kang-zhu², LIU Yan¹, SHI Xian-ming³

(1.Department of Technical Support Engineering, Academy of Armored Force Engineering, Beijing 100072, China;2.Department of Training, Academy of Armored Force Engineering,Beijing 100072, China;3.Department of Equipment Command and Management, Ordinance Engineering College,Shijiazhuang 050003, Hebei, China)

Received:2017-01-05 Revised:2017-01-05 Online:2017-10-10

摘要/Abstract

摘要： 针对进攻作战中战损装备众多而抢修时间与抢修力量有限的矛盾，进行了进攻作战抢修任务动态调度研究。提出考虑非遍历的抢修任务多目标动态调度的现实军事问题，建立多目标规划数学模型，分析了非遍历、修理能力差异、待修装备优先级3个重要影响因素；根据所建模型的特点，设计了基于遗传算法的模型求解算法；运用Matlab软件进行了39辆待修装备、3个抢修组的动态调度示例仿真与分析。示例结果表明：通过实施机动伴随抢修和抢修任务动态调度，进攻作战部队能够获得约185 h的二次作战总时间，进而增强部队的持续作战能力，并大大减少决策工作量和决策时间、降低人为决策风险。

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

Abstract: 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 operation is studied. A multi-objective and dynamic scheduling of battlefield rush-repair tasks based on non-ergodicity, which is a real military problem, is presented. A mathematical model of multi-objective programming is established. Three key factors, including non-ergodicity, repair ability difference and priority 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, which can effectively solve the difficult problem of non-ergodic optimization and dynamically track the change of the optimal solution. Key

Key words: ordnancescienceandtechnology, battlefieldrush-repair, dynamicscheduling, non-ergodicity, geneticalgorithm

中图分类号:

陈春良, 陈伟龙, 陈康柱, 刘彦, 史宪铭. 考虑非遍历的抢修任务多目标动态调度[J]. 兵工学报, 2017, 38(8): 1593-1602.

CHEN Chun-liang, CHEN Wei-long, CHEN Kang-zhu, LIU Yan, SHI Xian-ming. Multi-objective and Dynamic Scheduling of Battlefield Rush-repair Tasks Based on Non-ergodicity[J]. Acta Armamentarii, 2017, 38(8): 1593-1602.

参考文献

［1］王正元, 朱昱, 宋建社, 等. 动态维修任务调度的优化方法[J]. 机械工程学报, 2008, 44(1): 92-97.
WANG Zheng-yuan, ZHU Yu, SONG Jian-she, et al. Optimal method on dynamic maintenance task scheduling [J]. Chinese Journal of Mechanical Engineering, 2008, 44(1): 92-97.(in Chinese)
[2］王正元, 严小琴, 朱昱, 等. 一种考虑专业的动态维修任务调度的优化方法[J]. 兵工学报, 2009, 30(2): 252-256.
WANG Zheng-yuan, YAN Xiao-qin, ZHU Yu, et al. An optimal method on dynamic maintenance task scheduling with subject taken into account[J]. Acta Armamentarii, 2009, 30(2): 252-256. (in Chinese)
[3］曹继平, 宋建社, 朱昱, 等. 战场抢修多需求点多资源优化调度研究[J]. 兵工学报, 2008, 29(8): 995-1000.
CAO Ji-ping, SONG Jian-she, ZHU Yu, et al. Research on battlefield maintenance optimization scheduling of multi-requirement-points and multi-resources[J]. Acta Armamentarii, 2008, 29(8): 995-1000. (in Chinese)
[4］郭军, 宋建社, 杨檬, 等. 基于证据理论的多任务抢修重要度决策[J]. 系统工程与电子技术, 2011, 33(3): 581-584.
GUO Jun, SONG Jian-she, YANG Meng, et al. Recovery importance decision making for multi-missions based on Dempster-Shafer theory[J]. Systems Engineering and Electronic, 2011, 33(3): 581-584. (in Chinese)
[5］郭军, 宋建社, 曹继平, 等. 战场抢修资源重组决策方法[J]. 系统工程与电子技术, 2014, 36(2): 306-311.
GUO Jun, SONG Jian-she, CAO Ji-ping, et al. Battlefield urgent maintenance resource recombination decision making[J]. Systems Engineering and Electronics, 2014, 36(2): 306-311. (in Chinese)
[6］ Pillac V, Gendreau M, Guéret C, et al. A review of dynamic vehicle routing problems[J]. European Journal of Operational Research, 2013, 225(1): 1-11.
[7］ Liu C H, Hsu C I. Dynamic job shop scheduling with fixed interval deliveries[J]. Production Engineering, 2015, 9(3): 377-391.
[8］ Kuzmanovska A, Mak R H, Epema D. Dynamically scheduling a component-based framework in clusters[J]. Lecture Notes in Computer Science, 2015, 8828: 129-146.
[9］ Moon S, Oh E, Shim D H. An integral framework of task assignment and path planning for multiple unmanned aerial vehicles in dynamic environments[J]. Journal of Intelligent and Robotic Systems, 2013, 70(1): 303-313.

[10］ Sarasola B, Doerner K F, Schmid V, et al. Variable neighborhood search for the stochastic and dynamic vehicle routing problem[J]. Annals of Operations Research, 2016, 236(2): 425-461.
[11］ Schneider M. The vehicle-routing problem with time windows and driver-specific times[J]. European Journal of Operational Research, 2016, 250(1): 101-119.
[12］ Yepes V, Medina J. Economic heuristic optimization for heterogeneous fleet VRPHESTW[J]. Journal of Transportation Engineering, 2015, 132(4): 303-311.
[13］ Lorini S, Potvin J Y, Zufferey N. Online vehicle routing and scheduling with dynamic travel times[J]. Computers & Operations Research, 2011, 38(7): 1086-1090.
[14］ Letchforda A N, Nasiri S D. The Steiner travelling salesman problem with correlated costs[J]. European Journal of Operational Research, 2015, 245: 62-69.
[15］ Akar E, Topcuoglu H R, Ermis M. Hyper-heuristics for online UAV path planning under imperfect information[J]. Lecture Notes in Computer Science ,2014, 8602:741-752.
[16］ Deb K, Pratap A, Agarwal S, et al. A fast and elitist multi-objective genetic algorithm: NSGA-II[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197.

第38卷
第8期2017 年8月兵工学报ACTA
ARMAMENTARIIVol.38No.8Aug.2017

[1]	苏胜，顾森，宋志强，刘萍. 基于深度表征学习和遗传算法的军用座舱色彩设计方法[J]. 兵工学报, 2024, 45(4): 1060-1069.
[2]	马维宁, 胡起伟, 陈静, 贾希胜. 装备群选择性维修决策与任务分配联合优化[J]. 兵工学报, 2024, 45(2): 407-416.
[3]	秦国华, 娄维达, 林锋, 徐勇. 基于Cotes求积法和神经网络的稳定域判断及铣削参数优化新方法[J]. 兵工学报, 2024, 45(2): 516-526.
[4]	刘子昌, 李思雨, 裴模超, 刘洁, 孟硕, 吴巍屹. 基于纹理分析的柴油发动机故障诊断方法[J]. 兵工学报, 2024, 45(2): 684-694.
[5]	叶闻语, 王春阳, 于金阳, 拓明侃, 王子硕. 基于贪心遗传算法的液晶光学相控阵多光束扫描[J]. 兵工学报, 2023, 44(9): 2650-2660.
[6]	陈松, 朱东升, 左钦文, 韩朝帅. 基于GA-PS的三维空间源项反演算法[J]. 兵工学报, 2023, 44(8): 2503-2520.
[7]	张安, 徐双飞, 毕文豪, 徐晗. 空地多目标攻击武器-目标分配与制导序列优化[J]. 兵工学报, 2023, 44(8): 2233-2244.
[8]	刘彦, 王百川, 闫俊伯, 闫子辰, 时振清, 黄风雷. 侵彻作用下负泊松比蜂窝夹芯结构动态响应[J]. 兵工学报, 2023, 44(7): 1938-1953.
[9]	杜伟伟, 陈小伟. 陆军战术级作战任务分配及优化方法[J]. 兵工学报, 2023, 44(5): 1431-1442.
[10]	周伯俊, 于传强，刘志浩，柯冰. 基于高压储能的特种车辆快速起竖技术与验证[J]. 兵工学报, 2022, 43(7): 1488-1497.
[11]	高月光，冯顺山，刘云辉，黄岐. 不同端盖厚度的圆柱形装药壳体破片初速分布[J]. 兵工学报, 2022, 43(7): 1527-1536.
[12]	马也，范文慧，常天庆. 基于智能算法的无人集群防御作战方案优化方法[J]. 兵工学报, 2022, 43(6): 1415-1425.
[13]	王鹤翔，毛晓东，庞丽萍，冯晓晗. 基于多目标遗传算法的特种车舱室送风系统优化设计[J]. 兵工学报, 2022, 43(12): 2981-2988.
[14]	赵鹏程，宋保维，毛昭勇，丁文俊. 基于改进的复合自适应遗传算法的UUV水下回收路径规划[J]. 兵工学报, 2022, 43(10): 2598-2608.
[15]	汤润之, 班利明, 钱乐, 雷争军, 宋卫星. 资源受限条件下车辆维修工序调度优化[J]. 兵工学报, 2021, 42(9): 2032-2039.

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

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

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价