Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

基于小波的信噪分离方法

本文在 Ｄｏｎｏｈｏ 提出的从噪声中恢复信号的非线性小波方法的基本原理的基础上, 并针对非线性小波方法的核心问题——浮动阈值的设定提出了新的算法。通过算例证明, 所设计的浮动阈值在实际应用中效果较好, 特别在低信噪比时信号恢复效果明显优于现常用的浮动阈值设计方法。     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

基于反正切函数的测试性分配方法

针对现有主流测试性分配方法存在的分配指标过低和过高等不合理问题,分析认为其根源在于现有方法采用线性分配函数,而该函数不符合测试性指标提升规律,为此,构造了一种基于反正切函数的测试性分配函数,设计故障检测率与故障隔离率指标的分配算法,开展案例应用并与经典故障率分配法和综合加权分配法进行对比分析,结果表明随着分配权重(故障率)的变大,本方法分配指标的增幅逐渐减小,不会出现极低指标和超1指标的不合理情形。     

装备保障人员优化配置方法研究

将装备保障人员按级别分为操作人员、维修人员及管理人员,结合人员进入、培训和退出的状态,构造了状态转移矩阵,求出了各级别人员数量。定义了不同级别针对不同任务的保障效率,按照保障人员完成最高效率任务构建了最优化配置模型。通过实例验证了模型的实用性。     

机务保障要求到保障方案转换

首先以装备可靠性为依据,以任务要求中任务时间、出动飞机数量、任务可靠度等参数为约束,建立了保障资源的配置模型;在确定保障资源配置基础上再以保障任务时间为优化目标,建立保障任务调度模型和调度算法,按照保障专业调度优化,为保障方案制定奠定了重要基础,对实行精确化保障有重要现实意义,对基层级的保障工作有很强的指导作用。     

一种新的复合导引头多源异步信息融合精确拦截算法

针对单一制导体制难以满足现代战场作战需求,而多传感器数据更新率不同步的问题,建立一种新的微惯导/毫米波/红外复合制导体制,研究了该体制下多传感器异步信息融合的时间同步和空间配准问题;提出一种自适应Unscented卡尔曼滤波算法,该算法采用预测残差构造状态模型误差统计量,通过自适应因子调整状态模型信息对状态参数估值的贡献,有效控制状态模型噪声异常对状态参数估值的影响。将提出的算法应用到微惯导/毫米波/红外复合制导系统中进行仿真验证,结果表明,提出的自适应Unscented卡尔曼滤波算法的解算精度高于标准扩展卡尔曼滤波和Unscented卡尔曼滤波算法,能有效提高导弹的制导的解算精度。     

复合导引头多源异步信息融合精确拦截算法

针对单一制导体制难以满足现代战场作战需求且多传感器数据更新率不同步的问题,建立一种新的微惯导/毫米波/红外复合制导体制,研究了该体制下多传感器异步信息融合的时间同步和空间配准问题;提出一种自适应无迹卡尔曼滤波算法,该算法采用预测残差构造状态模型误差统计量,通过自适应因子调整状态模型信息对状态参数估值的贡献,有效控制状态模型噪声异常对状态参数估值的影响。将提出的算法应用到微惯导/毫米波/红外复合制导系统中进行仿真验证,结果表明,提出的自适应无迹卡尔曼滤波算法的解算精度高于标准扩展卡尔曼滤波和无迹卡尔曼滤波算法,能有效提高导弹的制导的解算精度。     

五阶HWCNS在低速复杂流场中的应用

采用五阶精度显式混合加权紧致非线性格式求解雷诺平均NS方程;利用多块对接结构网格技术,对30P-30N多段翼型进行网格收敛性研究。在不考虑转捩的情况下,采用SA一方程湍流模型研究混合加权紧致非线性格式与二阶精度MUSCL格式对该翼型压力分布和典型站位速度型的影响,并与实验结果进行对比分析。采用混合加权紧致非线性格式和SA一方程湍流模型模拟梯形翼高升力构型低速复杂流场,通过对总体气动特性和压力分布的分析,探讨五阶精度显式混合加权紧致非线性格式在低速复杂外形流动中的应用能力。结果表明,对30P-30N三段翼型,采用全湍流模拟方法可以得到较好的压力分布;对梯形翼高升力构型,在附着流和边界层小分离情况下混合加权紧致非线性格式有较好的模拟能力。