基于理想点距离算法的灭火作战方案优选

分析了传统的灭火作战方案优选方法存在的弊端,提出了基于模糊集理论的计算理想点距离的优选法,明确了语言变量与模糊集理论的相关定义,规定了模糊评价语言与三角模糊数的换算方法,阐述了理想点距离的计算方法,建立了灭火作战方案优选模型,验证了该方法在灭火作战方案优选方面的科学性、有效性以及合理性.     

航天器隔振器多目标优化方法

由于存在各种高频内部扰动,高精度航天器通常需要进行隔振设计,而被动隔振装置被广泛采用。在被动隔振装置设计中,抑制共振响应峰和隔离中高频振动存在很强的冲突性,需要进行多目标优化设计。建立了隔振系统的动力学模型,提出了以传递函数共振峰幅值和中高频衰减为目标函数的多目标优化模型;提出了基于分解的多目标进化算法对单级和两级隔振装置进行多目标优化的设计方法;对某空间隔振装置进行了数值仿真,结果验证了本文算法的有效性。     

某自行火炮全弹道多学科优化设计

为提高某自行火炮弹丸的杀伤效能,寻求该火炮全弹道设计参数间更优的匹配关系,并缩短全弹道设计周期,根据其包含的内弹道、外弹道和终点效应3个分学科之间的耦合关系,建立自行火炮全弹道多学科优化设计模型。以射程最大、杀伤面积最大为优化目标,进行全弹道优化设计。与单目标优化方法对比,多目标优化有效提高了该火炮弹道的综合性能,避免了单个目标优化时其他目标劣化的现象。     

基于关联度的词汇记忆优化算法

近年来,记忆词汇的方法不断涌现,但是这些方法仅仅考虑其中某一方面因素,而非综合考虑多方面因素。鉴于单词间拼写和发音重合度对于词汇记忆的重要性,融合了单词拼写和发音重合度,提出了基于单词间关联度的词汇记忆方法,结合图论知识给出了单词最优记忆回路的近似算法,运用Matlab编程对大学英语四级词汇进行了排序,通过实验和假设检验验证了使用基于单词间关联度的词汇记忆方法的记忆效率明显优于普通方法。     

基于SQP法的助推-滑翔导弹助推段弹道优化

高超声速助推-滑翔导弹的弹道优化问题涉及攻角、法向过载、最大动压等多种约束条件,是一种复杂的最优控制问题。序列二次规划法（ SQP ）是解决该类问题行之有效的数值优化方法。首先给定了助推-滑翔导弹助推段的动力学方程并建立数学模型,之后利用SQP算法对助推-滑翔导弹助推段进行弹道优化仿真,获得满足各种约束条件的优化弹道。经分析可得SQP算法可以为导弹助推段寻找到一条最优弹道,从而为助推-滑翔导弹的整体结构设计提供了有益的参考。     

基于粒子群优化算法的低空突防航迹规划

本文提出了运用粒子群优化算法来对飞机低空突防进行航迹规划的方法。首先,说明了飞机突防需要满足的物理限制和战术要求。其次,根据低空突防航迹规划约束多,计算复杂的特点引入粒子群优化算法,并且对其进行简要的介绍。应用粒子群优化算法对低空突防战术进行航迹规划。最后实验结果表明,该方法能够对飞机低空突防过程规划出可行的飞行航迹。     

基于滚动时域的C2组织决策层结构动态适应性优化

针对C2组织决策层结构适应性优化问题,定义了决策层结构与使命的适应性测度,分析了影响C2组织决策层结构的不确定因素,建立了决策层结构适应性优化模型.为了降低决策层结构适应性优化问题求解所面临的不确定性和减少决策层结构变化成本,设计了基于滚动时域的动态适应性优化方法,在提升决策层结构性能的同时控制了决策层结构变化成本.通...     

Optimization of steerable sensor network for threat detection

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于优化算法的Free-form型机床各轴.运动方程及其对齿面误差的影响

以No.116铣齿机为例,通过推导传统摇台型机床、Free-form型机床中的坐标变换矩阵,根据运动等效转换的原则,应用最小二乘优化原理,用多项式拟合出Free-form型机床各轴的运动方程.通过算例分析,传统摇台型机床与Free-form型机床中的坐标变换矩阵高度吻合,用各轴运动方程在CATIA软件中虚拟加工出的螺旋...