采用改进遗传算法的舰载机保障调度方法

舰载机保障作业过程受到多种资源约束,同时可能存在突发事件的干扰。针对此特点,分析并制定干扰情况下的模型修正策略。在遗传算法中引入禁忌搜索算子改进传统遗传算法的变异操作,并通过具体实例进行仿真验证,其结果证明改进后的遗传算法在优化含干扰事件的多机保障问题时效率更高,并通过甘特图直观地反映重调度方案,为真实情况下有效处理舰载机保障过程中的干扰事件奠定理论基础。     

The quadratic minimum spanning tree problem

This article introduces a new optimization problem that involves searching for the spanning tree of minimum cost under a quadratic cost structure. This quadratic minimum spanning tree problem is proven to be NP-hard. A technique for generating lower bounds for this problem is discussed and incorporated into branch-and-bound schemes for obtaining exact solutions. Two heuristic algorithms are also developed. Computational experience with both exact and heuristic algorithms is reported.     

强爆轰驱动超高速碎片发射装置设计因素分析

为了得到发射装置设计因素和超高速碎片性能间的关系,考虑了药型罩的材料、炸药种类、装药长径比、药型罩的锥角、药型罩的厚度、药型罩顶部靠近装药侧的曲率半径等设计因素,采用AUTODYNTM,结合正交试验,对超高速碎片的发射过程进行数值模拟。结果表明,3种发射装置结构分别可以提供质量为1. 533 g的紫铜碎片、速度为11. 649 km/s的铝碎片、动能为85. 6 k J的铝碎片; 2种发射装置结构均可以提供质量大于1 g、速度高于11 km/s的密实结构圆柱状碎片。验证了仿真方法的可信性,对影响碎片性能的设计因素进行了分析、排序,并得到了这些设计因素与碎片质量、速度、动能的关系。     

掠飞末敏弹耦合运动动导数计算

以新型掠飞末敏弹为研究对象,提出了基于欧拉转动定理和滑移网格技术的复杂角运动模拟方法,利用著名的罗德里格斯转换矩阵插值求得弹箭在每个时间步的角速度修正值,并指定给球形滑移网格区。通过对非定常气动参数进行求解辨识,分析了不同马赫数下掠飞末敏弹滚转运动对其俯仰组合动导数和升力系数动导数的影响规律。结果表明:所提角运动模拟方法可有效消除姿态角计算的累积误差,实现对弹箭任意给定角运动的准确模拟;弹箭滚转运动对俯仰组合导数和升力系数动导数的辨识结果均存在显著影响,在进行弹箭动导数计算和稳定性分析时需充分考虑俯仰耦合效应的影响。     

在求“变”中推进西南边防部队转型发展

西南边防部队驻防于我国西南边境地区,西起西藏自治区的日土县,东至广西壮族自治区的防城港市,担负着边防管控和边境防御作战等重要职能,在捍卫国家主权和安全中地位作用十分特殊。随着军队调整改革的深入落实,西南边防部队正处于转型重塑的关键时期,必须紧紧围绕新形势、新体制、新职能,着眼应急指挥、军事训练、边境管控、内外环境等关键要素和现实问题,在求"变"中推进创新发展,不断提升履职能力,切实为捍卫国家领土主权完整和维护边境稳定提供坚强保证。     

虚拟现实在心理战中的应用及展望

虚拟现实是用虚拟的情境模拟现实的世界,通过虚拟的多维空间,使用户体验到身临其境的感觉。文章通过深度剖析虚拟现实的历史沿革、发展现状与技术特点,结合其在军事中的运用以及发展前景,提出虚拟现实能够对心理战参战人员的心理训练、战场环境模拟和心理战效果评估提供借鉴和支持。     

进军新疆

1949年10月12日,中国人民解放军第一野战军第1兵团第2军从酒泉出发进军新疆。新疆地域辽阔,从酒泉至喀什2500多公里,沿途峰峦叠嶂,沙漠瀚海,冰川雪岭,艰险异常。官兵们顶风沙、冒严寒,日夜兼程,除了同严酷的自然环境斗争外,还随时准备粉碎国民党顽固分子发动武装叛乱。进军新疆的胜利,为新生的人民共和国西部边陲,筑起了一道坚不可摧的钢铁屏障。     

基于先验知识的降秩STAP方法研究

提出了一种基于杂波先验知识的降秩(RR)空时自适应处理(STAP)方法——KA-RR法,该方法首先利用载机平台运动参数、雷达系统参数及地形、地貌参数等先验知识构建机载雷达杂波模型,然后通过该模型对机载雷达杂波数据进行预白化处理,最后利用降秩STAP方法自适应抑制剩余杂波。仿真结果表明,相对于传统的降秩STAP方法,KA-RR方法具有更好的杂波抑制性能和更强的鲁棒性。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010