Progress in design optimization using evolutionary algorithms for aerodynamic problems

Evolutionary algorithms (EAs) are useful tools in design optimization. Due to their simplicity, ease of use, and suitability for multi-objective design optimization problems, EAs have been applied to design optimization problems from various areas. In this paper we review the recent progress in design optimization using evolutionary algorithms to solve real-world aerodynamic problems. Examples are given in the design of turbo pump, compressor, and micro-air vehicles. The paper covers the following topics that are deemed important to solve a large optimization problem from a practical viewpoint: (1) hybridized approaches to speed up the convergence rate of EAs; (2) the use of surrogate model to reduce the computational cost stemmed from EAs; (3) reliability based design optimization using EAs; and (4) data mining of Pareto-optimal solutions.     

基于Kriging代理模型的约束差分进化算法

广泛应用的高精度分析模型使得飞行器设计优化的计算成本不断增加,为了缩短优化耗时,基于代理模型的进化算法（SAEAs）近年来得到了广泛关注。针对现有SAEAs处理约束优化问题优化效率低下的缺陷,提出了一种基于Kriging代理模型的约束差分进化算法（KRG-CDE）,结合约束改善概率与最优适应度定制了一种改进的可行准则,从而提高新增样本点的潜在可行性与最优性,并根据种群改善情况,平衡算法全局探索与局部搜索性能。标准测试算例对比研究结果表明,相比于基于全局与局部代理模型的差分进化算法、（μ+λ）-约束差分进化算法,KRG-CDE算法在优化效率、全局收敛性及鲁棒性等方面具有显著优势。最后,运用KRG-CDE算法求解全电推卫星多学科设计优化问题,验证了该算法的工程实用性。     

基于改进多目标布谷鸟搜索算法的翼型气动优化设计

布谷鸟搜索（CS）算法是一种新型的受自然现象启发的元启发式智能优化算法，其强大的全局搜索能力和收敛速度受到了广泛关注。多目标布谷鸟搜索（MOCS）算法是一种在单目标布谷鸟算法基础上发展的可以直接求解Pareto解集的多目标优化算法。针对原始MOCS算法的不足，采用一系列措施以提高算法的收敛精度、收敛速度以及解的均匀性：通过引入非支配排序与拥挤距离来改进解的适应度评估；通过改进随机游走策略来提高局部搜索能力；通过引入改进的自适应丢弃概率策略来提高算法的收敛速度；加入档案管理机制，提高解的均匀性。典型的多目标数值算例结果表明，改进的MOCS算法相较于当前主流的NSGA-Ⅱ算法拥有更快的收敛速度和更高的收敛精度。以RAE2822双目标升阻比优化设计为例，将改进的MOCS算法应用于多目标气动优化中，改进的MOCS算法共获得64个Pareto解，优化后的翼型气动性能有明显的提升，设计者可以根据自己的偏好选取不同的Pareto解。对于气动优化问题，改进的MOCS算法与目前主流的NSGA-Ⅱ相比，收敛速度更快。     

基于自适应模拟退火遗传算法的月球软着陆轨道优化

 将自适应遗传算法与模拟退火算法相结合，形成一种自适应模拟退火遗传算法。该算法不但具备了自适应遗传算法的强大全局搜索能力，也拥有模拟退火算法的强大局部搜索能力。针对月球软着陆轨道优化的特点，利用一种新的参数化方法将轨道优化问题转换为非线性规划问题，并应用提出的自适应模拟退火遗传算法进行优化。数值结果表明：该算法的收敛速度快，优化精度高，且避免了初值敏感、病态梯度和局部收敛等问题，能够搜索到全局最优轨道。     

A strategic flight conflict avoidance approach based on a memetic algorithm

