基于遗传算法的目标方位角估算

针对某型武装直升机加装微光电视瞄准系统后 ,提出了采用遗传算法进行微光电视图像的识别和提取 ,然后与模型基元进行图像匹配 ,来研究目标方位角的估算问题。经分析计算 ,能较好地满足需求 ,为微光电视瞄准原理的实现打下一定的基础。     

基于改进遗传算法的防空火力优化分配方法

结合地空导弹部队防空作战的特点,提出了基于改进遗传算法的防空火力优化分配模型,给出了模型求解的方法和步骤,详细阐述了改进遗传算法在防空火力分配中的应用,通过在计算机上仿真运行实例得出了火力分配方案,通过仿真证明本方法运算速度较快,结果精度较高,对地面防空火力分配决策研究具有一定的参考价值。     

基于机械故障诊断的算法及小波基选择研究

针对小波分析在机械故障诊断应用中的快速算法和小波基选择存在的问题,对常用的正交、半正交、双正交小波提取信号特征的能力进行了分析比较,研究表明半正交B样条小波因具有线性相位和采用较长的分解序列而具有较好的频率局部化特性和较小的变换误差,具有比较好的综合性能。推导了正交小波包的图形显示算法,利用该算法解决了小波变换快速算法中存在的数据长度随分解层数成倍减小的问题。研究结果为机械故障诊断中选择小波基进行信号处理提供了依据和途径。     

A stochastic model for burn‐in procedures in accelerated environment

Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

改进遗传算法求解电力网攻击无人机分队任务分配

遗传算法因其出色的寻优能力,自提出后就被广泛用于工程技术上的最优化问题求解。根据电力网攻击无人机分队任务分配的实际需要,提出基于遗传算法思想的解决方案,并在原算法基础上,采用种群分组进化的策略进行改进。详细介绍算法的基本原理和仿真步骤,再举出实际算例进行仿真,实验结果证明算法的改进取得了良好效果。     

改进人工蜂群算法的无人机航迹规划研究

如何快速地规划出满足约束条件的飞行航迹,是实现无人机自主飞行的关键。将改进的人工蜂群算法应用于求解无人机航迹规划问题,同时在人工蜂群算法的侦察阶段引入差分进化算法的思想。通过仿真实验并与标准人工蜂群算法比较,结果表明此算法能够有效加快收敛速度,提高最优航迹精度,是解决航迹规划和其他高维复杂函数优化的有效方法。