CAJ | 학술논문

针对执行战场物资供应任务之前，不确定环境下的战场物资供应任务规划问题进行研究，并建立相应的不确定规划模型，引入一种新的启发式算法---蜂群算法，对其进行改进，构建适于解决战场物资供应任务规划问题的算法，并通过与现有算法进行性能比较，验证其有效性。最后，通过一个存在13个供应任务点的应用实例，验证提出的模型及算法的有效性。结果表明，不确定环境下得到的最佳方案更符合实际。
침대집행전장물자공응임무지전，불학정배경하적전장물자공응임무규화문제진행연구，병건립상응적불학정규화모형，인입일충신적계발식산법---봉군산법，대기진행개진，구건괄우해결전장물자공응임무규화문제적산법，병통과여현유산법진행성능비교，험증기유효성。최후，통과일개존재13개공응임무점적응용실례，험증제출적모형급산법적유효성。결과표명，불학정배경하득도적최가방안경부합실제。
This paper mainly studies the battlefield material provision mission planning problem under the condition of uncertain environments,and builds up a corresponding uncertain programming model.In con-sideration of the NP-hard nature of the battlefield material provision mission planning problem,the paper introduces an elicitation algorithm,i.e.a new artificial bee colony algorithm.which is modified and is con-structed to be suitable for solving the battlefield material provision mission planning problem.And through the performance comparison of this algorithm with other algorithms,the algorithm is effective.Finally,an application study of 1 3 mission targets is presented and the model is verified.The results show that the op-timal plan under the uncertain environments is more practical.