Relaxation method for the solution of the minimax location-allocation problem in euclidean space

A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius r_p (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported.     

A continuous-review inventory model with constant resupply time and defective items

As a result of imperfect production and inspection by suppliers, pilferage, and/or damage in transit, it is common that procurement orders may contain defective items. This article deals with a continuous-review inventory system with Poisson demand arrivals and constant resupply time. Items in resupply lots may not be of perfect quality. The operating characteristics of such a system are analyzed. For purposes of computational savings, an approximation scheme for the operating characteristics is presented. As a result of the approximation, the determination of the optimal ordering policy becomes much simpler. Extensive numerical tests suggest that the approximation scheme is very effective in giving the optimal or near-optimal ordering policies for such a system.     

Bounds and properties of the expected value of sample information for a project-selection problem

In this article we extend the work of Mehrez and Stulman [5] on the expected value of perfect information (EVPI) to the expected value of sample information (EVSI) for a class of economic problems dealing with the decision to reject or accept an investment project. It is shown that shifting the mean of the underlying a priori distribution of X, the project's monetary value from zero in either direction will decrease the associated EVSI of Y, the random sampled information. A theorem is then presented which gives an upper bound on the EVSI over all distributions of Y, as well as the structure of the posterior mean E[X|Y] for which this upper bound is achieved. Finally, the case where E[X|Y] is linear in Y is discussed and its performance compared with that of the optimal case.     

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     

高功率电磁环境下C4ISR系统接口电路的阈值实验

采用非接触式电流脉冲注入法,设计了一种通用的接口电路实验模型和测试软件,进行了高功率电磁脉冲对指控系统接口电路的注入损伤实验,测量接口电路耦合电压和耦合电流,并对实验结果进行了分析.实验表明,强电磁能量耦合到电子装备和电气设备内部,可在其接口电路上产生过电压或过电流,从而使设备受到干扰和损伤.     

基于SVR弹药消耗数量的预测建模

精确化保障已成为航空武器弹药保障发展的新趋势。针对弹药消耗数量预测建模难的问题,基于统计学习理论,采用SVR方法,建立了某型弹药消耗量的预测模型。仿真试验结果表明,SVR具有很高的建模精度和较强的泛化能力,从而验证了该方法的有效性和先进性。     

一种Mini-SAR的极坐标成像算法

Mini-SAR技术是目前SAR领域一个新兴的重要研究方向,但目前投入实用的成像算法很少。针对Mini-SAR的成像原理,给出了一种新的投入实用的极坐标成像算法,通过对该算法优缺点的研究,分析了Mini-SAR成像场景、分辨率及作用距离三者之间的关系,讨论了该算法对成像场景尺寸的限制要求,明确了算法的适用条件;最后利用某型Mini-SAR实际复数图像数据验证了该算法的正确性。研究结论对国内小型SAR的研制具有一定参考价值。     

Volterra级数频谱非线性系统故障诊断方法

介绍了故障诊断技术的基本概念,重点阐述了非线性系统Volterra级数模型的原理及其在故障检测中的应用,并基于这一方法设计了飞机刹车系统惯性传感器故障检测设备.在这一应用系统中,被测系统的故障特征是广义频率响应函数GFRF(Generalized Frequency Response Functions)谱特征.简要介绍了故障诊断的方法,在工程应用实现中设计了相关的硬件电路,实验结果说明了此诊断方法是有效可行的.     

BAT子弹药对二维声目标的角跟踪

针对BAT(Brainpower Antitank)智能子弹药声探测系统不能定距问题,提出一种在仅有方向角信息条件下对地面机动声目标跟踪算法.首先分析了BAT声探测系统做三维运动时的定向算法;然后结合弹体运动特点,给出一种仅利用目标方向信息对地面机动目标跟踪算法,分别推导了目标静止、匀速、匀加速以及更高阶次运动时的角跟踪公式,并指出了定向误差存在的前提下其成立的充分条件;最后,给出了一个该算法的精确度函数,可以量化评估算法的精度,优化跟踪轨迹.理论分析表明BAT不需要在水平方向上做出比机动目标更高阶次的运动即可实现对目标的角跟踪.