A parallel machine replacement model

This paper considers a finite horizon parallel machine replacement problem where a fixed number of machines is in operation at all times. The operating cost for a machine goes up as the machine gets older. An older machine may have to be replaced by a new one when its operating cost becomes too high. There is a fixed order cost associated with the purchase of new machines. Machine purchase prices and salvage values may depend on the period in which they were purchased. The objective is to find a replacement plan that minimizes the total discounted cost over the problem horizon. We believe that the costs in our model are more commonly observed in practice than those previously used in the literature. The paper develops properties of optimal solutions and an efficient forward‐time algorithm to find an optimal replacement plan. A dominance property is developed that further limits the options to be considered, and a simple forecast horizon result is also presented. Future research possibilities are mentioned. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 275–287, 2002; Published online in Wiley InterScience (http://www.interscience.wiley.com). DOI 10.1002/nav.10012     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

视景仿真中运动实体的动态碰撞检测

在视景仿真中,经常会出现运动实体穿入或穿透其他实体的现象,而用现有的各类包围盒模型不能很好地处理这一问题。为了解决这个问题,介绍了包围盒方法,分析了实体平动、转动、组合运动及相应包围盒的碰撞检测;针对所发现的问题,提出动态碰撞检测方法,并建立了运动实体的动态碰撞检测模型;运用OpenGVS图形引擎,通过VC++编程对模型进行了仿真,通过对仿真结果的对比实验,验证了模型的可行性。     

多轴越野车辆悬架部件结构优化设计

基于有限单元法、变密度方法和车辆动力学分析方法,对某型多轴越野车辆的典型部件(前悬架摆臂)主体进行了结构优化设计研究。结果表明:通过结构优化,降低了摆臂的质量,提高了摆臂的静态、动态结构刚度和强度。     

基于GPU的动态地形过程纹理映射方法

针对基于GPU的动态地形可视化算法中地形形变处的纹理映射问题,提出了在片元着色器里对多种纹理样本进行采样,以动态地形模型本身特点为纹理生成条件,以地形深度偏移图作为动态地形纹理分布alphamap图的动态地形过程纹理生成和映射方法。通过典型的弹坑和车辙纹理映射实验,验证了该方法的正确性和有效性。     

雷达组网系统抗干扰能力动态仿真评估研究

雷达组网抗干扰能力评估是组网系统作战效能评估的一个重要方面,运用仿真模拟法和最优指标法,对组网系统抗干扰能力进行了动态评估研究。基于研究现状的分析,提出了组网系统抗干扰能力的一种评估框架结构;构建了组网系统抗压制性干扰能力的动态评估指标体系,采用最优指标法对4种组网方案在复合压制干扰模式下的抗干扰能力进行了动态仿真分析和方案的优劣评价。评估结果与实际抗干扰试验的结论相符,验证了评估指标体系的有效性和合理性,所得结论对复杂电子战环境下雷达组网系统作战效能研究具有指导意义。     

基于动态罚函数遗传算法的电磁探测卫星多星规划方法

针对电磁探测卫星的特点,考虑其主要约束条件,建立了多星联合规划数学模型,提出了基于遗传算法的电磁探测卫星多星规划算法.为处理遗传算法迭代过程中产生的不可行解,引入了基于罚函数法的约束处理方法.针对罚函数法中惩罚系数难以确定的特点,设计了惩罚系数自适应调整的动态罚函数机制.根据模拟的数据进行实验及分析,表明该方法能有效解决电磁探测卫星多星规划问题.     

Scheduling policies for an antiterrorist surveillance system

This article concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team takes their biometric signatures and compares them with records stored in a terrorist database. Because the surveillance team can screen only one terrorist suspect at a time, the team faces a dynamic scheduling problem among the suspects. We build a model consisting of an M/G/1 queue with two types of customers—red and white—to study this problem. Both types of customers are impatient but the reneging time distributions are different. The server only receives a reward by serving a red customer and can use the time a customer has spent in the queue to deduce its likely type. In a few special cases, a simple service rule—such as first‐come‐first‐serve—is optimal. We explain why the problem is in general difficult and we develop a heuristic policy motivated by the fact that terrorist attacks tend to be rare events. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

联合火力打击弹药需求计算动态模型研究

弹药是火力打击和火力毁伤的基础.传统的火力毁伤弹药需求计算主要有两种思路,一种是不考虑对抗,单纯基于目标的幅员和弹药的毁伤概率静态计算弹药的需求,一种是考虑对抗,运用兰切斯特方程计算弹药的消耗,这样求得的预测结果与实际需求均有较大的差距.研究发现,将基于目标打击的弹药需求和在对抗条件下武器损耗因素结合起来考虑,可以有机地将两种弹药消耗的计算思路融合在一起,建立新的数学模型,所得结果反映了弹药实际需求与外部因素的内在关系,与实际作战更加相符,对战时的弹药供应决策具有重要意义.     

武器装备LCC分析的基本原理

介绍了寿命周期费用(LCC)分析的基本概念及操作程序,给出了武器装备寿命周期费用的一般构成体系,讨论了LCC分析在武器装备应用中需要注意的问题,并对其未来发展方向作了展望.