战役任务计划的数学描述与求解算法研究

Research on Mathematical Description and Solving Algorithms of Tasks Scheduling for Campaign

以多兵种联合作战战役计划为例,在定义任务和作战平台模型的基础上,对战役计划问题进行了数学描述.在定义平台能力矢量与任务需求矢量距离的基础上,基于新的搜索策略提出了多优先级列表动态规划算法(MPLDS),并针对战役案例分析比较了MPLDS与MDSL算法的求解结果与计算性能.

Tasks and platforms are defined in the case of joint campaign, on which mathematical description about campaign scheduling is given. For solving the problem of campaign scheduling, a new approach--multiPRI hst dynamic scheduling （MPLDS） algorithm is advanced, with which vector distance between vectors of platform capability and task resource requirements is defined and a new search strategy is adopted. Results and compute complexities from MPLDS algorithms and traditional MDLS algorithms to solve our case are analyzed and compared.