摘要
数学中最优化理论是解决分配管理问题的一种常用手段。在战略中对武器目标的分配为了得到最好的效益,通常会将其建立分配优化模型。当构建诸多模型时,往往代价成本都比较大,因此经常划分若干过程进行求解。传统算法设计上,较为突出的就是动态规划,它是一个多阶段决策问题。论文分析武器目标分配的数学背景以及最优化理论的应用策略,分析了动态规划等策略的实际求解过程在武器装备分配问题上的应用。并提出了一种基于贪心策略的改进动态搜索方法,这种方法在处理规模已定的情况下,查找精确值的效率相比动态规划方法具有明显的提升。在作战软件的算法设计上有良好的借鉴价值。
The optimization theory in mathematics is a common means to solve the problem of distribution management.In or-der to get the best benefit,the allocation optimization model of weapon targets in strategy is usually established.When building many models,the cost is often high,so it is often divided into several processes to solve.In the traditional algorithm design,the more prominent is dynamic programming,which is a multi-stage decision-making problem.This paper analyzes the mathematical background of weapon target allocation and the application strategy of optimization theory,and analyzes the application of the actual solution process of dynamic programming and other strategies to the problem of weapon equipment allocation.An improved dynamic search method based on greedy strategy is proposed.This method has significantly improved the efficiency of finding accurate values compared with dynamic programming method when the processing scale is fixed.It has good reference value in the algorithm design of combat software.
作者
龙昊
王珏
周晶
LONG Hao;WANG Jue;ZHOU Jing(Institue of Operation Software and Simulation,Dalian Naval Academy,Dalian 116018)
出处
《舰船电子工程》
2024年第3期18-21,共4页
Ship Electronic Engineering
关键词
资源分配
武器目标分配
动态规划
贪心法
resource allocation
weapon target allocation
dynamic planning
greedy law
