Some new results on the preservation of the NBUE and NWUE aging classes under the formation of coherent systems

We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed.     

采用遗传算法的弹托迎风窝结构设计

针对一体化弹丸弹托易分离性和轻质化的设计要求,构建弹托迎风窝参数化外形模型,基于激波和膨胀波理论建立弹托气动力计算模型;以弹托分离加速度和弹托质量综合最优为目标函数,采用遗传算法对弹托迎风窝的外形参数进行优化设计,从而得到弹托迎风窝的优化外形。以中口径尾翼稳定脱壳穿甲弹的弹托设计为例,采用提出的优化设计模型对其迎风窝结构进行优化设计,并采用基于动网格技术的弹托分离仿真模型验证其最优性。仿真结果表明：所提优化模型能够得到最优的弹托迎风窝结构;针对现有的中口径尾翼稳定脱壳穿甲弹,可进一步对其弹托结构进行优化,以提高其分离快速性。     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

武警部队快速机动中最优路径的实现

紧急条件下武警部队快速机动最优路径,是一个多目标多约束随机动态交通网络寻优问题。在分析交通网络拓扑化特点及最短路模型前提下,着重研究道路通行能力带给复杂公路网络道路寻优问题的影响,并结合GIS系统利用改进的Dijkstra算法求解。     

面向多星观测调度的分层迭代算法

提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。     

预报基座结构噪声的有限元方法研究

有限元法适用的频率范围与单元的大小有关,为了用有限元准确地描述高频振动(结构噪声),一个振动波长中至少划分4个单元.由此,根据研究问题的频率范围更合理地确定单元的大小,并适当选取计算的规模,预报了某基座模型2000Hz内的结构噪声,此研究具有工程应用意义.     

遗传算法在非线性回归模型辨识中的应用

对遗传算法在非线性回归模型辨识中的应用进行了探讨,切削温度回归模型辨识的实例表明,该方法是有效的.     

二阶矩模糊随机过程的均方极限

给出了二阶矩模糊随机过程均方极限的两种定义,证明了这两种定义的等价性,并讨论了二阶矩模糊随机过程均方极限的性质。     

二次型极小化问题的迭代算法

在新的控制条件下,证明了二次型极小化问题的迭代算法的有效性,所得结果改进了徐洪坤关于二次型优化的最新结果。     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051