Asymptotic analysis of periodic policies for the inventory routing problem

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

The graph association problem: Mathematical models and a lagrangian heuristic

Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Inequality‐based reliability estimates for complex systems

Full‐system testing for large‐scale systems is often infeasible or very costly. Thus, when estimating system reliability, it is desirable to use a method that uses subsystem tests, which are often less expensive and more feasible. This article presents a method for bounding full‐system reliabilities based on subsystem tests and, if available, full‐system tests. The method does not require that subsystems be independent. It accounts for dependencies through the use of certain probability inequalities. The inequalities provide the basis for valid reliability calculations while not requiring independent subsystems or full‐system tests. The inequalities allow for test information on pairwise subsystem failure modes to be incorporated, thereby improving the bound on system reliability. We illustrate some of the properties of the estimates via an example application. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

PXI计算机在一体化多模式发控系统中的应用

针对一体化火控系统的特殊性,提出了基于PXI计算机的发控技术,介绍了PXI总线计算机在一体化火控系统中的设计理念及其在一体化火控系统中的功能实现.应用表明,PXI计算机在火控系统测控领域具有广阔的应用前景.     

装备保障资源确定技术研究与需求分析系统开发

维修资源是实施装备维修工作的物质基础和重要保证,无论是平时训练还是战时抢修,维修资源都占据着十分重要的地位,不仅影响着装备的寿命周期费用(Life Cycle Costs,LCC),还直接影响着装备的战备完好率以及部队战斗力的保持和恢复.应用更加科学高效的方法确定保障资源,是维修决策面临的重要问题之一.据此,着眼于部队装备维修保障现状需求,将维修任务分配与保障资源需求紧密结合,提出了保障资源确定分析流程,并对分析过程中的关键技术进行了相应的研究,建立了典型的维修决策模型,优化了保障资源配置.最后开发了计算机辅助决策分析系统,为维修资源的优化配置起到了很好的辅助决策作用.     

一类带时滞的飞行器系统干扰观测器控制

复杂的飞行器系统容易同时受到外部干扰和时滞的影响,为改善该系统控制性能设计一种新的基于干扰观测器控制策略.通过构造辅助观测器以及适当的坐标变换观测将来时刻的干扰,得到相应的干扰预测规律.与传统的鲁棒控制律结合,能够保证系统的稳定性,同时干扰的影响可以得到实时补偿.仿真结果表明该方案在外部干扰和时滞共同作用下具有较好跟踪特性.     

干扰条件下防空兵通信装备系统效能分析

为研究干扰条件下防空兵通信装备系统效能,在ADC模型的基础上构建了ADCF系统效能模型,并结合实例对模型进行了仿真分析.仿真结果显示,该模型能较好反映敌方干扰对通信装备系统效能的影响.提出了干扰条件下提高防空兵通信装备系统效能的措施.     

基于不确定度的ATS评估系统设计与实现

ATS测量结果直接影响信号分析的准确性,保证测量结果的可信度对装备测试及故障诊断具有重要意义.首先以ATS中仪器资源的工作频率为分类原则,在此基础上建立了ATS的低频和高频测试通道模型,然后对测量不确定度理论进行了阐述,并设计了ATS测量不确定度评估系统.最后以万用表通道为例对ATS测量不确定度评定实现予以说明,保证了测量结果的完备性、一致性和可靠性要求.     

基于压缩估计的单星观测定轨方法研究

分析了单星观测模式下的天基测控系统的可行性,并针对该观测模式下轨道确定中法矩阵的特点,提出了一种基于压缩估计的定轨方法,该方法对法矩阵进行变换,避免了法矩阵奇异造成的误差传递。证明了当满足一定条件时,该压缩方法的估计精度要高于传统的定轨方法。并结合单星观测的特殊性,提出了误差传递因子,设计了单星观测下的压缩估计定轨算法。最后以单星模式下的天基测控系统作为仿真背景进行了仿真试验。结果表明,该压缩估计可有效提高单星观测模式下的轨道确定精度。     

基于MEKF的航天器姿态确定算法

乘性扩展卡尔曼滤波(multiplicative extended Kalman filter, MEKF)方法被广泛应用于各种航天器姿态确定任务。针对任意参考坐标系,推导了姿态四元数的线性运动学方程和三分量姿态误差矢量的动力学模型,并分别设计了有陀螺和无陀螺两种姿态确定方案。系统研究了姿态敏感器常用的矢量观测模型,四元数观测模型以及欧拉角观测模型,设计了更具有一般性的MEKF滤波器,为航天任务中快速应用MEKF姿态确定算法提供理论参考和技术支撑。