Conflict avoidance （CA） plays a crucial role in guaranteeing the airspace safety. The cur- rent approaches, mostly focusing on a short-term situation which eliminates conflicts via local adjust- ment, cannot provide a global solution. Recently, long-term conflict avoidance approaches, which are proposed to provide solutions via strategically planning traffic flow from a global view, have attracted more attentions. With consideration of the situation in China, there are thousands of flights per day and the air route network is large and complex, which makes the long-term problem to be a large-scale combinatorial optimization problem with complex constraints. To minimize the risk of premature convergence being faced by current approaches and obtain higher quality solutions, in this work, we present an effective strategic framework based on a memetic algorithm （MA）, which can markedly improve search capability via a combination of population-based global search and local improve- ments made by individuals. In addition, a specially designed local search operator and an adaptive local search frequency strategy are proposed to improve the solution quality. Furthermore, a fast genetic algorithm （GA） is presented as the global optimization method. Empirical studies using real traffic data of the Chinese air route network and daily flight plans show that our approach outper- formed the existing approaches including the GA .based approach and the cooperative coevolution based approach as well as some well-known memetic algorithm based approaches.     

改进粒子群优化算法在亚轨道飞行器固液混合发动机设计中的应用

针对粒子群优化算法在求解多维复杂优化问题时容易陷入局部最优的缺点,提出了动态目标粒子群优化算法,通过分析寻优过程中粒子与个体最优位置和全局最优位置之间存在的位置关系,建立了新的速度更新公式.最后,应用该算法对某型号亚轨道飞行器固液混合发动机进行了优化设计.仿真结果表明,改进算法搜索能力强、收敛速度快,能有效解决此类问题,可为亚轨道飞行器的发动机优化设计提供理论参考.      

基于粒子群和人工蜂群混合算法的气动优化设计

现代启发式智能算法存在全局与局部搜索能力的平衡问题,针对此问题,采用双种群进化策略和信息交流机制,提出一种基于粒子群算法和人工蜂群算法相结合的新型混合优化算法——MABCPSO,并分别进行函数测试和翼型的气动优化设计验证。结果表明:MABCPSO新型混合优化算法具有更好的寻优能力,相比粒子群算法和人工蜂群算法,该算法能以更少的进化代数分别提高1.7%和2.2%的减阻效果。     

基于改进烟花算法的资源分配

资源分配问题作为一个NP-Hard问题,在云计算、无线电、卫星调度、多无人机协同作业等领域皆有研究需求,是一个共性的数学问题。烟花算法作为一种智能优化算法,具有求解大规模资源分配问题的能力,但也存在求解精度低等问题。为了提高传统烟花算法的计算效率和全局寻优能力,提出一种改进烟花算法,用遗传算法中的变异算子替代高斯变异操作,并增加模拟退火流程。最后在多无人机协同作业任务分配数学模型上进行仿真验证,实验结果表明在收敛速度以及计算精度方面,该算法均优于其余3种烟花算法。     

弹性高超声速滑翔飞行器的状态/参数联合估计

弹性高超声速滑翔飞行器具有强非线性、强不确定性和刚体/弹性耦合的特点，对其状态和参数进行估计十分必要。为解决这一问题，提出了一种传感器布置策略和一种利用正交三角（QR）分解更新到达代价的滚动时域估计算法（MHE-QR）。首先，建立了考虑弹性的传感器观测模型并分析了传感器位置对可观性的影响，并在此基础上提出了一种反映系统可观性的性能指标。传感器布置策略以此性能指标为目标函数，将传感器布置问题转化为约束非线性优化问题并求解，即可得到最优传感器布置方案。然后提出了MHE-QR算法。在滚动时域估计的框架下，该算法利用前向动态规划原理将到达代价的计算转化为最小二乘问题，并给出了基于QR分解的到达代价更新算法。仿真结果表明该传感器布置策略和MHE-QR算法能够有效提高估计精度、收敛速度和计算速度。此外，MHE-QR算法具有实时应用的潜力。     

一种飞行控制中控制分配的解决方案

针对现代飞控系统中的控制分配问题,提出了一种基于经典理论的最优化方法——有效集方法的控制分配方案,并建立了该方案的两种算法实现;简要描述了具有多个操纵面,考虑位置和速率约束的飞行控制中的控制分配问题,并将其转化为约束二次型规划问题进行研究;讨论了现有的几种控制分配解决方案;最后,以某型飞机为仿真模型,对新的和以前的几种控制分配方案的算法实现进行了对比仿真验证。仿真结果和数据统计表明,提出的这种基于有效集方法的控制分配解决方案对于实时飞行控制分配问题是切实可行且高效的。     

