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

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

应用单亲遗传算法进行大规模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     

强侧风作用下棚车气动外形优化

铁路通用车型中,强侧风作用下棚车的气动性能最差。利用二维定常不可压缩N-S方程、k-ε两方程紊流模型,采用有限体积法对强侧风作用下棚车气动外形进行了优化研究。结果表明,棚车车顶形状对强侧风作用下棚车气动性能有较大影响,圆弧型车顶的P65型棚车气动性优于“人”字型车顶P64型棚车;棚车侧壁和车顶圆弧采用圆弧过渡比直接连接的效果好,综合考虑棚车气动性能和有效容量两方面因素,建议车顶圆弧和过渡圆弧半径分别取2692mm和500mm。     

遗传算法在装备调拨辅助决策中的应用

利用遗传算法求解装备调拨中的路径优化问题和运输装载问题,并利用MATLAB进行了实例仿真,对装备调拨的辅助决策具有积极的意义。     

可测试性技术中的图论问题及其求解

近 2 0年来 ,为了解决结构日益复杂的电路测试问题 ,可测试性技术得到了迅速发展。在可测试性技术中 ,针对不同的测试对象 ,如何对可测试性设计方案以及测试策略进行优化 ,降低总体代价 ,是亟待解决的问题。为了解决这两类典型的优化问题 ,首先应用图论方法建立问题的拓扑描述模型 ,然后通过构造相应的逻辑求解函数 ,给出问题最优解的求解算法 ,并通过简单实例演     

线型数据通道高层综合的运算单元优化分配算法

运算单元分配是高层综合的关键算法之一。采用了一种面向数字信号处理应用、规则的线型数据通道模型,其中心思想是全局互联的最小化。以最小着色算法构造的一个初始分配为起点,采用随机进化算法对其进行迭代改善,以减小数据寄存器数和运算单元之间的数据交换。最后还给出了典型实例的实验结果。