基于混合粒子群算法的军事保障物资调度优化  

Optimization of Military Support Material Scheduling Based on Hybrid Particle Swarm Algorithm

作　　者：高佳 苏瑾[2] 宁诗铎 郑晓军 GAO Jia;SU Jin;NING Shiduo;ZHENG Xiaojun(Dalian Jiaotong University,Dalian 116000,China;China North Vehicle Research Institute,Beijing 100072,China)

机构地区：[1]大连交通大学,辽宁大连116000 [2]中国北方车辆研究所,北京100072

出　　处：《火力与指挥控制》2022年第11期52-58,共7页Fire Control & Command Control

基　　金：辽宁省教育厅基金(JDL2019016);辽宁省自然科学基金资助项目(2019-ZD-0115)。

摘　　要：针对战场军事保障物资配送车辆的调度优化问题,以配送路径最短、平均保障物资配送及时度最高为目标函数,建立了带有模糊时间窗的多目标配送模型,并使用层次分析法对作战点所需的各类保障物资进行加权赋值,对需求紧迫度高的作战点进行优先配送;同时提出了一种结合改进节约算法的混合粒子群算法对模型进行求解。仿真实验结果表明,建立的模型合理,改进后的算法在一定程度上克服了传统粒子群算法求解多目标优化问题过程中易陷入局部最优的现象。According to the scheduling dispatch optimization problem of the military support material distribution vehicle on the battlefield,the shortest distribution path and the highest average support material distribution timeliness are taken as the objective functions the multi-objective distribution model with fuzzy time window is established,the required various support materials are weighted and assigned with hierarchy analysis method,and priority is given to the operational points with high demand;at the same time,a hybrid particle swarm algorithm combined with an improved economy algorithm is proposed to solve the model. The simulation experiment results show that the model established in this paper is reasonable,and the improved algorithm overcomes to a certain extent the phenomenon that the traditional particle swarm algorithm is easy to fall into the local optimum in the process of solving multi-objective optimization problems.

关 键 词：军事保障物资配送 路径优化 模糊时间窗 粒子群算法 

分 类 号：E23[军事—军事理论] TP3[自动化与计算机技术—计算机科学与技术]