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     

基于复合等效可信度加权的Bayes融合评估方法

在小子样试验评估时,为避免大量先验信息湮没实际飞行试验的信息,融合先验补充样本时通常会进行数学相容性检验并加权.首先分析了小子样情形下直接根据数据计算数学相容性可能造成的不稳定性,为改善这种情况,根据不同试验类型的不同试验环境,对不同试验类型下的误差进行分析和折合,定义了物理等效可信度;并结合物理等效可信度和数学相容性检验,得到先验样本的复合等效可信度权重,基于正态逆伽玛分布计算了Bayes融合评估的后验结果;通过比较Bayes估计后验方差与不磁合先验信息的估计后验方差,根据先验信息参与融合后是否能减小后验方差来判断先验样本是否应该参与融合.理论分析和仿真说明,基于复合等效可信度的加权方法是合理的.     

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

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

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

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

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

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

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

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

Defence Spending and Income Inequality in Taiwan

The rising trend in income inequality has recently attracted a renewed interest in the determinants of this growing trend across many countries. This article adds to the debate by investigating the impact of defence expenditure as a possible determinant of inequality in Taiwan, a country once was considered to be a poster child of an equitable growth, but now income inequality has become one of the Taiwan’s growing challenges. Applying the bounds test approach to cointegration and four long-run estimators for the period from 1976–2011, we found a long-run relationship between the various measures of inequality and defence expenditure where defence expenditure exerts a positive and a statistically significant impact on the worse income inequality in Taiwan. Further application of the lag-augmented causality test procedure also reveals a unidirectional causality running from defence expenditure to income inequality with defence expenditure causing income inequality to rise.     

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     

形状记忆合金自复位减振装置研制与验证

为改善第二喉道中的可调中心体机构(简称中心体)在工作状态下的流致振动,根据形状记忆合金(shape memory alloy, SMA)偏置双程驱动原理,设计制作一种能够满足中心体有限安装空间要求的SMA自复位减振装置;采用UMAT接口编制的SMA本构关系子程序实现减振装置最大压紧力的数值分析,数值分析与静态调试试验结果误差约为2.58%;搭建地面减振试验平台,测试SMA自复位减振装置分离和闭合状态下的中心体零部件振动响应。减振试验结果显示:SMA自复位减振装置闭合后,中心体振动响应明显降低,在0～100 Hz频带内,均有明显的减振效果,低频至55 Hz范围内,减振率均大于50%。     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010