基于区间数的DS证据合成方法研究

在DS证据理论的应用过程中,命题的基本概率赋值函数起到了关键的作用,传统DS证据理论中基本概率赋值函数的取值为[0,1]中的单点值.在很难准确将证据所支持命题的基本概率赋值表示为[0,1]之间的单点值时,可以用区间数形式来表示命题的基本概率赋值.在建立符合运算封闭性的区间数广义求和与广义乘积算子的基础上,定义了基于区间数的基本概率赋值函数、信任函数以及似然函数等重要概念,给出了证据合成规则,进而提出了基于区间数的DS证据合成方法.计算实例表明,与传统DS证据合成方法相比,基于区间数的DS证据合成方法具有更灵活的应用特性和更小的计算复杂度.     

基于模糊匈牙利算法的炮兵火力单位分配问题

发挥诸火力单位的整体协调优势,寻求在给定约束条件下总的射击效果最好的分配方案,是火力单位最优分配的基本任务.匈牙利算法是求解传统的指派问题的一种较好的方法,运用模糊匈牙利算法在决策过程中将主观因素与客观因素有机地结合起来,解决火力单位分配方案决策中多指标指派问题,从而可以有效地解决炮兵火力单位分配最优化问题.     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于改进TOPSIS法和蚁群算法的反TBM目标群目标分配研究

基于改进的TOPSIS法和蚁群算法,以弹道导弹目标群为研究对象,研究了反导指控系统对目标群的目标分配问题。首先通过改进的TOPSIS法确定TBM目标群威胁排序并基于拦截排序准则确定拦截排序;其次使作战效能最大化,基于蚁群算法确定目标的最优分配方案;最后通过仿真实例验证了在考虑目标威胁值排序前提下采用此算法,可使目标群分配方案更加科学有效和符合反导作战实际。     

基于改进TOPSIS法和蚁群算法的反TBM 目标群目标分配研究*

基于改进的TOPSIS法和蚁群算法,以弹道导弹目标群为研究对象,研究了反导指控系统对目标群的目标分配问题。首先通过改进的TOPSIS法确定TBM目标群威胁排序并基于拦截排序准则确定拦截排序;其次使作战效能最大化,基于蚁群算法确定目标的最优分配方案;最后通过仿真实例验证了在考虑目标威胁值排序前提下采用此算法,可使目标群分配方案更加科学有效和符合反导作战实际。     

应用D-S证据理论进行多传感器雷达体制识别

在阐述Dempster-Shafer(D-S)证据理论的基础上,较系统地论述了基于D-S证据理论的多传感器雷达体制识别的数据融合方法,并给出了具体的识别实例。实验结果证明了基于多传感器融合后的识别结果明显优于单传感器的识别结果,说明了D-S证据理论的有效性和先进性。     

战损装备应急抢修任务指派算法改进研究

从现代战场及装备保障特点出发,采用十标度法对影响战损装备应急抢修的诸因素加权、归一和排序,给出了一种比较实用、并针对指挥员指挥装备抢修的任务指派算法,使得部署内的所有应急机动装备保障分队避免无故空闲,提高保障力量调配的适时性和任务执行的有效性。     

防空目标分配中雷达遮蔽区问题研究

目标分配是防空指挥控制的主要任务,而目标相对于防空导弹火力单元的遮蔽判断是目标分配必须考虑的重要因素。分析了目标遮蔽区的判断条件,推导出目标在遮蔽区飞行时间的计算方法,提出了一种快速表示遮蔽区域图的离散处理方法,并研究了考虑目标遮蔽区影响的目标分配问题。通过实例计算,验证了目标遮蔽计算判断和分配方法的合理性,研究结果对实时指挥控制有应用价值。     

模糊优选动态规划在稀缺军事资源配置中的应用

在对稀缺军事资源配置问题进行数学描述的基础上,建立起评价指标相对优属度计算模型,实现了局部优选。在此基础上,通过分配目标综合评价模型实现了对局部优选数据的综合处理,最后建立资源分配的动态规划模型实现了对方案的优选。最后通过实例演示了解决该类问题的具体方法和步骤,对部队建设具有一定的参考和应用价值。