序列近似优化方法

随着工程优化中仿真模型精度和计算时间的不断提高,常规的智能优化方法难以在可接受的计算代价中得到最优解。序列近似优化方法通过将近似模型技术引入优化过程,并采用不断更新采样点的方法来指导寻优,在基于计算耗时模型的优化中得到了越来越广泛的应用。通过论述序列近似优化方法的若干关键技术及其发展现状,可有效指导其在工程优化中的应用,并给出了序列近似优化方法可能的改进方法及发展趋势。     

片上多核处理器的非阻塞环设计与物理实现

针对少量强核构成的片上多核处理器,设计了一种非阻塞双向环结构。该结构包含5层3种不同类型的环链路层,分别用于传输命令、大量数据以及小量数据;采用源路由方式,设计专门的拥塞控制网络,防止报文的相互覆盖;路由器采用无缓冲无阻塞结构,单节拍通过环的每个跳步,以降低环的传输延迟并实现可预知的确定延迟传输。针对环的链路距离长、位宽大的挑战,通过实验选择了合理的中继器插入方法,并采用相邻导线交替插入反相器以及信号线反向交错排布等串扰优化方法,对环进行物理设计和长链路进行延时优化。最终实现结果表明,所设计的环达到了1 GHz的工作主频,并具备高达256 GByte/s的链路带宽,完全满足高性能数字信号处理的需求。     

二维非线性正交各向异性材料的瞬态热传导反问题数值方法

针对正交各向异性材料的二维非线性热传导反问题,采用顺序函数法进行表面热流辨识问题的研究。在求解反问题时,采用有限体积法、牛顿-拉夫逊法并引入未来时间步的概念。在每个时间步内,将待辨识热流视为非线性方程组的未知量,通过一个迭代过程进行求解。算例的研究表明,热流辨识结果与真实热流相近,从而证明了本方法在辨识二维非线性热传导反问题时是准确、稳定、有效的。     

基于排队论的防空兵力部署优化模型

兵力部署优化问题是防空指控系统的重要研究内容之一。针对多型防空武器多层多区段混合部署问题,对异型空袭武器和防空武器基于作战效能标准化处理,基于排队论给出空袭武器的突防概率计算模型,将防空武器系统综合防御效能作为优化目标,建立多型防空武器扇形部署优化模型。仿真实验验证了优化模型的有效性和合理性,可为科学制定兵力部署方案提供参考。     

基于群体协同的驱护编队中近程防空的系统效能

针对中近程反导的具体要求,分析了典型的驱护编队反导模式下编群队形特点,研究了指挥舰与护卫舰的队形关联性,探讨了基于信息化作战模式的抗饱和攻击能力,建立了基于多目标优化的最保守与最乐观情况下的抗饱和攻击模型,得到舰艇编队协同防空的系统效能,对驱护编队防空反导指挥决策具有很强的参考价值。     

基于LMD频域近似熵频谱感知算法研究

针对现有频域近似熵频谱感知技术在低信噪比条件下抗噪声性能和检测性能有待提升的问题,提出了一种基于LMD频域近似熵的频谱感知算法。(1)算法筛选出3个PF分量累加求和,使得算法提取局部调频包络特征信息得到最优,进一步排除噪声不确定度的影响。(2)算法对累加PF分量进行频域变换后求其近似熵,增强算法对频域信息的嗅探能力,提升算法检测性能。Monte Carlo仿真结果表明,在噪声不确定度为0dB,采样点数为8 000的情况下,当信噪比大于-19 d B时,可以对2ASK信号达到100%的检测概率,与现有频域近似熵算法相比,检测性能约有17 d B的提升。     

基于SPRT的组合导航故障检测与隔离互辅算法

针对SPRT(序贯概率比检验)算法无法准确判断缓变故障结束时间的问题,提出了一种故障检测与隔离互辅算法。采用SPRT算法对滤波残差进行故障检测,确认故障后隔离故障观测量,重新建立卡尔曼滤波观测方程并完成量测更新,将隔离后的滤波结果作为下一时刻的滤波初值辅助故障检测。仿真结果表明,该方法能准确定位故障观测量并判断出故障的结束时间,提高了系统可靠性。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Optimal division of inventory between depot and bases

We consider a problem of optimal division of stock between a logistic depot and several geographically dispersed bases, in a two‐echelon supply chain. The objective is to minimize the total cost of inventory shipment, taking into account direct shipments between the depot and the bases, and lateral transshipments between bases. We prove the convexity of the objective function and suggest a procedure for identifying the optimal solution. Small‐dimensional cases, as well as a limit case in which the number of bases tends to infinity, are solved analytically for arbitrary distributions of demand. For a general case, an approximation is suggested. We show that, in many practical cases, partial pooling is the best strategy, and large proportions of the inventory should be kept at the bases rather than at the depot. The analytical and numerical examples show that complete pooling is obtained only as a limit case in which the transshipment cost tends to infinity. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 3–18, 2017     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.