航空装备抢修时间估算方法

装备战场抢修是保持和恢复战斗力的重要方法,而抢修时间对战场抢修的效果有着重要影响,甚至直接影响着战争的进程。准确预测并确定装备的抢修时间有利于战场指挥员合理分配抢修力量,有针对性地开展抢修工作,以最大程度地保持和恢复装备战斗力,使战伤装备尽快重新投入战斗。以航空装备某电子系统为例,建立了战场抢修时间的计算模型,并对模型进行求解,实例证明,该方法对于预测并确定战场抢修时间提供了一种有效的途径。     

区间条件下有限制期的应急物资动员方案选择

分析了不确定条件下应急物资动员系统网络结构的特征,把应急物资动员问题抽象为动员点选择、动员点上动员量的确定和动员点到需求点的最佳路径调配等问题.采用区间数刻画动员时间的不确定性,建立了有动员限制期的应急物资动员方案模型,给出相应的求解思路和计算步骤.最后,以某区域突发事件发生后汽油类物资动员方案的生成为例,得到区间条件...     

一种基于纳什议价解的自组网时隙分配策略

自组网中的分布式多节点资源分配问题为NP完全问题,一般采用启发式算法进行协议设计,缺少严格的数学证明.基于博弈与纳什议价解理论,提出了一种分布式动态时隙分配策略,并通过严格的数学推导,证明了自组网中不同节点之间的时隙竞争问题存在纳什议价解,为自组网中分布式动态时分多址信道访问控制协议的设计提供了理论依据.     

分布式实时网络半实物仿真方法研究

介绍了基于分布式实时网络的复合寻的制导武器半实物仿真试验环境建立的基本方法,对其工作原理、主要设备和技术进行了分析。     

高可靠性软件的极值统计分析

提出了极值统计分析的方法.对于失效数据极值分布函数的拟合检验,采用了相关系数法;对于母体分布的参数估计,则分别采用了最小二乘估计(LSE)和极大似然估计(MLE);最后通过一个实例说明了统计过程,并用模拟的方法证明了最小二乘估计较好.     

延迟时间模型参数的极大似然估计

介绍了基于客观数据的延迟时间模型参数极大似然估计方法,提出了应用优化理论中的单纯形法求解似然函数的算法,为延迟时间模型的参数估计问题提供了可行的解决方法。通过计算机模拟数据的验证,此方法切实可行,结果可以满足需要。     

一种评价发动机实际技术状况的方法

通过系统的实验,建立了某一型号发动机对应于不同使用时间的空载减速时间数据库,然后在未知某同类型发动机实际使用时间的情况下,通过测取此发动机的空载减速时间,能较正确的评价此发动机的实际技术状况.     

基于时间序列预测的独立分量排序

独立分量排序是独立分量分析的热点问题,是提高特征空间鲁棒性和减少计算复杂度的必要前提。结合ICA在时间序列预测的应用,给出了基于一阶差分和最小方差误差的多分量联合重构预测排序准则。为了避免联合优化中出现的海量计算问题,提出了添加-测试-接受机制(ATA)的次优搜索方法。实验结果表明,和传统排序方法比较,新方法具有优异的预测能力和搜索效率。     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011