Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000     

点堆中子动力学方程的刚性研究

用去耦合法在不作假定的条件下导出不含中子寿命的先驱核密度方程 ,也达到了将刚性限制在中子密度方程中的目的 .     

A competitive genetic algorithm for resource-constrained project scheduling

In this paper we consider the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective. We propose a new genetic algorithm approach to solve this problem. Subsequently, we compare it to two genetic algorithm concepts from the literature. While our approach makes use of a permutation based genetic encoding that contains problem-specific knowledge, the other two procedures employ a priority value based and a priority rule based representation, respectively. Then we present the results of our thorough computational study for which standard sets of project instances have been used. The outcome reveals that our procedure is the most promising genetic algorithm to solve the RCPSP. Finally, we show that our genetic algorithm yields better results than several heuristic procedures presented in the literature. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 733–750, 1998     

槽头式野战管线水击波速计算方法研究

按照弹性水击理论,管线内发生水力瞬变时,其水击波速取决于管子的弹性、流体的可压缩性和管子受约束的情况。对于给定的输送介质,焊接式固定输油管线的水击波速是一个常数。而槽头式野战管线采用连接器连接,胶圈密封,这种特殊的连接方式改变了管子整体的弹性摸量,从而使水击波速的常规计算方法不再适用。本文研究了野战管线连接器连接方式时水击波速的影响,实验研究了在受到约束时,橡胶的弹性模量随所受压力的变化而变化的规律,推导出野战管线水击波速平均计算方法,推导的公式表明:与焊接式固定管线不同,野战管线的水击波速随管线内压力的增大而增大。     

防空导弹发动机的模态分析

对某型号防空导弹发动机结构的固有特性进行了较为系统的研究,分别从理论计算和试验测试２ 个方面进行了分析,并在这２ 种分析的基础上对它们进行了比较。初步确定了发动机的固有模态,为今后防空导弹发动机乃至导弹结构动力响应分析提供参考依据,为今后开展进一步的结构动力学研究提供模型基础。     

复杂网络影响力极大化快速评估算法

分析复杂网络中影响力极大化问题,设计一种新的启发式算法框架。针对信息传递中节点的交互方式进行分析,给出节点在任意时刻处于信息接收态的概率。通过期望计算得到种子节点集传播影响力的近似估计,实现集群影响力快速计算,进而得到基于序列采样的影响力极大化快速评估算法。特别地,对于六个来自不同领域的真实网络上的影响力极大化问题进行了研究,仿真结果表明：该方法能够高效识别网络中具有重要传播影响力的节点集,在三种常见度量准则下的表现均明显优于三种影响力极大化问题基准算法。     

稀薄流气粒两相耦合作用的热力学模型

基于直接模拟Monte Carlo(DSMC)方法,从描述粒子微观运动层次出发,构造高空稀薄环境下气体一颗粒两相双向耦合作用的热力学模型,发展适用于稀薄流过渡区多相复杂流动的DSMC算法.通过算例验证,结果表明,此模型能够较好地反映相间动量和能量传输机制.     

基于系统动力学的部队穿插迂回行动决策

围绕部队穿插迂回行动的两个目标,依据穿插迂回行动过程所具有的多阶段性特征,建立了部队穿插迂回作战行动决策的系统动力学模型,该模型充分考虑了信息化条件下指挥控制、通信网络、后装保障等因素对部队穿插迂回行动的影响,较好地克服了传统建模方法的不足.利用此模型,对某坦克营穿插迂回行动进行了仿真,分析了多种情况下穿插迂回时机和穿插迂回攻击目标的方案选择,为部队穿插迂回行动的正确决策提供了定量依据,说明了该模型的有效性.     

潜射导弹出水过程空化流数值计算

运用Zwart-Gerber-Belamri空化模型,采用动网格和复合网格技术,提出复杂外形潜射导弹出水过程中空化流数值计算方法。对头肩部、舵面及突起物的空化生成、演化及影响因素进行分析。仿真结果表明:出水过程初期空化数降低使附体空泡迅速扩大,随后对空泡脱落与振荡的影响将更为显著;肩部以15 m/s的速度出水时产生空化并随速度上升而迅速增长,5°~10°攻角时肩空化非对称性显现;舵面空化受出水速度影响较小,攻角小于等于5°时空化面积小于全舵面积的10%,但攻角大于5°后空化面积迅速增长至50%以上;减小突起物尺寸有利于避免空化产生,突起物空化受攻角影响较小,但在高速下可诱导临近弹体产生空化。