成本分担定价方式的装备采购博弈研究

承包商的努力程度直接决定了装备的制造成本。为有效激励承包商降低装备制造成本,提高装备采购效益,基于里昂惕夫劳资博弈模型建立了成本分担定价方式的装备采购博弈模型。并在承包商边际效用非线性和定价方式多变量的假设基础上,分别对价格、成本、承包商努力程度和承包商效用之间的关系进行了研究,对原模型进行了拓展,为定价方式中参数的确定提供了量化方法。     

Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems

Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

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     

On the exponentially weighted moving variance

MacGregor and Harris (J Quality Technol 25 (1993) 106–118) proposed the exponentially weighted mean squared deviation (EWMS) and the exponentially weighted moving variance (EWMV) charts as ways of monitoring process variability. These two charts are particularly useful for individual observations where no estimate of variability is available from replicates. However, the control charts derived by using the approximate distributions of the EWMS and EWMV statistics are difficult to interpret in terms of the average run length (ARL). Furthermore, both control charting schemes are biased procedures. In this article, we propose two new control charts by applying a normal approximation to the distributions of the logarithms of the weighted sum of chi squared random variables, which are respectively functions of the EWMS and EWMV statistics. These new control charts are easy to interpret in terms of the ARL. On the basis of the simulation studies, we demonstrate that the proposed charts are superior to the EWMS and EWMV charts and they both are nearly unbiased for the commonly used smoothing constants. We also compare the performance of the proposed charts with that of the change point (CP) CUSUM chart of Acosta‐Mejia (1995). The design of the proposed control charts is discussed. An example is also given to illustrate the applicability of the proposed control charts. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

水面舰船对声自导鱼雷防御机动方法研究

根据水面舰船机动对其辐射噪声和反射强度的影响,首先建立了水面舰船与声自导鱼雷规避机动对抗的数学模型,然后采用Monte-Carlo法,计算水面舰船不同规避机动方法的生存概率,并分析了水面舰船转向、加速对其生存概率的影响,最后,得出水面舰船对声自导鱼雷防御的最优规避机动方法.提出的规避机动方法对水面舰船水下防御系统研究,具有十分重要的指导意义.     

航母舰载机对空防御作战出航保障指挥决策建模

基于Agent的航母舰载机对空防御作战出航保障指挥决策系统,由数据部分和Agent组织部分组成.前者又含数据库、模型库、知识库、相关管理系统和MIS.后者包括五大决策Agent,通过界面Agent与用户进行交互,而与数据部分的交互则由DB监理Agent统一完成.对于系统内决策Agent的设计,可首先针对五大决策Agent的模板进行设计,再对其功能层进行实例化.     

弹药储存可靠性设计对策研究

从我军弹药储存可靠性设计现状出发,在深入分析某型弹药失效机理基础上,总结出了我军弹药产品储存性方面存在的质量问题;提出了弹药全系统相容的研究理念和储存性设计中的复合防护设计概念,并对如何提高弹药储存性能提出了建议。     

基于博弈论的装备采办成本控制问题研究

从武器装备采办的理论需求出发,以博弈论为理论工具,对武器装备采办过程中的生产成本控制问题进行了分析;建立了基于激励的生产成本控制模型,并对成本控制模型的特点进行了分析和解释;针对军方在激励合同执行过程中有可能出现的2类错误,对成本控制模型进行了优化。在非对称信息条件下,优化后的成本控制模型不但能有效减少2类错误的发生,而且可提高军方装备采办效用,减少代理方合同风险。     

基于博弈论的装备采购定价激励模型

不同的定价方式和定价参数的选择对于承包商会起到不同程度的激励作用。为提高装备采购效益,在承包商追求效用最大化假设的基础上,建立了装备采购完全信息动态博弈模型。对价格、成本、承包商努力程度和承包商效用之间的关系进行了研究,证明了成本分担和固定价格的定价方式能够有效激励承包商提高自身努力水平降低成本,并提出了2种定价方式的参数定量计算方法。