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.     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

原始变量守恒形式控制方程的时间准确性分析

基于压力、速度和温度的原始变量为自变量的守恒形式的控制方程可应用于定常流动问题，但是在求解非定常问题，例如某一典型激波管问题时，激波后温度出现过冲现象，即使通过细化网格、提高空间格式精度或者换用其他通量格式仍不能消除，这表明误差可能来自该方法本身。采用一维Euler方程对该方法进行数值分析。分析结果表明，数值误差来自时间项。通过构造相应的双时间步方程，虚拟时间项采用原始变量，而物理时间项采用守恒变量，并在两个相邻物理时间步内作为定常问题求解，可以收敛到相应的守恒形式，消除上述误差，得到准确的非定常数值解。     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

水下航行体惯性类水动力系数的计算方法

为了系统地计算水下航行体全套惯性类水动力系数,提高计算效率和计算精度,通过基于无粘模型的计算方法对水下航行体的运动进行了预报;通过UDF及动网格技术,对匀速运动和匀加速运动的SUBOFF模型进行了分析.设计了单方向速度线性变化的匀加速直线运动和匀加速回转运动,并通过换算和数值拟合处理得到了潜艇所受的惯性力和惯性类水动力系数.该系数与试验误差保证在6％之内,验证了所提方法的可行性及准确性.     

短路故障的测试产生方法

在PCB上,两个不相邻的芯片管脚或引线发生短路是实际应用当中最常见的故障。通过分析固定型故障和桥接故障之间的关系,给出桥接故障测试序列产生的系统计算方法。该方法已应用在一个PCB故障测试系统中。     

穿甲弹对自行火炮易损性分析与计算

分析了自行火炮在穿甲弹作用下的易损性,建立了自行火炮易损性计算模型,并以某型自行火炮为例,分别计算了该炮在120mm穿甲弹正面命中与侧面命中时的毁伤概率。     

基于CFD的磁射流抛光去除机理分析

应用计算流体动力学(CFD)方法分析了一种新型精密抛光技术——磁射流抛光的材料去除机理。磁射流抛光中,含有磨料的磁流变液射流被喷嘴出口附近的局部外加纵向磁场磁化,产生准直的硬化射流束来进行相对远距离的精密抛光。介绍了磁射流抛光的原理和实验装置,分析了磁流变液聚束射流的形成,通过一系列定点抛光实验研究了磁射流抛光工艺的材料去除分布特征,利用计算流体动力学的方法分析了垂直冲击和倾斜冲击情况下,磁流变液射流与工件表面相互作用时径向流场功率密度的分布特征。实验结果和仿真计算结果表明:磁流变液射流在工件表面径向扩展流动产生的径向剪切作用导致了材料去除;CFD方法能模拟抛光区去除率的三维分布,因此可以准确地预测抛光区形状。     

固-液旋流分离器结构优化模拟研究

采用计算流体力学方法与流体动力学分析软件Fluent,探讨了固-液旋流分离器的溢流口直径、锥角、圆柱段长度和入口直径等主要结构参数对其颗粒溢流率的影响,并在此基础上进行结构参数的优化。结果表明,锥角、圆柱段长度和入口直径过大或过小都不利于旋流分离器的固液分离,均存在一个最佳值。对于主直径为75 mm的单锥双入口固-液旋流分离器,最佳圆柱段长度为87.0 mm,最佳入口直径为16.0 mm,最佳溢流口直径为16.5 mm,最佳锥角为6.0°。     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003