Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

尾流自导鱼雷带角射击弹道仿真

为简化指控系统解算流程,缩短指控系统解算尾流自导鱼雷带角射击参数时间,为后续的鱼雷模拟器的软件研制提供实现手段,提出在尾流自导鱼雷有利提前角射击弹道的基础上进行二次转角航行的改进的尾流自导鱼雷带角射击模型。依据尾流自导鱼雷射击原理,结合有利提前角射击和二次转角射击,对所提出的模型及其约束条件进行了分析与推导,简化了鱼雷带角射击参数的解算。深入分析了尾流自导鱼雷带角射击逻辑,提出采用面向过程设计方法对模型进行仿真,经过对仿真输出图形和仿真数据的分析,验证了所提出模型的准确性。     

基于来袭鱼雷方位变化率的制导类型识别技术

对来袭鱼雷的制导类型进行识别是水面舰艇实施有针对性鱼雷防御的前提条件,方位变化率则可作为类型识别的一个重要的识别依据。首先,从不同类型潜射鱼雷的发射方式和弹道特征入手,分别推导出潜射直航鱼雷、声自导鱼雷、尾流自导鱼雷方位变化率的表达式。其次,仿真分析了不同类型潜射鱼雷方位变化率的影响因素。最后,在给定的态势下,给出了四种不同类型潜射鱼雷方位变化率随雷舰距离的变化规律曲线。仿真结果能为鱼雷制导类型识别提供一定的参考依据。     

基于粒子群优化的观测站部署算法

针对红外观测站部署问题,在研究观测站位置对定位精度影响的基础上,提出了基于粒子群优化的观测站部署算法。首先对ECEF坐标系下的CRLB矩阵进行推导;然后将观测站优化部署问题抽象为非线性规划模型,并将红外传感器联合定位的CRLB作为目标函数;最后采用粒子群优化算法求解该模型,避免了传统的非线性规划算法需要求解目标函数梯度的难题。结果表明,本文的部署算法具有一定的理论依据和工程意义;可以为实际红外观测站的静态部署和动态部署提供参考。     

The burglar problem with multiple options

We consider the burglar problem in which a burglar can either retire or choose among different types of burglaries, with each type having its own success probability and reward distribution. Some general structural results are established and, in the case of exponentially distributed reward distributions, a solution technique is presented. The burglar problem's relationship to a stochastic knapsack problem with a random exponentially distributed knapsack capacity is shown. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 359–364, 2014     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

航空时敏制导炸弹增程弹道组合优化设计

为增强航空时敏制导炸弹在中制导段的滑翔能力,将极小值原理与自适应进化粒子群算法相结合,提出了一种适用于航空时敏制导炸弹增程弹道的组合优化设计方法。基于纵向平面内质心运动模型,推导了性能指标泛函及各不等式约束函数。引入Lagrange乘子矢量并建立相应的Hamilton函数实现无约束泛函极值问题的转换,推导出兼顾各优化目标函数的满意优化模型。利用自适应进化粒子群算法对该段增程弹道进行了攻角与弹翼张合档位双设计变量的组合优化。数值仿真算例表明,在满足状态方程约束的条件下,双变量的增程效果比常规单变量控制时显著提高,其优化结果可为制导炸弹弹道规划设计的研究提供一定的理论参考。     

液压平衡式发射装置自航发射内弹道模型与仿真

基于装备情况,探讨了潜艇液压平衡式发射装置自航发射鱼雷的可行方案,并建立了后端自流补水的自航发射方式的内弹道模型,进行了计算机仿真。通过试验结果描述鱼雷螺旋桨工作特性,分析了自航发射鱼雷出管速度偏低的原因,并提出改进措施。     

反舰导弹大空域变轨的三维扩展比例导引律

为了使大空域变轨弹道的理论研究更符合反舰导弹的实际运动状态,建立了反舰导弹追踪虚拟目标的三维空间相对运动模型。同时,为了保证反舰导弹大空域变轨弹道的四段弹道平滑过渡,在导引律设计时同时考虑了脱靶量要求和末端落角要求。应用Lyapunov稳定性理论求解出满足要求的三维扩展比例导引律,对大空域变轨弹道的四段弹道设计了相应的过载控制指令,并进行了仿真研究。仿真结果表明:所提出的三维扩展比例导引律可以使反舰导弹顺利完成大空域飞行任务,而且保证了反舰导弹的所有性能指标均满足要求。     

基于可能性决策的敌对危机行动预测与仿真

可能性决策能较好地应对军事领域常常出现的概率难以获得,或者强调“出奇制胜”而有意规避概率风险的情形,是解决知识不完备情况下敌对行动预测的有力手段。从可能性理论基本公理体系出发,结合动态规划方法,提出并证明可能性决策的最优化定理,给出多步条件下可能性决策的实现算法,结合危机条件下敌对行动预测的范例和仿真分析,与传统概率风险决策进行比较,体现可能性决策的优越性,为该方法的推广应用创造条件。