结合振动特征优选和GWOA-XGBoost的电机轴承故障诊断

为解决电机轴承故障状态难以识别,从而造成诊断精度不高的情况,提出了一种基于信号特征提取与极限梯度提升算法(extreme gradient boosting, XGBoost)结合的电机轴承故障诊断模型。使用优化的变分模态分解获得振动信号的固有模态函数(intrinsic mode function, IMF)分量,再基于多尺度熵理论计算各IMF分量的多尺度熵值进行特征重构。在鲸鱼优化算法(whale optimization algorithm, WOA)中引入遗传算法的选择、交叉、变异操作对WOA进行改进。用改进的WOA算法对XGBoost的超参数进行寻优,获得了帮助XGBoost取得最优分类效果的超参数组合,将7种不同故障类型的振动信号进行重构后输入优化的XGBoost模型进行故障诊断。实验结果表明,所提GWOA-XGBoost模型的电机轴承故障诊断精度能够达到97.14%,相较于传统诊断方法,性能提升效果显著。     

气隙磁密3次谐波对电机振动噪声的影响

针对电机的电磁振动噪声问题,发现了提高电机气隙磁密的正弦性不一定能够降低电机的振动噪声。鉴于此,分析了引起电机振动和噪声的主要力波阶次和频率,并探究了气隙磁密3次谐波与电机振动噪声的具体函数关系。为了分析引起电机振动和噪声的主要力波阶次和频率,在利用解析法的基础上排出力波表,确定了主要噪声源。为了探究气隙磁密3次谐波对电机振动噪声的影响,建立了气隙磁密及径向力波的数学模型,并通过遗传算法求解了电机气隙磁密3次谐波的最佳幅值。分析结果显示,提高气隙磁密正弦性不一定能够降低电机振动噪声,气隙磁密3次谐波在一定范围内存在最优值使得电机振动噪声最小。分析结果为低噪声电机的设计提供了参考依据。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

卡尔曼滤波的心动阵列实现研究

基于Faddeeva算法可以实现各种矩阵运算 ,并且可以方便地映射到心动阵列结构上这一事实 ,提出了一种基于Faddeeva算法的卡尔曼滤波心动阵列实现方法 ,并在此基础上设计了两种处理器拓扑结构。分析结果表明 ,这两种处理器结构具有效率高、规整性好和易于扩展等特点。     

多目标广义指派问题的模糊匈牙利算法求解

提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子.     

应用交互多模(IMM)算法跟踪低空目标

雷达跟踪低空目标时,由于多路径传播的影响,目标俯仰角的测量会出现测量误差.并且由多路径传播引起的测量噪声方差较大,在时间上具有相关性.应用交互多模(IMM)算法来提高跟踪低空目标的性能,并且提出了一种去相关的滤波方法来克服多径误差相关性的影响,最后给出了计算机仿真的滤波结果.     

网络图式通用装备保障文书生成的研究

网络图式军用文书是战时通用装备保障文书中通常采用的文书形式之一,给出装备保障文书辅助生成系统的总体结构,将网络分析方法引入通用装备保障文书辅助生成系统的研究,在此基础上阐述了网络图式文书生成子系统的功能、数学模型及网络计算、网络优化的部分算法。     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 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