多操纵面优化控制分配新方法

针对直接分配算法不具备优化能力的问题,提出了一种基于可达集的多操纵面控制量优化分配的新方法.简要描述了飞行控制中多操纵面的受限控制分配问题,以实际和期望的伪指令偏差最小为优化目标,将二次规划问题转化成空间中多维向量的简单运算,避免了二次规划在整个可达集中进行的复杂搜索.以某型飞机为仿真模型,对新方法与直接分配算法进行了对比仿真验证.仿真结果表明,该方法能使舵面在期望指令所指向的可达边界子集中得到最优的分配,且计算量小,实时性较好.     

Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm

Based on the uncertainty theory, this paper is devoted to the redundancy allocation problem in repairable parallel-series systems with uncertain factors, where the failure rate, repair rate and other relative coefficients involved are considered as uncertain variables. The availability of the system and the corresponding designing cost are considered as two optimization objectives. A crisp multiobjective optimization formulation is presented on the basis of uncertainty theory to solve this resultant problem. For solving this problem efficiently, a new multiobjective artificial bee colony algorithm is proposed to search the Pareto efficient set, which introduces rank value and crowding distance in the greedy selection strategy, applies fast non-dominated sort procedure in the exploitation search and inserts tournament selection in the onlooker bee phase. It shows that the proposed algorithm outperforms NSGA-II greatly and can solve multiobjective redundancy allocation problem efficiently. Finally, a numerical example is provided to illustrate this approach.     

基于自适应粒子群算法的航天测控系统任务可靠性分配

采用测控时序图描述任务时序逻辑关系,建立了各阶段的任务可靠性模型,讨论了可靠性分配时的约束条件和分配目标,从而构建了航天测控系统任务可靠性分配模型.在此基础上,设计了自适应粒子群算法,算法在迭代过程中通过惯性权重系数ω进行自适应调整,初始时能快速搜索全局解,后期能有效地搜索局部解.通过算例仿真,表明自适应粒子群算法在用于航天测控系统任务可靠性分配问题时具有分配结果优、收敛速度快等优点.      

气动设计的多目标优化算法比较研究

由于目标函数复杂且流场求解耗时,气动优化设计需要选择搜索能力强且调用目标次数少的优化算法,现有的优化算法种类很多,针对不同类型问题算法性能不同。本文将常用的多目标优化算法进行了分类总结并进行函数测试,判断各个优化算法对不同问题的收敛性和稳定性,找出适合气动优化的多目标优化算法。将该算法应用于气动优化问题当中,进行了针对翼型的气动优化设计,缩短了优化时间,取得了一定的优化效果。     

考虑低空运行环境求解无人机任务分配问题的研究

在低空救援中如何合理的分配无人机的搜救任务长期以来都是研究的重点。本文在分层级分布式分配方法的基础上建立多目标多无人机任务分配模型,在模型中以搜救费用、无人机使用数量、完成任务的均衡性为目标函数,并且采用改进的NSGA-Ⅱ算法进行求解。结果表明：本文建立的模型有效,能在不同搜救环境下给出合理有效的分配方案;在搜救中考虑以搜救效率最高为导向时,带来无人机成本和数量的增加;当实际搜救的无人机非常有限时,则需要时间成本的投入;以经济利益为导向时,则会导致搜救时间的增加。     

Multi-UAV reconnaissance task allocation for heterogeneous targets using an opposition-based genetic algorithm with double-chromosome encoding

