Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

Simulation on the dynamic stability derivatives of battle-structure-damaged aircrafts

Accurately evaluating the aerodynamic performance of a battle-structure-damaged aircraft is essential to enable the pilot to optimize the flight control strategy. Based on CFD and rigid dynamic mesh techniques, a numerical method is developed to calculate the longitudinal and longitudinal-lateral coupling forces and moments with small amplitude sinusoidal pitch oscillation, and the corresponding dynamic de-rivatives of two fragment-structure-damaged and two continuous-rod-damaged models modified from the SACCON UAV. The results indicate that, at the reference point set in this paper, additional positive damping is generated in fragment-damaged configurations; thus, the absolute values of the negative pitch dynamic derivative increase. The missing wingtip induces negative pitch damping on the aircraft and decreases the value of the pitch dynamic derivative. The missing middle wing causes a noticeable increase in the absolute value of the pitch dynamic derivative;the missing parts on the right wing cause the aircraft to roll to the right side in the dynamic process, and the pitch-roll coupling cross dynamic derivatives are positive. Moreover, the values of these derivatives increase as the damaged area on the right wing increases, and an optimal case with the smallest cross dynamic derivative can be found to help improve the survivability of damaged aircraft.     

Revenue management under randomly evolving economic conditions

We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019     

分布式态势感知一致性分析与度量方法研究

一致的态势感知,是现代武器、火力系统以及部队紧耦合协同作战的基础。本文以分布式态势感知理论为依据,从系统的角度,构建了团队达成一致态势感知过程的动力学模型;以系统内部一致性、外部一致性和一致所需最短时间为指标,给出了团队态势感知一致性的度量方法。仿真结果表明,适当地提高团队内沟通的广泛度和相互作用强度,选择合适的沟通网络,对提高一致性能力有积极的作用。     

污泥龄对污泥絮体中磷酸盐形态及其动态变化的影响

以污泥龄(SRT)为10 d和30 d的2组A/O-SBR反应器活性污泥为研究对象,探讨了SRT对污泥絮体中磷酸盐形态及其动态变化的影响。结果表明,污泥絮体中的磷主要分布于胞外聚合物(EPS),EPS磷占污泥絮体磷总质量的69.45%~73.36%。正磷酸盐(PO3-4-P)、低分子量聚磷酸盐(LMW Poly-P)和高分子量聚磷酸盐(HMW Poly-P)是污泥絮体磷的主要形态。高SRT(30 d)污泥絮体EPS磷含量明显大于中SRT(10 d),表现为前者较后者有更高的PO3-4-P和HMW Poly-P含量,对应着高SRT(30 d)污泥絮体较中SRT(10 d)有更高的磷含量,前者约为后者的1.37倍。厌氧/好氧反应过程中,中SRT(10 d)污泥絮体EPS磷的厌氧降低量和好氧升高量分别为高SRT(30 d)的1.35倍和1.46倍,主要归因于前者的PO3-4-P和HMW Poly-P较后者有更大的厌氧降低量,而PO3-4-P,LMW Poly-P和HMW Poly-P较后者有更大的好氧升高量,对应着中SRT(10 d)污泥絮体较高SRT(30 d)有更强的厌氧释磷和好氧吸磷能力。     

救生伞背带参数对假人动载的影响研究

针对救生伞假人高速开伞空投试验,建立降落伞-背带-假人系统的动力学模型,分析背带及脱离锁参数对假人质心过载的影响。在合理简化的基础上,采用多体动力学方法建立降落伞、背带脱离锁和假人的十五自由度动力学模型;采用质量-阻尼弹簧模型建立背带模型,连接降落伞、脱离锁和假人;利用实测过载计算降落伞开伞力。利用所建立的动力学模型仿真典型状态下假人和背带的动力学响应,验证所建立模型的合理性。分析脱离锁位置、背带松紧程度、背带材料特性对假人质心最大过载的影响,用于指导背带设计以及确定最佳的背带脱离锁位置。     

基于Simulink的履带车辆离合器动态仿真实现

以系统仿真软件MATLAB中的Simulink软件包为工具,通过对摩擦离合器工作过程特点的分析,在合理假设的基础上,建立了离合器工作过程中的动态仿真模型。得到的仿真结果对于离合器的实际测试及其故障检测分析有一定的参考作用。     

弹炮混编防空群兵力分配模型

针对对付现代日益发展的空袭手段的一种有效方法--弹炮混编防空布势中存在的防空武器种类繁多,兵力分配复杂,难以充分发挥各自效能的问题,建立了非线性规划模型,利用动态规划对该模型进行分析,运用拉格朗日降维法进行降维,将三维降为二维.经防空作战的实例验证该算法不但能将两维降到单维,而且还可以将多维降到单维,能节省计算机的内存使用率,提高仿真计算的速度,符合信息化条件下指挥决策实时化的要求且分配效果较好.     

SCB型钢结构防火涂料热分解动力学模型研究

用热重法(TG)对SCB型钢结构防火涂料的热分解过程进行了分析,并用微分法中的Achar法对热分解的数据进行处理,用多种机理方程进行了拟合,发现SCB型防火涂料的热分解可分为四个阶段:第一阶段热分解属于随机核化,第二、第三、第四阶段热分解属于三维扩散,球形对称机理。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016