Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

(修，2撤3)关键几何参数对超声速膨胀器流场和性能影响的数值研究

为了揭示关键几何参数对超声速膨胀器流动特性影响的规律,对3种隔板安装角和5种出进口面积比超声速膨胀器设计工况下的流场进行了数值研究。结果表明：随隔板安装角增加,斜激波向出口迁移,斜激波强度略有降低,超声速膨胀器膨胀比减小,效率提高;随出进口面积比增加,流道内高速区显著扩大并逐渐靠近压力面,斜激波增强,出口流动损失增加,超声速膨胀器膨胀比增大,效率降低。为获得综合性能较优超声速膨胀器结构,需在较小出进口面积比和较大隔板安装角之间做折衷选择。     

利用支持向量机的矢量跟踪通道故障检测算法

为了克服卫星导航矢量跟踪接收机中故障通道对其他正常通道的影响,提高矢量跟踪接收机的鲁棒性,提出一种利用支持向量机的通道故障检测算法,利用矢量跟踪接收机的导航滤波器的新息序列作为支持向量机的输入。支持向量机的输出为通道的状态,根据支持向量机的输出通道的状态来判断该通道是否纳入导航滤波器,用来跟踪滤波器状态值,这样能够有效地避免故障通道对导航结果的污染。仿真实验结果表明:该方法能准确地检测出有故障的通道,提高矢量跟踪环路的鲁棒性。     

弹丸弹托结构参数对挤进阻力的影响研究

为了研究某滑膛武器弹丸弹托的不同结构参数及摩擦系数对挤进阻力的影响,分别以弹丸弹托的不同结构参数及摩擦系数作为单一变量,利用Ansys-workbench有限元软件分别对其挤进过程进行数值模拟仿真,得到挤进阻力的变化,进而分析该结构参数对挤进阻力的影响,从而为该滑膛武器弹丸结构设计提供了重要依据,也为同类武器的弹托设计提供了一定的参考价值。     

舰载武器作战使用条件仿真量化分析

运用层次分析法、本征向量法和多属性决策问题的数据处理等方法,对舰载武器作战使用的约束条件进行了量化分析和数据处理,系统地描述了单一约束条件和多个约束条件对武器有效使用的概率问题,建立了约束条件下,舰载武器作战使用仿真流程。研究结果对舰载武器作战使用具有一定的指导作用。     

SVM在空中目标威胁值评估中的应用

构建了基于回归型支持向量机的空中目标威胁值评估模型,确定了基于粗糙集理论的空中目标威胁因素,并建立了数据离散化、归一化的标准。将常用的4种核函数应用于对空中目标威胁值的估计,并通过基于网格法和遗传算法的搜索方法找到模型的最优参数。最后通过Matlab对算例进行了仿真验证。     

机动目标的航空集群协同探测策略

航空集群协同探测问题,是集群作战研究的重要内容,其中对隐身目标在不同机动,不同极化方式下的集群动态RCS研究是重点和难点问题。在双基地雷达建模和坐标转换的前提下,对隐身目标的两种典型机动——匀加速机动和匀速转弯机动进行建模,在HH、VV两种极化方式下,运用线性插值法对动态RCS进行时序分析。仿真结果表明,两种机动模型下,随着时间变化,动态RCS起伏波动较大,在匀加速运动模型下,HH、VV极化所引起的RCS差异性较大,匀速转弯模型下,不同极化方式带来的影响较小。     

基于大涡模拟的气体羽流分层特性数值模拟

采用大涡模拟(LES)对气体羽流分层特性进行数值模拟,分析了基于LES的气体羽流模型、控制方程和数值计算方法,探讨了LES在多组分气体羽流模拟中的应用;以文献[1]中氦气在空气中形成羽流的实验数据为参考,对所建模型进行验证。利用该模型对密闭空间油气泄漏过程进行数值模拟,计算结果表明油气在泄漏发生的240 s之内,不同组分表现出显著不同的分层规律:相对于空气,密度较大的组分聚集在空间下部20%的范围内;密度较小的组分主要分散在空间上部80%的范围内。研究结果为油库油气危险源安全监测与预警、火灾预防与扑救等提供了关键参数参考和工程设计理论依据。     

水顶油顺序输送油水混合模型研究

顺序输送是利用一条管道输送多种油品,因其可最大限度发挥管道输送潜能而被广泛应用。按照前后行液体不同可分为水顶油、油顶水和不同油品间顺序输送等,其中水顶油顺序输送主要用于管道撤收前的排空作业。对水顶油顺序输送油水混合过程进行了分析,建立了油水混合模型,利用CFD对其进行数值求解,并将仿真结果与前期理论分析进行了对比,两者吻合较好。所得结论可为机动管线水顶油排空作业提供科学指导。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015