This paper presents a novel multiple Unmanned Aerial Vehicles (UAVs) reconnaissance task allocation model for heterogeneous targets and an effective genetic algorithm to optimize UAVs’ task sequence. Heterogeneous targets are classified into point targets, line targets and area targets according to features of target geometry and sensor’s field of view. Each UAV is regarded as a Dubins vehicle to consider the kinematic constraints. And the objective of task allocation is to minimize the task execution time and UAVs’ total consumptions. Then, multi-UAV reconnaissance task allocation is formulated as an extended Multiple Dubins Travelling Salesmen Problem (MDTSP), where visit paths to the heterogeneous targets must meet specific constraints due to the targets’ feature. As a complex combinatorial optimization problem, the dimensions of MDTSP are further increased due to the heterogeneity of targets. To efficiently solve this computationally expensive problem, the Opposition-based Genetic Algorithm using Double-chromosomes Encoding and Multiple Mutation Operators (OGA-DEMMO) is developed to improve the population variety for enhancing the global exploration capability. The simulation results demonstrate that OGA-DEMMO outperforms the ordinary genetic algorithm, ant colony optimization and random search in terms of optimality of the allocation results, especially for large scale reconnaissance task allocation problems.     

Implementation and convergence considerations of a linearlyconstrained adaptive array

O.L. Frost (1972) introduced a linearly constrained optimization algorithm that allows certain main beam properties to be preserved while good cancellation is attained. An open-loop implementation of this algorithm is developed. This implementation is shown to be equivalent to the technique developed by C.W. Jim (1977), L.J. Griffiths and C.W. Jin (1982), and K.M. Buckley and L.J. Griffiths (1982) whereby the constrained problem is reduced to an unconstrained problem. Analytical results are presented for the convergence rate when the sampled matrix inversion (SMI) or Gram-Schmidt (GS) algorithm are employed. It has been previously shown that the steady-state solution for the optimal weights is identical for both constrained and reduced unconstrained problems. It is shown that if the SMI or GS algorithm is employed, then the transient weighting vector solution for the constrained problem is identical to the equivalent transient weight vector solution for the reduced unconstrained implementation     

不确定环境下多无人机任务分配

针对复杂战场环境下无人机与攻击目标之间距离的不确定性,将该距离抽象为一个区间数。在此基础上,构建了不确定环境下多无人机任务分配的数学模型。根据多无人机任务分配问题的特殊性,重新设计了差分进化算法的编码方式、变异操作、交叉操作等。其中,选择操作中,在区间数排序方法的基础上,依照可能度来计算候选解被选中的概率。鉴于差分进化算法中不同变异策略的内在特点和适用场合不尽相同,提出了 3种多变异策略的差分进化算法,以便最大限度地发挥各种变异策略的技术优势。针对 CEC2013测试函数和多无人机任务分配问题分别开展仿真实验,实验结果表明,多变异策略的差分进化算法其性能改进显著,非常适合于求解多无人机任务分 配问题。     

基于自适应粒子群优化算法的无人机三维航迹规划

针对传统的粒子群优化算法容易陷入局部最优解的问题,提出了一种自适应粒子群优化算法,在迭代寻优过程中自适应地调节惯性权重和2个学习因子的数值。建立了无人机在山区环境执行勘察任务的航迹规划环境模型,分析了无人机自身约束条件。设计了自适应粒子群优化算法的适应度函数和航迹规划算法流程。分别采用自适应粒子群优化算法和传统粒子群优化算法开展了无人机三维航迹规划仿真实验。仿真结果对比表明,所提出的自适应粒子群优化算法比传统粒子群优化算法具有更高的全局搜索能力和搜索精度。     

用INSGA-Ⅱ进化NPCs的复杂行为

目前游戏中NPCs多目标行为进化是一个非常复杂的问题。对此建立了NPCs多目标优化的数学模型,并提出了一种NSGA-Ⅱ的改进算法——INSGA-Ⅱ。该算法在进行精英选择时,采用了基于K-均值聚类的方法联合了不同等级之间的个体进行集合划分,然后从不同的集合中选择下一代个体,从而更好地保持了种群的多样性。通过实例比较证明,在玩家和NPCs作战的游戏场景下,INSGA-Ⅱ能够得到NPCs复杂多目标控制问题的Pareto最优解,而且比NSGA-Ⅱ表现出更好的收敛性和多样性。