单小批量武器装备保障的质量屋模型研究

摘要：针对单小批量武器装备保障的特殊需求,对传统的质量屋模型进行了改进,建立了基于装备保障需求与保障规则的质量屋模型,利用整数规划技术进行求解,使得单小批量武器的装备保障规则按照实际保障需求重新排列优先次序,并通过对某型火炮保障方案的筛选验证了模型的正确性．新的质量屋模型发展完善了质量屋的理论与方法,有助于提高单小批量武器的装备保障能力．     

基于小样本数据的作战计划生成方法

针对部队实兵对抗实验数据生成和采集的投入高、难度大的实际,提出基于小样本数据生成作战计划的方法：首先,采用偏最小二乘回归分析法建立作战因素与作战结果间的多元非线性模型;其次,采用改进的遗传算法,在MATLAB平台编程实现了对模型的整数规划求解,并通过实例验证算法的有效性;最后,利用作战因素的重要性排序分析作战计划的调整流程。     

基于GDOP的多基地雷达布站优化研究

以BLUE算法和GDOP为基本定位算法和精度分析工具,评估多基地雷达的定位性能,建立以GDOP最小值最小和有效监控区最大为目标的多基地雷达布站优化模型.仿真结果表明,通过以下措施可提高定位性能:①增加收发站总数;②采取扇形方式布站;③优先增加部署接收站;④交替部署收发站;⑤通过优化模型优化扇形布站分布角总和.     

混合不确定条件下的飞行器级间分离可靠性分析

为量化飞行器级间分离过程随机不确定性和认知不确定性的综合影响,结合概率和区间理论混合模型特点,提出了一种基于随机和区间理论混合模型的飞行器级间分离可靠性分析方法。面向高超声速飞行器分离任务需求,建立分离动力学仿真模型,针对级间分离结构的几何特点,设计了一种快速碰撞检测方法,进而构建了分离任务的可靠性分析混合模型。通 过将该模型转化为随机可靠性分析的无约束优化问题,考虑分离过程中复杂外力及力矩导致功能函数高度非线性的特点,利用高效全局优化和主动学习Kriging方法实现无约束优化问题高效求解。结合实例表明,该方法能够准确描述混合不确定性因素对飞行器分离过程的影响,给出了飞行器分离任务可靠性区间,可为飞行器分离方案的精细化设计提供决策支持。     

链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

联合作战系统效能评估

采用面向过程的系统分析方法建立了一个对联合作战系统效能比较精确的量化评估模型.模型以某个参考系统为标准,先作层次分析,然后通过模糊对比,把各层次中难以具体量化因素进行了量化,再通过判断矩阵得出各自权重,最后线性加权便可以得到总的系统相对于标准系统的优劣程度,是一种面向过程的系统分析.该方法适用面广,对复杂系统效能评估工作有一定指导意义,具有广阔的应用前景.     

卫星任务调度问题的约束规划模型

卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。     

Application of Markov renewal theory and semi-Markov decision processes in maintenance modeling and optimization of multi-unit systems

In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory.     

Integrating decisions with advance supply information in an assemble-to-order system

We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model.     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.