狭义的坦克远程火力军事需求分析

坦克作为一种近距离格斗兵器来使用的科学性、合理性勿庸质疑,传统的使用方式却导致发展坦克的远程火力成为一个备受争议的话题.立足于信息化作战的背景及我军的现实,着眼于陆军武器系统未来发展的趋势,分析了未来陆军可能的作战模式及其火力体系,从军事、经济、技术的角度分析了我军装甲机械化部队发展坦克远程火力的必要性,并在此基础上分析了坦克远程火力的作用距离、使用的原则与使用的时机,最后对武器装备的"非对称"发展模式提出了初步的看法.     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

一种指挥控制系统中的目标优化分配方法

对现有的目标优化分配模型进行了分析,给出了防空指挥控制系统中目标优化分配的工程背景,在该背景下,对影响目标优化分配的因素进行了分析总结,给出了一种以拦截效能为效益函数的目标优化分配模型,对该模型进行了仿真验证.     

基于区间数的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目标群威胁排序并基于拦截排序准则确定拦截排序;其次使作战效能最大化,基于蚁群算法确定目标的最优分配方案;最后通过仿真实例验证了在考虑目标威胁值排序前提下采用此算法,可使目标群分配方案更加科学有效和符合反导作战实际。