基于变分模态分解的非稳态备件需求预测方法

备件需求量的预测是备件配置的重要内容,针对当前装备备件需求非稳态的特点,提出一种基于变分模态分解的备件需求预测方法.运用变分模态分解将非稳态备件需求序列分解为若干模态分量,引入模糊熵的概念,将周期性、随机性和长期性特征明显的模态分量进行有效聚合,提高计算效率,进而运用预测效果较好的径向基神经网络预测法对聚合后的模态分量分别进行预测,将各分量预测结果进行整合形成最终的备件需求预测值.通过案例分析与实验对比,结果表明提出的方法能够有效挖掘非稳态备件需求序列的深层次信息,实现非稳态备件需求序列的较好拟合,并与其他非稳态时间序列预测方法对比具有较高的预测精度,为适应新时代实战实训背景下备件需求的特点提供了有效的方法支撑.     

基于改进边际优化算法的备件配置研究

针对传统边际优化算法在解决备件配置优化问题存在运算效率不高的问题,提出了基于改进边际优化算法的备件优化配置方法。在传统边际优化算法思想的基础上,提出了改进的边际优化算法,通过引入备件短缺系数,提高了算法的优化效率。给出了该优化算法的设计思想和优化流程,并在理论上分析了算法的优化效率。通过算例数值结果的分析,验证了算法在保持最优解精度的情况下,大幅提高了运算效率,为备件库存配置优化提供了指导。     

多级可修备件库存的生灭过程建模与优化

针对VARI-METRIC模型在低可用度下结果不准确的问题,建立基于生灭过程的任意等级、任意层级可修件库存优化模型。通过对各级站点、各类备件需求率与到达率的预测,对每个部件建立其生灭过程模型,并提出基于生灭过程的装备可用度计算方法。以整个保障系统的装备可用度为约束指标,以备件总购置费最低为目标,利用边际算法得到最优备件配置方案,并建立仿真模型对所得优化方案进行评估与调整。结合算例,以仿真结果作为检验标准,选取权威的VMETRIC软件与该解析模型在优化性能、计算精度及适用性上进行对比和说明。结果表明,无论是解析模型还是VMETRIC软件,均存在一定的适用范围,而采用解析与仿真相结合的方法无疑具有更强的适应性。     

基于改进的神经网络的军械备件需求预测

针对当前军械应急保障中备件供应需求依据经验判断,从而导致保障不精准的现实问题,浪费应急保障资源,削弱部队战斗力.在对军械备件需求量进行分析时发现,军械备件需求符合间断型备件需求特征.基于改进的神经网络军械应急维修备件需求预测模型,利用神经网络模型的强大非线性函数的拟合能力,将间断型的备件需求分解为两步.最终,将两个序列预测结果综合分析,得出军械备件需求预测结果.根据改进神经网络预测模型,结合某单位某军械装备保障数据,用总体数据的4/5作为训练数据,1/5作为测试数据进行预测,实验结果表明,改进的神经网络预测模型预测精度优于其他预测模型,预测精度符合预期,可以为军械应急保障提供依据.     

电控共轨柴油机初始控制MAP研究

为合理快捷地获取电控柴油机的控制参数表MAP,进行了共轨柴油机电控初始MAP研究。分析了柴油机运行工况特点和试验获取特征工况数据的原则;引入了散点曲面拟合方法,简要说明了Shepard有理插值曲面理论和它的Lagrange插植的形式;根据柴油机运行工况的特点,提出了变步长试验点,减小试验量,引入均方根误差衡量不同试验点数拟合控制MAP的精度,结合实例给出了电控初始MAP的散点曲面拟合过程,并在493共轨柴油机上进行初始MAP的控制效果试验,试验数据表明：该方法能满足电控柴油机初始MAP的要求。     

作战模式及需求不确定条件下备件供应优化

高度不确定性是战时备件保障面临的难题之一,主要体现在作战任务想定的多样性以及备件需求的波动性.针对以上问题,分别将作战模式的不确定性和需求的不确定性转化为离散和连续型不确定参数,采用鲁棒优化方法进行建模.以战时备件供应延迟时间最短为目标,以备件满足率和供应成本为硬约束,构建了战时备件供应的鲁棒优化模型.利用元启发式算法对模型进行求解.算例结果表明,鲁棒优化模型的最优解对应最短的延迟时间,同时可以保证战时备件供应"最差情况下"的可行性,即具有很好的鲁棒性.     

作战飞机航材备件储备优化分析

本文在讨论航材备件需求概率分布的基础上,从分析备件保障率入手,研究了确定备件储备标准和计算备件储备量的方法,并建立了在经费不足条件下备件储备优化的数学模型和算法。     

考虑需求相关的可修复系统备件配置模型

