Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Firm embedding behavior of annular grooved projectiles impacting ductile metal targets

Annular grooved projectiles (AGPs) have drawn ongoing concerns as an advanced penetrator for their excellent anti-rebound capability in impacting metal plates. They could become embedded solidly in the target surface during low-velocity impact. In this investigation, the firm embedding behavior of AGP was observed by impact experiments. Corresponding numerical simulations provided a better understanding of this process. Experimental and numerical results indicated that the firm embedding behavior of AGP was mainly due to the filling-material in the groove rather than the friction between the projectile and target, unlike traditional shape such as conical projectile. According to observation, firm embedding process can generally be subdivided into four stages: initial-cratering stage, groove-filling stage, filling-material failure stage and rebound vibration stage. Moreover, the damage mechanics of target material around crater was obtained through microscopic tests. A comparison of the cross-sectional figures between the experiment and simulation proved that the analysis and the proposed method were reasonable and feasible, which further demonstrated that the firm embedding behavior has application potential in new concept warheads.     

弯曲载荷作用下复合材料T型接头的失效分析

运用蔡-吴逐步失效判据和黏聚接触模型建立弯曲加载下的T型接头的有限元模型。对复合材料T型接头在弯曲加载下的损伤机理和承载能力进行数值模拟。结合静态弯曲加载实验,揭示T型接头在弯曲破坏过程中的四种失效模式。T型接头的弯曲失效载荷的有限元模型计算结果与实测值吻合较好。     

引入电流变化率的电源分布网络最差噪声分析算法

随着时钟频率的增加以及电源电压的降低,电源完整性问题日益凸显。将电流变化率加入到最差噪声算法的电流约束中,能够在任意电流变化率的情况下分析电源分布网络的最差噪声,从而获得更加真实的最差噪声。另外,利用改进的Knuth-Yao四边形不等式法对基于动态规划的最差噪声算法进行加速,加速后算法的时间复杂度从O(n~2m)降为O(mnlogn)。     

一种改进的量子粒子群算法

量子粒子群算法是将量子计算与粒子群算法相结合的一种新的优化方法。首先利用相位角进行实数编码,将动态量子旋转门引入到粒子群算法中,采用自适应变异,提出了一种改进的量子粒子群算法。然后运用Pe-nalized函数和Ackley函数测试了该算法的性能。最后将该算法应用到武器目标分配模型中,获得了最优的分配方案。仿真研究表明,该算法具有收敛速度快、搜索能力强和稳定性高的特点。     

坦克兵力行为智能体模型研究

为了有效模拟兵力物理行为和智能行为的不同特性,提出了一个复合结构坦克兵力智能体模型,该模型综合了反应式行为和慎思行为两方面的优点。采用层次化组合方法建立了基于行为模式的兵力物理行为模型,使兵力智能体能对动态战场环境作出灵活的反应。结合兵力不同类型任务的分析,设计了基于规划的兵力智能行为模拟方法,使兵力智能体能按照战术原则进行作战任务规划。     

基于自适应EKF的高动态载波跟踪算法

针对载波跟踪算法在大频偏或动态剧烈变化时易失锁的问题,提出一种无数据辅助情况下基于自适应R/Q扩展卡尔曼滤波(AEKF)的高动态载波跟踪算法。该算法在AEKF代替鉴相器和滤波器的环路结构基础上,引入两倍相位转换来消除数据位跳变的影响,并利用载噪比估计方法和基于加加速度的信号动态监测方法来修正观测噪声协方差(R)和系统状态噪声方差(Q),进而兼顾环路的跟踪精度和动态稳定性。实验结果表明:利用该算法的GPS软件接收机能够在加速度200 g,瞬间加加速度10 000 g/s的动态指标下正常工作。     

基于MAXSIM平台的巡逻战法仿真建模

MAXSIM平台具有良好的二次开发性,通过MAXSIM平台进行战法研究将更好地满足战术战役级的军事仿真需求。目前MAXSIM平台中巡逻战法只具备发现报告对方目标及返港能力、未能列出不同巡逻战法,通过行为编辑器（ BE）编写常用的巡逻战法,完善了MAXSIM平台的行为知识库（ BKB）,使水面舰艇具备发现敌方目标后进行追逐、攻击的能力,并提出根据Bezier曲线算法对目标航行轨迹进行预判的追逐方式,对进一步研究巡逻战法的应用具有借鉴意义。     

基于规则的动态频谱接入研究

动态频谱接入面临的关键技术之一是对接入时机和方式进行有效地管控,防止由于频谱的接入使用过于灵活造成用频的干扰和混乱。将频谱接入的时间和方式给予规则上的约束和指导,基于规则构建动态频谱管理框架可以有效实现频谱的实时管控。对动态频谱接入的规则及表述方式进行了讨论,分析了基于规则的动态频谱接入过程,最后结合美军XG项目的试验结果分析了基于规则的动态频谱接入的应用前景。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016