弹炮混编防空群火力分配优化问题研究

以火力分配原则为依据,在确定防空武器对目标的可射击系数、火力重叠修正系数和转火矛盾修正系数的基础上,结合防空作战的实际,通过对高炮、地空导弹不同运用方式的分析,介绍了解决弹炮混编防空群火力分配优化问题的一般步骤。通过算例,证明了该方法的可行性。     

战区弹药保障敏捷供应链优化模型及实现算法

针对现有的供需矛盾,在分析战区弹药保障供应链管理任务需求的基础上,初步构建了战区弹药保障敏捷供应链管理框架及运行机制,分析了战区弹药保障敏捷供应链的供需协同机制,重点对多级库存优化控制模型、多级弹药配送决策优化模型及实现算法进行了研究,提出了战区弹药保障敏捷供应链建设的具体对策。     

指数型产品可靠性验收试验的一种贝叶斯方法

采用贝叶斯方法 ,利用大量的历史数据和工程技术人员的丰富经验确定先验分布 ,制定出验收试验的一种新方案 .按照这一方案 ,在确保产品质量的前提下 ,可大大节省试验时间 ,从而得到十分可观的经济效益 .     

The multivariate Polya distribution in combat modeling

This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001     

激光远场光斑检测中信号采集与转贮技术研究

设计了16×16面阵靶板多路探测信号的采集与转贮系统电路,用于信号采集及向上位机的传送。系统采用W 77E58为采集电路的CPU,以FT245BM为核心构成USB接口电路,实现了256路信号的快速采集与转贮,较好地解决了对多路探测器实时快速采集和向上位机传送的问题,从而使激光远场光斑测试系统能够实时测量远场光斑的能量分布和变化情况。     

基于封闭爆炸的弹药破片空间分布研究

通过典型弹丸爆炸试验,研究封闭条件下破片的空间分布,提出了爆炸洞体防护的重点区域。试验表明:对于某型高弹丸,主要分布在以弹丸为爆炸中心的20°角的环状严重区域内;对于某型加弹丸,主要分布在以弹丸为爆炸中心的35°角的环状严重区域内。     

防空导弹兵力规划模型

借助兵力交换的思想,从宏观层次上研究不同类型的防空导弹火力单元对空中目标的优化分配问题;分析在最优目标分配策略下区域防空中各类型防空导弹火力单元的火力分配问题,并建立了递阶优化的求解模型.该模型可为区域防空部署的决策与分析提供科学依据.     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

进度风险的随机网络建模与仿真分析

为研究装备研制工程进度的风险分布特征,建立了包含正态分布、β分布、三角分布的随机网络进度风险分析模型,通过蒙特卡罗法仿真获得工程项目的进度估计及其统计分布特性,从而获得工程总工期的风险,并结合实例进行了分析.