基于Holtrop公式与遗传算法的船型参数优化

针对方尾水面舰船,采用Holtrop阻力计算公式,以总阻力为目标函数,据遗传算法,对主要的船型参数进行了优化计算,进而得出了在一系列速度下主要船型参数的最优解及相应的由Holtrop公式计算得到的总阻力,并绘制了在各最优解下由Holtrop公式计算的总阻力随速度的变化曲线,结合Holtrop公式相应图谱对所得优化计算结果进行了分析.结果表明,该方法对于水面舰船的主尺度比等船型参数优选具有较强的实用性.     

基于PSO-RBF神经网络的雷达目标识别

为提高雷达系统目标识别能力,对粒子群算法及RBF神经网络进行了分析。针对离子群算法(PSO)易陷入局部极小的缺陷,提出了基于自适应时变权重和局部搜索算子的改进PSO算法,并将该算法应用到RBF神经网络核函数参数的优化学习中,进行了雷达目标识别仿真实验。仿真结果表明,相对于标准PSO-RBF神经网络,改进算法不仅收敛速度快,且误差精度高,特别在干扰较强时,目标的识别率有较大提高。     

minimax问题的广义共轭向量法

本文按照共轭向量法的理论,针对非奇异对称矩阵提出了广义共轭向量的概念,并论述了它的三个重要性质(线性独立性、可寻驻点和可扩展性)。在此基础上,构造了极小极大(minimax)问题的广义共轭向量法。理论分析表明,该算法具有二次终止性质,且在每一维搜索时具有确定的寻优特征(求极小或求极大)。该算法为用拉格朗日乘子法求解数学规划提供了一个可能的途径。计算实例表明该算法是有效的。     

野战防空C3I系统的目标指示雷达测量误差对目标火力分配的影响

以某野战防空Ｃ３Ｉ系统为背景,针对目标雷达的测量误差对系统目标火力分配的影响进行了分析,在系统分别配置警１７雷达和３８７雷达的情况下,通过仿真给出目标落入武器单元火力范围的最大概率和概率分布曲线图,提出系统建模应考虑的一些因素,为大系统的性能分析和总体建模奠定了基础     

A COMPLEX OF TWO OPTIMIZATION IDEAS IN OPTICAL AUTOMATIC DESIGN

ＡＣＯＭＰＬＥＸＯＦＴＷＯＯＰＴＩＭＩＺＡＴＩＯＮＩＤＥＡＳＩＮＯＰＴＩＣＡＬＡＵＴＯＭＡＴＩＣＤＥＳＩＧＮＷａｎｇＹｏｎｇｚｈｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＰｈｙｓｉｃｓ,ＮＵＤＴ,Ｃｈａｎｇｓｈａ,４１００７３）Ａｂｓｔｒａｃｔ：...     

用有限元法优化高射机枪结构设计

以某高射机枪为研究对象,采用有限元法对该枪进行建模,并用实验研究的结果检验和修改了理论模型。计算了该枪的结构动态特性和枪口动力响应,从改善射击精度的角度出发,通过对若干结构修改方案的模拟计算,提出了该枪结构修改的参考意见。     

基于改进广义成本函数的可靠性分配优化

可靠性分配优化问题的难点在于影响分配的各类因素与可靠性指标间关系的描述与表达.从可靠性成本与各类影响因素的内在关系人手,通过改进广义成本函数进行各类影响因素的融合处理,构建得出新的可靠性分配优化模型实现可靠性指标的综合求解.     

一种高效的通信电台测试点优化故障诊断策略

针对通信电台的测试诊断问题,通过建立“故障一测试”相关性矩阵,提出了一种GADPSO算法与最大诊断信息量准则结合进行通信电台故障诊断的方法．GADPSO算法收敛速度快、计算精度高,既避免了陷入局部最优和早熟收敛,又提高了优化效率;最大诊断信息量准则能全面评判测试点,快速有效地获得测试顺序．该方法为通信电台故障诊断提供了一种高效诊断策略．     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

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