Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

网络性能综合评估方法IEMoNP的设计和实现

由于孤立的网络性能指标(测度)不能满足全局性或整体性网络性能评估的需要,文中给出了网络性能综合指数IPI和网络运行稳定性指数SI的概念、定义和计算公式.IPI和SI反映了相对基准时刻的网络性能状况.在此基础上,进一步提出了基于IPI和SI的网络性能综合评估方法IEMoNP.最后,通过一个应用示例表明,IEMoNP能够为全局性或整体性的网络性能评估提供支持.     

空地协同群在防空作战空地协同中的应用

鉴于防空战场形势多变,提出了空地协同群的概念,并主要从作战单元的选取、作战单元进出规则、协同关系的确定和协同通信策略等4个方面进行论述.该概念能够较好地刻画空地协同的基本理论、空地协同的组织与实施等内容,是对网络中心战背景下的空地协同作战的一种全新的诠释.     

基于MAS的陆军合成师作战能力仿真评估系统

将Agent和MAS引入陆军合成师作战能力仿真和评估研究中,提出了基于MAS的作战仿真模型,详细讨论了MAS的体系结构、Agent的内部结构、Agent的编程实现和作战过程仿真的具体步骤,为建立作战能力仿真和评估模型提供了一个清晰的思路。基于对陆军合成师作战能力仿真评估系统的需求分析,提出了系统的总体框架,开发了实用的仿真评估系统.     

防空兵群动态防空抗击效率评估模型研究

结合未来陆军机动作战实际,研究了集中射击指挥条件下,防空兵群动态防空抗击效率的评估方法。提出了目标可射击概率应依据火力单位射程选用不同模型评估的观点,探讨了火力单位转移、导弹(弹药)储备和群指挥所状态等因素对群抗击效率的影响及其评估模型。在此基础上,指出了所建模型的适用范围和需要进一步解决的问题。     

温度场对机枪动力特性的影响

现代机枪重量较轻,要达到理想的射击精度就必须保证良好的动力匹配关系。机枪在射击过程中,枪管温度的升高直接影响机枪的动力特性。对某型机枪射击过程中枪管温度场及其对机枪动力特性的影响进行了分析,结果表明,温度变化对机枪动力特性改变的影响较小。     

基于特征的态势信息及需求关联性模型研究

介绍了信息栅格体制下作战信息按需分发机制,分析了战场态势信息的内容特征,提出了基于信息特征的态势信息域及信息需求集的建模方法,提出了基于加权欧氏距离的态势信息需求关联性模型,模型计算简单迅速,便于计算机实现,对信息栅格体制下的信息分发管理研究具有一定的理论和实践意义。     

Alpha稳定分布混响建模及信号检测

研究了基于对称Alpha稳定分布的浅海环境下混响及噪声的建模问题.分析了浅海环境下混响形成过程及其非高斯特性,采用对称Alpha稳定分布理论对其进行了建模,并从声呐接收端的混响瞬时值以及包络的概率密度分布与Alpha稳定分布的匹配程度验证了模型的有效性.研究了基于对称Alpha稳定分布模型的混响噪声背景下的目标信号检测方法.提出了三种检测方法并进行了仿真测试,通过检测性能及模型的精确性分析了三种方法的优缺点,验证了建模精度对检测性能的影响.