On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

穿甲子弹垂直侵彻防弹钢试验与理论模型

试验研究了穿甲子弹垂直侵彻高强防弹钢的机理,提出了一个分析靶板极限速度和弹体剩余速度的理论模型,该模型综合考虑了材料的应变率与热软化效应,结果表明,理论值与试验值吻合很好.分析了失效准则的影响,研究了剪切带温度和靶板耗能随入射速度的变化规律.     

海战场时空查询及索引机制研究

针对目前海战场信息系统的不足,引入时空数据技术对战场数据建模,并支持设计了海战场时空数据库原型系统.对系统要求的时空查询问题进行归纳,结合海战场数据特性加以分析,为后续的索引建立提供了依据.3D R-tree相较现有的其他时空索引更适用于海战场的环境,并通过扩充部分的弥补了其检索效率的不足.     

五阶HWCNS格式在低速复杂流场中的应用

采用五阶精度显式HWCNS格式求解雷诺平均NS方程，利用多块对接结构网格技术，对30P-30N多段翼型进行网格收敛性研究，在不考虑转捩的情况下采用SA一方程湍流模型研究HWCNS格式与二阶精度MUSCL格式对该翼型压力分布和典型站位速度型的影响，并与实验结果进行对比分析。采用HWCNS格式和SA一方程湍流模型模拟梯形翼高升力构型低速复杂流场，通过对总体气动特性和压力分布的分析，探讨五阶精度显式HWCNS格式在低速复杂外形流动中的应用能力。     

在轨加注过程中组合体航天器动力学建模与分析

针对在轨加注过程中质量分布随时间变化的组合体航天器,研究动力学建模问题并对其动态特性进行分析。将航天器系统分为刚性组合体平台和贮箱内燃料两部分,贮箱内的燃料视为质量、外形和位置连续变化的质量块,将航天器系统抽象为一组有固定边界的变质量质点系;在推导出变质量质点系一般力学方程的基础上,通过对航天器结构进行一定限制消除方程中的反冲力和失调力矩,以组合体平台主轴作为参考坐标系,建立在轨加注过程中组合体动力学模型;该模型除了参数时变的特点外,与普通刚体动力学相比还含有阻尼项;基于李雅普诺夫稳定判据,对该时变动力学系统的动态特性进行分析。仿真计算展现了不同结构参数对姿态运动轨迹的影响,也证明了理论分析的正确性。     

基于MDA的HLA仿真技术框架设计

近年来MDA在分布式仿真特别是在HLA仿真技术中的应用情况缺乏对MDA与HLA结合的仿真技术整体性的认识,不利于仿真系统开发的宏观指导.基于MDA的HLA仿真技术框架的提出就是从系统的角度研究基于MDA的仿真系统开发过程.该框架从模型通用性的静态角度和建模仿真过程的动态角度出发,分为HLA仿真系统主题域的划分和HLA仿真系统开发过程两部分进行了全面的分析,为今后开展基于MDA的HLA仿真研究提供了一种宏观的指导方法.     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

一种面向Agent的概念化建模方法*

面向Agent的建模方法为基于Agent系统的概念化描述提供了一种新的技术.针对多Agent系统分析与建模问题,扩展并规范了面向Agent概念化建模过程,定义了Agent模型及其扩展模型,并给出了形式化描述.同时,给出面向Agent的分析和设计过程,为其具体建模提供了一种高层指导.最后,与其它现有面向Agent的方法在应用方面进行了类比分析,为该方法的广泛和深入地应用研究打下基础.