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     

卫星导航抗干扰接收机信道大动态范围通用设计方法研究*

为适应“导航战”下的强干扰输入,导航接收机对模拟信道的动态范围提出了更高的要求。在给定的信噪比恶化容限约束下,原有的分析方法给出了二维曲线分析模型,得到了动态范围的优化设计及各级增益划分方法,但仅适用于输出功率基本不变的AGC电路。基于增加的AGC输出回退功率这一参数,论文提出了一种三维曲面求解模型,揭示了各电路参量与模拟信道动态范围的约束关系,可适用于输出功率变化的AGC电路,以实现更高的动态范围。针对三维模型中参数求解复杂的问题,利用纯衰减网络的特性将复杂的数值求解简化为直线求解,大幅降低了设计复杂度。在给出的设计实例中,动态范围测试结果与设计预期吻合较好,验证了方法的正确性。     

基于MDFT框架的海上能源通道航线动态决策建模与仿真

针对常规海上航线决策没有考虑决策选择过程的问题,引入多选择决策场理论（ MDFT）,构建了海上能源通道航线动态决策模型。基于信息完备、信息不确定和特殊情况等三种情景想定,进行了海上能源通道航线规划决策及其实验仿真。结果表明,决策过程受时间压力和信息质量的制约,时间压力会制约决策质量,同时还可能引起“偏好逆转”现象,信息不确定也会导致确定性决策。该模型不仅综合考虑了海上能源通道航线选择时需关注的各类要素,且模型参数可动态调整,进而能合理模拟真实的海上状况和决策过程。     

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

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

运载火箭芯级与助推级分离的数值模拟

采用动态重叠网格方法和双欧法,耦合求解非定常流动控制NS方程和6DOF运动方程,数值模拟运载火箭助推级和芯级的自由分离过程和附加外力作用下的强迫分离过程,并对芯级、助推级分离的主要影响因素进行分析。数值结果与试验结果吻合,表明动态重叠网格方法能正确预测火箭芯级与助推级间复杂的流动现象。根据数值模拟结果,给出助推级在不同分离工况下的分离参数及分离规律。     

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     

动态拓扑图的卫星网络可视化方法

针对高度动态变化的卫星网络,提出一种基于动态拓扑图的可视化方法。动态拓扑图可视化的难点在于如何保持动态可视化过程中的稳定性,从而使用户容易地感知到网络中所发生的拓扑变化。根据卫星网络的动态变化特点,构建连续的动态拓扑图模型;设计一种保持布局稳定性的策略,并基于力引导思想提出一种动态拓扑图布局算法;以Iridium系统为典型实例,验证本文的可视化方法的合理性和可行性。实验表明,该方法能够以清晰的可视化图像支持用户对卫星网络动态拓扑的感知和理解。     

基于CBM的航空装备保障费用动态分析

目前航空装备的保障普遍存在保障费用高和装备可用度低的问题。针对视情维修(Condition-based Maintenance,简称CBM)在新一代航空装备中的应用,以保证航空装备的战备完好性,降低维修保障费用为目标,应用系统动力学原理,建立基于视情维修的航空装备保障费用的动态反馈结构模型。仿真结果表明,将视情维修方法应用到航空装备保障,可有效降低保障费用,提高战备完好率。     

基于改进March SS算法的存储器测试技术研究

摘要：针对存储器的特点,介绍了存储器简化的功能故障模型．基于一种既可以测试静态简化故障又可以测试动态简化故障的MarchSS算法,提出了一种改进的存储器测试算法MarchSSI算法．该算法不仅能测出MarchSS算法测试的所有功能故障,而且能够覆盖MarchSS算法遗漏的故障,使算法故障覆盖率有了一定的提高．通过仿真,验证了算法的可行性．