创造性思维粒子群优化的武器目标分配

现代战争特点为防空作战中武器目标分配(WTA)问题的求解效率和质量提出了新的需求和挑战.建立了WTA问题模型,并选择粒子群优化算法(PSO)求解模型.针对PSO算法在求解WTA模型中出现的早熟收敛特性,从认知心理学角度进行分析,将创造性思维(CT)引入PSO的速度更新公式中,提出了一种基于创造性思维的PSO算法CTPSO.针对WTA模型的离散性特点,设计了编码与解码策略,及位置和速度矢量的离散化运算规则.实验证明了CTPSO算法在WTA问题求解质量和求解效率方面的优越性.     

多阶段任务系统可靠性并联冗余优化模型

多阶段任务系统是一类普遍存在的复杂系统,研究其可靠性冗余优化对于该类系统设计具有重要的参考价值。针对多阶段任务系统的可靠性并联冗余优化问题,提出了采用冗余故障树和冗余BDD来描述系统冗余结构的方法。给出了冗余模块在多阶段任务系统中的可靠度计算方法,建立了整个冗余多阶段任务系统可靠度计算模型。在此基础上以费用最小为目标,构建多阶段任务系统可靠性冗余优化模型,并应用微粒群算法对模型进行求解。算例验证了模型的合理性及算法的有效性。     

基于灰色理论的电子系统状态预测方法

电子系统的状态预测是利用其历史信息来实现系统未来状态和趋势的估计,以防止灾难性故障的发生,对于推动视情维修具有重要意义。针对典型模拟滤波电路,通过分析其关键测试信号的特点,研究了基于灰色理论的状态预测方法,并针对该预测模型的不足,设计粒子群算法选择最佳预测维数,设计新陈代谢法使该模型参数在线改变,从而建立符合电子系统信号特点的灰色预测模型。将该模型与ARAM模型比较,实验结果验证了该模型具有较好的状态预测精度和预测性能。     

工龄更换策略下的备件库存决策研究

针对单部件系统工龄更换策略下备件需求的特点,建立了工龄更换策略与备件库存控制的联合优化模型。该模型通过分析一个订购期内工龄更换间隔期T及备件最大库存水平S对系统寿命分布的影响,建立了工龄更换间隔期、订购间隔期及最大库存水平与单位时间总费用（包括维修费用和库存费用）的关系,然后以单位时间总费用最小为目标,优化工龄更换间隔期T、订购间隔期t0及最大库存水平S。最后,基于案例,运用Matlab对模型进行数值计算,结果表明模型能有效地降低单位时间的总费用。     

综合火控系统对地轰炸精度分析仿真

针对航空轰炸武器火控系统精度分析问题,分别建立了数值微分算法和蒙特卡洛算法模型,并开发了仿真分析软件.给出了两种模型的推导过程,以及微分步长的优化方法.利用本算法软件对某型火控系统进行精度分析仿真,并对多组典型投弹条件的仿真结果进行分析.结果表明,两种算法优势互补,能有效地对火控系统进行精度分析,对改进系统设计、提高系...     

基于预配装思想的物资混装配载优化策略

提出了一种基于预配载思想的装备物资混装配载策略,并应用模糊聚类和混合智能算法进行了实例仿真。研究对于组合优化策略在装备保障信息化系统建设中的应用具有积极意义。     

LFM脉冲雷达测距偏差分析与估计

研究了线性调频(LFM)脉冲体制雷达由于距离-多普勒耦合效应造成的测距偏差问题。推导、分析了该测距偏差的产生机理,指出了偏差中被大多数研究者遗漏的非线性余项,并分析了该余项与雷达发射信号及目标运动参数的关系;利用无约束优化方法对该偏差余项进行估计。最后,计算机仿真实验验证了分析结论和估计算法的正确性。     

Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Allocating capacity in parallel queues to improve their resilience to deliberate attack

We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011