具有策略偏好的模糊双矩阵对策模型及其应用

针对局中人对策略有偏好、支付值模糊的双矩阵对策给出了一种具体的求解方法,首先根据加权算子集结得到局中人的策略偏好向量、利用模糊数排序方式将模型转化为清晰的双矩阵对策,再利用粒子群优化算法求解.最后以雷达电子对抗为例,建立了具有策略偏好的模糊双矩阵对策的作战效能评估模型,研究结果对于双方资源分配,提高作战效能具有一定的军...     

数据拟合加速寿命试验智能优化设计

加速寿命试验方案的优劣,直接影响着试验的成本、效益和试验结果的准确性,因此有必要对试验方案进行优化设计,寻找最佳应力水平和试样分配比例,使加速寿命试验的结果最准确、代价最小.利用目标函数的连续性,提出一种基于离散数据的拟合方法,将加速寿命试验的优化设计转化为显函数的约束极值求解问题,然后将智能优化算法应用到加速寿命试验...     

基于关联分析法的指挥引导方式优化研究

指挥引导是作战指挥的重要组成部分,指挥引导效率的高低直接关系到作战效能的发挥。现代战争条件下,为完成某一作战任务,所需出动的兵力较多,空中态势复杂,如何合理分配指挥引导机构的指挥引导任务,选择有利的引导方式,对完成任务影响很大。因此,结合指挥引导的特点和要求,对指挥引导能力进行分析,设定相关参数的具体示例,运用动态规划理论、关联分析方法,通过建模和解算,确定各项指标的关联度,尝试解决影响指挥引导能力分配诸多复杂因素的关联问题,对指挥引导方式进行优化。     

基于遗传算法的战时维修保障系统优化研究

分析了战时维修保障系统的结构功能,给出了维修保障系统的解析模型,提出了维修保障系统的可控参数及指标;为了使维修保障系统发挥最佳效能,以最小二乘准则作为系统的优化准则,建立了维修保障系统的优化模型,采用遗传算法对优化模型进行求解,给出了计算方法,并以计算实例验证了方法的可行性。     

用伴随方程研究烟幕施放的优化问题

从描述烟幕扩散的基本方程出发,提出了一类烟幕施放的优化问题．文中指出,这类问题由于约束条件为复杂的偏微分方程,计算量很大,难以直接求解．为了解决这一问题,引入了一种伴随方法以降低计算量．推导了三维非平坦地形下大气平流一扩散方程的伴随方程,利用伴随方程和原方程的关系,对优化问题进行了等价变形,大大降低了计算量．最后通过一个算例,对这一方法的有效性进行了演示。     

应用单亲遗传算法进行大规模UCAVs任务分配

在应用GA求解大规模无人作战飞机(UCAVs)任务分配这个典型组合优化问题时,需要使用描述问题直观的序号编码方式,但由于传统的交叉、变异算子操作复杂,因而进化效率不高.针对上述的不足,提出了一种单亲遗传算法,采用序号编码,使用基因换位等遗传算子,简化了遗传操作.通过对单亲遗传算法、传统遗传算法求解该问题所得的结果作了详细的比较,证明了单亲遗传算法在寻优效率上的优越性.     

攻击型无人机巡弋搜索航路优化设计与仿真

为改进攻击型无人机待机段的飞行搜索性能,应用以最大值原理为基础的最优搜索理论对无人机待机搜索路线进行研究,得出光栅式、螺旋式和扫雪式三种搜索路线,并通过计算机仿真与传统的8字式搜索方式进行了比较.仿真结果表明,优化设计结果是合理的,证实了其有效性和可行性.     

最优化方法在摄像机标定中的应用

研究了最优化理论与方法在摄像机标定中的应用,并以两步法的第二步为例,详细介绍了如何根据最小化重投影误差这一非线性最小二乘问题求出所有标定参数的最优解,给出了用Guses-Newton法进行求解的具体步骤,并在Matlab下实现对一组初始数据的迭代优化.     

Aircraft routing under the risk of detection

The deterministic problem for finding an aircraft's optimal risk trajectory in a threat environment has been formulated. The threat is associated with the risk of aircraft detection by radars or similar sensors. The model considers an aircraft's trajectory in three‐dimensional (3‐D) space and represents the aircraft by a symmetrical ellipsoid with the axis of symmetry directing the trajectory. Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, a solution to this equation is expressed by a quadrature. A network optimization approach reduces the original problem to the Constrained Shortest Path Problem (CSPP) for a 3‐D network. The CSPP has been solved for various ellipsoid shapes and different length constraints in cases with several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact of variable RCS on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006