基于数值模拟的弹药地面库整库燃爆冲击波毁伤风险评估

弹药燃爆事故是我军后方仓库安全管理工作防护的重点,对弹药燃爆事故危害度进行评估,是武器装备安全风险评估体系的重要组成部分.选取地面库整库弹药燃爆事故为研究对象,应用AUTODYN计算程序,建立了弹药地面库的三维空间有限元仿真模型,并对弹药地面库整库爆炸的冲击波传播过程进行了数值模拟,得到了在冲击波不同毁伤等级下人员、建筑物的毁伤区域,为燃爆事故危害度风险评估提供了数据支持.     

基于弹药效能分解的装备战损建模方法研究

针对传统装备战损建模方法通用性较差、难以满足装备实际维修需求的缺点,提出了基于弹药效能分解的装备战损建模方法,具体包括弹药毁伤效应建模、装备结构描述建模、装备抗毁性数据库建模3部分.该方法对装备战损的精细程度进行分析,并且可以求得针对某个可更换单元的维修工序,从而为装备维修保障提供决策依据和参考.     

弹药库防静电方法研究

根据弹药库静电危险场所的分类等级,以形成静电危害的3个基本条件为依据,讨论了弹药库防静电危害常用措施:设施设备静电接地、防静电工作台、人体静电防护、铺设导电(或防静电)地面以及各自防静电要求.这些措施为防止和消除弹药库的静电危害提供了根本保障.     

基于粗糙集和TOPSIS的弹药目标匹配研究

针对多种弹药打击同一目标的弹种选取顺序问题,即弹药目标匹配顺序问题,从弹药毁伤和目标抗毁伤机理人手,构建弹药目标匹配指标体系,利用粗糙集理论约简弹药目标匹配指标体系并确定指标的客观权重,运用加权TOPSIS确定弹药目标综合匹配顺序,为最优火力分配决策提供了理论依据。     

Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Dynamic lot‐sizing model with production time windows

We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T⁴) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T⁵) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007