防空中存在两次转火射击时的火力分配模型

在对空防御时 ,进行火力分配不但要考虑到一次性分配的最佳方案 ,而且应该考虑是否在条件允许的情况下进行一次或两次转火射击 ,如果存在 ,怎样进行转火才能使其射击效果最好。把威胁判断和火力分配结合起来考虑 ,以我方的生存概率为指标 ,建立了存在两次转火射击的火力分配模型 ,并用实例计算检验了模型的正确性。     

基于遗传算法的目标分配问题研究

通过对地空导弹部队射击指挥中目标分配问题的分析,建立了目标优化分配数学模型。在此基础上,给合遗传算法对模型进行求解。通过在具体实例中的应用表明,采用遗传算法为有效地解决这一复杂组合优化问题提供了一种新途径。     

一种面向复杂系统的模糊可靠性分配方法

针对系统研制初期的不确定的约束条件与设计目标 ,进行了复杂系统模糊可靠性分配建模 ;结合遗传算法理论 ,考虑了一般系统的求解 ;实例分析验证了所提出方法的性能和可行性 .     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

基于保障场的装备保障力量配置优化研究

根据电场的作用机理,提出保障场的概念,从场思维的角度构建装备保障力量配置分析的优化模型;并进一步定量分析与定性判断相结合,提出装备保障力量配置优化的流程,最后结合实例具体分析。研究结果对装备保障的部署决策具有一定参考价值和指导意义。     

Na_2SO_4·10H_2O相变过程及其相变潜热的计算

利用CDR-34P差动热分析仪测试Na2SO4·10H2O相变前后的热效应,结合Na2SO4-H2O体系的二元相图,分析相变前后热效应的来源及体系相态、组分的变化;提出无机水合盐相变潜热除来源结晶水脱离外还包括固相物质溶解、溶液浓度梯度变化的热效应的观点;根据上述相变过程计算Na2SO4·10H2O相变潜热,误差仅为2%.     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Allocating the U.S. Department of Defense Budget: Revisiting the ‘Incremental/Fair Share Model’

Abstract

This article examines the ‘incremental/fair share model’ that was proposed by Alex Mintz in 1988 concerning the budget allocation of the U.S. Department of Defense. Although Mintz was unable to confirm the correctness of his model, this study demonstrated it to be statistically significant. In the statistical analyses, I used the two-stage least squares method and Durbin’s h-test to better scrutinize the model’s adequacy. Few previous studies have addressed the allocation of the U.S. defence budget; consequently, the incremental/fair-share model should constitute a starting point for further research on the U.S. defence budget allocation.     

“协同制导通道”基本概念及其应用分析

舰艇编队协同反导作战,是海上网络中心作战的典型样式.针对舰艇编队网络化协同反导作战装备体系特殊性,提出了“协同制导通道”基本概念和数学表示方法,并对基于协同制导通道分配方法运用于网络化反导作战条件下武器资源分配进行了研究.分析了单舰反导作战“武器目标分配”的局限性,网络化反导作战“弹-目匹配”新需求和“协同制导通道”的选择方法,为确定“协同制导通道”选择的最优化指标,提出选择“协同制导通道”优化算法奠定了基础.