对于一个拥有多台相同设备的可修复系统来说,一种备件的需求以及其对应的备件保障方案将影响着系统的可工作设备数量,从而影响着设备其他备件的需求,故假设备件需求相互独立且与系统自身备件保障方案无关而开展备件配置研究是不合理的.在考虑备件需求相关以及备件的保障方案对备件需求的影响的前提下,利用马尔可夫理论描述了备件需求规律,针对不串件拼修和串件拼修两种情况分别给出了可用度的计算方法,并在此基础上以备件配置费用作为优化目标,以可用度作为约束构建备件优化配置模型,给出了边际分析求解模型的方法.通过案例分析,验证了模型的正确性.     

面向任务的随舰备件配置方法

研究了多阶段任务成功概率的计算方法,根据舰船多阶段任务的特点,建立了随舰备件配置模型.提出了系统修整过程中确定备件配置方案的分析方法与系统执行任务过程中基于粒子群算法的备件配置模型.经实例分析表明:该模型既满足了任务成功概率的要求,又充分利用了舰船排水量和宝贵的备件存储空间,对于随舰备件的配置具有普遍的适用性.     

面向AL的战略级仓库备件供应优化方法

针对维修备件供应保障费用较高、管理难度较大等问题,借助自主式保障(AL)理念设计了面向AL的维修备件调度与供应优化框架,提出面向AL的战略级仓库维修备件供应优化思路。在此基础上,为了解决战略级仓库备件供应路线规划不科学、弥补半定量经验方法不足的情况,建立了带混合时间窗的多供应地——多需求地维修备件供应路线优化模型,设计了求解模型的GA-SA混合算法。最后运用算例进行了说明。     

一种非均匀噪声下的DOA估计算法

通用协方差差分算法用来实现对空间非均匀噪声环境下相干信号的波达方向(DOA)估计,该算法可以完全消除空间非均匀噪声,且适用于低信噪比环境,但该算法的DOA估计结果存在伪峰。针对这一问题,提出了一种改进的算法。改进算法通过对通用协方差差分(GCD)算法的信号协方差矩阵进行变换,再用特征分解的方法得到信号的DOA估计值。改进的算法可以完全消除伪峰,理论分析和仿真实验验证了改进算法的有效性。     

Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

基于卡尔曼滤波的单矢量水听器水中多目标方位跟踪

对单矢量水听器接收的声压和质点振速信息进行联合处理,采用量子粒子群求解声压和质点振速组成的非线性相关方程组,从而实现多目标声源方位的估计。对于低信噪比的情况,难免会引入较大的方位估计误差。采用最小二乘法对目标方位轨迹进行拟合并建立预测模型,然后通过卡尔曼滤波对单矢量水听器估计的目标方位轨迹进行优化。结果表明：单矢量水听器能够同时分辨多个目标方位,解算结果应用统计特性表示;信噪比越高,分辨率和精度越高,偏差越小;对于水中目标而言,1阶多项式足以进行方位轨迹拟合,再采用卡尔曼滤波能够有效提高目标方位跟踪精度。     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

A robust queueing network analyzer based on indices of dispersion

We develop a robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueing network of single-server queues with Markovian routing. The algorithm allows nonrenewal external arrival processes, general service-time distributions and customer feedback. The algorithm is based on a decomposition approximation, where each flow is partially characterized by its rate and a continuous function that measures the stochastic variability over time. This function is a scaled version of the variance-time curve, called the index of dispersion for counts (IDC). The required IDC functions for the external arrival processes can be calculated from the model primitives or estimated from data. Approximations for the IDC functions of the internal flows are calculated by solving a set of linear equations. The theoretical basis is provided by heavy-traffic limits for the flows established in our previous papers. A robust queueing technique is used to generate approximations of the mean steady-state performance at each queue from the IDC of the total arrival flow and the service specification at that queue. The algorithm's effectiveness is supported by extensive simulation studies.     

Optimizing the quality control station configuration

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations, existing machines, and optional quality control stations (QCSs). Our aim is to decide on the allocation of the QCSs within the assembly line, so as to maximize the expected profit of the system. In such a problem, the designer has to determine the QCS configuration and the production rate simultaneously. The profit maximization problem is approximated assuming exponentially distributed processing times, Poisson arrival process of jobs into the system, and the existing of holding costs. The novel feature of our model is the incorporation of holding costs that significantly complicated the problem. Our approximation approach uses a branch and bound strategy that employs our fast dynamic programming algorithm for minimizing the expected operational costs for a given production rate as a subroutine. Extensive numerical experiments are conducted to demonstrate the efficiency of the branch and bound procedure for solving large scale instances of the problem and for obtaining some qualitative insights.

相似文献   

数据采集中脉冲丢失补偿算法

针对测试中遇到的脉冲丢失问题,采用脉冲边沿、脉冲到达时间和脉冲间隔等特征量,设计了快速进行脉冲丢失位置定位和补偿的算法。仿真结果表明,该算法能有效地解决脉冲丢失的问题,对脉冲敏感型的数据分析和故障诊断具有重要意义。