最小自由能法计算烟火药剂热值

烟火药剂的热值计算在烟火研究领域有着重要的作用．本文根据最小自由能原理,通过一系列基本假设计算出了体系燃烧爆炸反应后的热值,计算结果与实验衡量数据相吻合,并且程序可通过进一步完善,扩展应用于非理想气体,提高计算精度．     

驱护舰编队防空火力分配决策模型研究

驱护舰编队防空火力分配的确定和优化是最大限度地发挥驱护舰编队的整体作战能力的关键。为了高效地发挥驱护舰编队火力优势,用运筹学理论建立了驱护舰编队防空火力分配决策问题的优化模型,分析了各种解决此模型的方法的优缺点,并尝试运用粒子群优化理论(PSO)求解该模型。实例计算分析表明,所提出的方法较好地解决了驱护舰防空火力分配决策问题,为舰艇编队指挥员进行防空火力分配决策提供了一种有效的参考处理方法。     

近程简易控制火箭末修的效率分析

阐述了脉冲控制力实施简易控制的特点,针对某近程单兵火箭建立了其弹道模型,在弹体周向布置两种大小不同的脉冲发动机,采用两种脉冲延时分级控制的控制策略对其实施简易控制,对其控制时刻、转速影响、分档设计等进行了分析证明对该单兵火箭实施简易控制是可行的.     

Inventory control and periodic price discounting campaigns

This paper develops an inventory model that determines replenishment strategies for buyers facing situations in which sellers offer price‐discounting campaigns at random times as a way to drive sales or clear excess inventory. Specifically, the model deals with the inventory of a single item that is maintained to meet a constant demand over time. The item can be purchased at two different prices denoted high and low. We assume that the low price goes into effect at random points in time following an exponential distribution and lasts for a random length of time following another exponential distribution. We highlight a replenishment strategy that will lead to the lowest inventory holding and ordering costs possible. This strategy is to replenish inventory only when current levels are below a certain threshold when the low price is offered and the replenishment is to a higher order‐up‐to level than the one currently in use when inventory depletes to zero and the price is high. Our analysis provides new insight into the behavior of the optimal replenishment strategy in response to changes in the ratio of purchase prices together with changes in the ratio of the duration of a low‐price period to that of a high‐price period. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

On equivalence between the proportionate flow shop and single‐machine scheduling problems

We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015     

Generation and storage dispatch in electricity networks with generator disruptions

We present methods for optimizing generation and storage decisions in an electricity network with multiple unreliable generators, each colocated with one energy storage unit (e.g., battery), and multiple loads under power flow constraints. Our model chooses the amount of energy produced by each generator and the amount of energy stored in each battery in every time period in order to minimize power generation and storage costs when each generator faces stochastic Markovian supply disruptions. This problem cannot be optimized easily using stochastic programming and/or dynamic programming approaches. Therefore, in this study, we present several heuristic methods to find an approximate optimal solution for this system. Each heuristic involves decomposing the network into several single‐generator, single‐battery, multiload systems and solving them optimally using dynamic programming, then obtaining a solution for the original problem by recombining. We discuss the computational performance of the proposed heuristics as well as insights gained from the models. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 493–511, 2015     

Scheduling research and the first decade of NRLQ: A historical perspective

It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015     

多准则下反导作战单、多遭遇点预测模型

整个反导射击过程可以简单看作一个基于预测的遭遇点起始的,不断重复、修正的过程。分析遭遇点预测的时间和空间前提,并给出遭遇点预测的3个基本准则;在多准则下建立了单遭遇点预测模型,给出了模型公式中未知量的转化方法;分射击-观察-射击和射击-射击两种情况建立了多准则下多遭遇点预测和优化模型,并给出了拦截弹最晚发射时间的计算方法;就观察时机对遭遇点预测的影响进行了分析与建模。部分研究属于探索性的研究,相关结论对指控模型开发和实施连续反导,从方法和作战理念方面提供了一些参考。     

SPH并行计算方案及其在自由表面流动模拟中的应用

针对光滑粒子动力学主要计算量是近邻粒子搜索这一特点,提出了一种基于粒子分解的光滑粒子动力学并行计算方案。利用该方案可以方便地将任意串行光滑粒子动力学代码并行计算,而且每一个时间步内的信息传递量只和粒子总数有关,而和粒子的分布无关,因而特别适合于自由表面流动等大变形问题的并行数值模拟。对一个粒子总数为40万的三维溃坝问题的模拟结果表明:此方案能达到的最大加速比约为16,这一结果可能比空间分解方案(不考虑动态负载均衡)更优。     

基于凸-改进遗传算法的圆阵列方向图联合优化

针对圆形阵列方向图具有较高旁瓣的问题,提出一种新的基于凸优化和改进遗传算法的优化方法。该方法首先采用遗传算法将阵元位置和阵元权值作为优化变量,以最小化波束方向图峰值旁瓣为目标函数进行联合优化,既增加了变量的自由度,又符合理论意义上的全局寻优;同时,为了避免算法的早熟收敛,对基本遗传算法进行了必要的改进。然后采用凸优化方法对阵元权值进行二次优化可进一步降低旁瓣电平,与传统方法相比能够明显提高优化效果的稳定性。仿真数据证实了该方法的有效性和正确性。