舰船可靠性对维修费用的影响分析

对两类主要影响因素分别建立了相应的数学模型．依据约化理论,建立了维修费用的ＶＡＲ模型．同时,根据统计资料分析了实际舰载主要设备的故障规律,指出了传统定时维修方式的理论基础的不完整性．     

紧固件拆装时间预计模型

紧固件拆装作业时间是影响机械产品维修性的主要因素之一,占机械产品维修作业时间的70％～80％。因此,探讨紧固件拆装作业时间的预计方法,对研究、设计机械产品的维修性,将是十分必要的。通过分析紧固件拆装作业过程,探索出了影响拆装作业时间的诸因素,并对所有的影响因素进行分析、权衡和回归,建立紧固件拆装作业时间的预计模型。将此模型在某型履带式车辆上进行了实际验证,证明了模型的正确性及通用性。     

基于最大熵谱估计验证战术导弹的气动模型

现代谱估计方法是验证系统仿真模型的有效方法。战术导弹飞行试验的遥、外测数据记录了大量的过程参数,可以利用这些参数进行气动力和气动力矩的计算,与飞行试验过程参数进行分析比较。应用最大熵谱估计检验导弹的气动力和气动力矩模型的可信性,可以给出定量的结果。文章给出的方法可以作为战术导弹气动参数模型研究的一种辅助手段。     

基于LPS模型的飞行器控制系统故障诊断方法

传统故障诊断方法一般针对测量信号而展开,未考虑其实际物理连接特性对故障诊断结果的显著影响。随着专业电气系统设计软件的广泛应用,设计人员容易获取系统的物理连接特性和逻辑连接特性。论文通过对产品层、系统层的信号、物理连接及其互连关系的分析,提出了一种将抽象的逻辑信号和具体的物理连线统一起来的逻辑物理综合(LPS)模型,并研究了基于导线表文件和网表文件的LPS模型实例化方法,开发了一套智能故障检测软件,进行了算例验证,结果表明：基于LPS模型的故障诊断方法能够将系统故障定位到指定产品级别上,具有极大的工程应用价值。     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

遗传算法在防空导弹火力优化分配中的应用

介绍了遗传算法的基本原理、算法设计并结合遗传算法主要解决了如何把目标分配给火力单元的问题,编写了相应的程序,并给出了一个基于遗传算法的火力优化分配方案。     

基于多DSP系统实现的非聚焦合成孔径实时成像处理

合成孔径成像是提高图像方位向分辨率的有效方法,但算法运算量大,在机载条件下往往实时性得不到保证。采用非聚焦成像算法可以在分辨率与运算量之间作一个折衷,可以在分辨率要求不是很高而需要实时性很强的情况下,输出方位向得到较大改善的实时图像。在简要介绍非聚焦合成孔径成像原理和TMS320C6203芯片特点的基础上,着重讨论了非聚焦合成孔径成像算法基于多DSP系统的实时实现,分析了系统性能并给出了实验结果。