多目标优化设计方法在翼型气动优化中的应用研究

本文将粘性流场分析与数值优化方法结合起来,由粘性流场分析得到升力、阻力等气动参数作为样本训练神经网络,并用训练好的神经网络来预测优化目标函数,分别采用了多日标遗传算法与多目标粒子群算法,对一种跨音速翼型的气动性能进行了多目标优化设计,并采用模糊偏好信息的多属性决策方法对多个优化解进行评价选优.算例研究表明,两种多目标优化算法都能得到有限多个多目标优化解,通过多属性决策方法评价选优的优化翼型气动性能有明显提高.     

基于结构多样性评价的换热网络全局最优化

针对启发式方法在优化换热网络时由于个体团聚而出现搜索能力下降,建立一种换热网络结构多样性评价方法,对种群中个体结构团聚程度进行衡量,并指导算法改进.对种群进行集团划分,将一定数目的具有公共结构的个体归为一个集团,从而得到个体结构分布;提出分散搜索策略,对于各集团中除集团最优个体外的其它个体,从其公共结构中随机选择若干个换热器进行摄动以分散集团中的个体结构;提出集中搜索策略,通过使其它个体获得最优集团对应公共结构以加强对较优结构的集中开发;采用9股流与15股流两个算例,验证分散搜索策略增强了全局搜索能力,集中搜索策略增强了局部搜索能力,优化结果分别较原算法降低了7 008针对启发式方法在优化换热网络时由于个体团聚而出现搜索能力下降,建立一种换热网络结构多样性评价方法,对种群中个体结构团聚程度进行衡量,并指导算法改进.对种群进行集团划分,将一定数目的具有公共结构的个体归为一个集团,从而得到个体结构分布;提出分散搜索策略,对于各集团中除集团最优个体外的其它个体,从其公共结构中随机选择若干个换热器进行摄动以分散集团中的个体结构;提出集中搜索策略,通过使其它个体获得最优集团对应公共结构以加强对较优结构的集中开发;采用9股流与15股流两个算例,验证分散搜索策略增强了全局搜索能力,集中搜索策略增强了局部搜索能力,优化结果分别较原算法降低了7 008■·a~(-1)与17 973■·a~(-1)且均优于文献结果.     

基于蚁群优化与神经网络的坦克目标识别算法

为了对成像引信探测得到的变形严重的图像进行识别,提出了基于蚁群优化与人工神经网络相结合的坦克目标识别算法.采用SUSAN特征检测原则提取目标图像的角点特征,作为神经网络模式分类器的输入.针对BP网络收敛速度慢,易于陷入局部极小点等问题,利用蚁群优化算法训练网络权值,可兼有ANN的广泛映射能力和蚁群算法的全局收敛以及启发式学习等特点.仿真实验表明,新算法能够有效缩短网络训练时间,提高目标识别精度.     

基于BP算法和ACO算法的故障诊断推理研究

BP算法在故障诊断领域已取得广泛应用,但其存在收敛速度慢且容易陷入局部最小值的缺陷,限制了其进一步的发展;ACO(Ant colony optimization)算法是一种模拟进化算法,已很好地应用于解决旅行商和资源两次分配等经典的优化问题,具有启发式收敛、正反馈以及分布式计算等优点;为此,将ACO算法引入BP算法故障诊断方法中,使用ACO算法对BP网络中的参数即权值、阈值以及学习率等进行优化,定义了一种结合ACO算法和BP算法能对故障进行诊断的新算法,并将其应用于具体的故障诊断实例中,最后,通过100组样本中的95组进行训练,并对剩余5组进行故障诊断,实验证明结合ACO算法和BP算法的新算法较传统的仅使用BP算法的诊断方法具有收敛速度快、诊断精确高以及训练性能好的优点。     

基于尺度不变特征变换和区域互信息优化的多源遥感图像配准

为了进一步提高遥感图像配准精度, 提出了尺度不变特征变换(SIFT)结合区域互信息优化的遥感图像配准方法. 首先利用混沌序列的随机性和遍历性, 提出一种混沌量子粒子群优化(CQPSO)算法, 在量子粒子群优化(QPSO)算法迭代陷入早熟收敛时, 采用一种新的机理引入混沌序列, 进化粒子克服早熟. 图像配准算法分为预配准和精配准两个过程. 基于SIFT算法提取特征点, 经匹配和有效地外点排除完成预配准, 然后对匹配特征点坐标进行亚像素级微调, 通过最小二乘法求得一系列匹配参数构造初始粒子群, 最后利用混沌量子粒子群优化区域互信息完成精配准, 得到最优匹配参数. 用一些标准测试函数对所提出的CQPSO和QPSO及粒子群优化(PSO)算法进行了实验比较, 另外, 对SIFT, SIFT结合PSO算法优化区域互信息, SIFT结合QPSO算法优化区域互信息和SIFT结合CQPSO算法优化区域互信息(SRC)等四种算法进行了不同分辨率遥感图像配准实验比较和不同时相遥感图像配准实验比较, 实验结果验证了所提出的CQPSO算法的优越性和SRC配准方法的有效性.     

小阻尼封闭空间声压级灵敏度分析与优化设计

本文研究了小阻尼界面封闭空间低频声学有限元分析、灵敏度分析和优化设计问题。分别用模态法和直接法计算了封闭空间内声压级响应，并推导了声压级响应对声空间边界形状控制参数的灵敏度分析公式，在此基础上建立了小阻尼空间声学问题的优化模型，同时给出了优化求解算法，并在JIFEX软件中进行了程序实现。本文提出的灵敏度分析和优化设计方法可以使声场的边界布局更为合理，从而达到改进小阻尼界面封闭空间声学性能的目的。数值算例验证了本文提出的灵敏度分析和优化算法的有效性。     

ARDE算法及其在三维叶栅气动优化设计中的应用

本文提出了一种自适应差分进化算法(ARDE)。通过函数试验,分析比较了该算法、标准遗传算法及差分进化算法的优化性能,证明该算法具有良好的收敛速度和全局寻优能力,满足气动优化设计的要求。耦合该算法与曲面造型方法以及CFD求解技术,本文发展了一种适用于叶轮机械三维气动优化设计的全局自动气动优化算法。利用该算法对小展弦比后加载静叶栅和干式TRT动叶栅进行了气动优化设计,结果表明本文提出的自动气动优化算法具有良好的优化性能和应用前景。     

基于遗传算法的不等间距阵优化方法

阵元数一定情况下,针对不等间距拖线阵高频信号处理存在的空间增益和无栅瓣兼容问题,提出一种基于遗传算法的不等间距拖线阵阵型优化方法。该方法以频带交互下最大旁瓣级最小作为约束因子,通过模拟生物自然进化过程搜索全局最优解,得到优化后的阵元位置。优化后阵型在保证低频信号处理空间增益不变情况下,实现对高频信号高空间增益、无栅瓣处理。计算机仿真结果表明：相比未优化阵型,在高频信号处理方面,优化后阵型在无栅瓣情况下,空间增益提升值近似理论值提升值;在低频信号处理方面,优化后阵型具有相同的空间增益。为实际不等间距拖线阵阵型优化和应用提供了一种思路。     

一种适用于复杂换热网络优化的耦合联动进化策略

针对启发式算法在优化换热网络后期由于种群多样性消失等原因造成难以找到使年综合费用进一步下降的进化方向，本文提出换热器耦合联动进化策略.该策略在一般启发式算法优化后期通过按一定概率分布抽取部分换热量不为零的换热器参与联动进化，以找到使费用下降的耦合匹配.算例验证表明，该策略效果明显.将该策略与RWCE算法相结合组成一种混合算法.首先采用RWCE算法对求解域进行初步探索，利用该算法强大的全局搜索能力找到求解域内各个潜力结构.然后再用耦合联动进化策略对各潜力结构进行深入搜索，搜索完成后再经变异反馈给RWCE算法.将该混合算法应用于10SP2和15SP算例，得到了较好的优化结果.     

基于优化核极限学习机的风电功率时间序列预测

针对时间序列预测,在单隐层前馈神经网络的基础上,基于进化计算的优化策略,提出了一种优化的核极限学习机(optimized kernel extreme learning machine,O-KELM)方法.与极限学习机(extreme learning machine,ELM)方法相比,核极限学习机(kernel extreme learning machine,KELM)方法无须设定网络隐含层节点的数目,以核函数表示未知的隐含层非线性特征映射,通过正则化最小二乘算法计算网络的输出权值,它能以极快的学习速度获得良好的推广性.在KELM的基础上,分别将遗传算法、模拟退火、微分演化三种进化算法用于模型的结构输入选择、正则化系数以及核参数的优化选取,以进一步提高网络的性能.将O-KELM方法应用于标准Mackey-Glass混沌时间序列预测及某地区的风电功率时间序列预测实例中,在同等条件下,还与优化的极限学习机(optimized extreme learning machine,O-ELM)方法进行比较.实验结果表明,所提出的O-KELM方法在预测精度上优于O-ELM方法,表明了其有效性.     

A New Two-Stage Algorithm for Solving Optimization Problems

Optimization seeks to find inputs for an objective function that result in a maximum or minimum. Optimization methods are divided into exact and approximate (algorithms). Several optimization algorithms imitate natural phenomena, laws of physics, and behavior of living organisms. Optimization based on algorithms is the challenge that underlies machine learning, from logistic regression to training neural networks for artificial intelligence. In this paper, a new algorithm called two-stage optimization (TSO) is proposed. The TSO algorithm updates population members in two steps at each iteration. For this purpose, a group of good population members is selected and then two members of this group are randomly used to update the position of each of them. This update is based on the first selected good member at the first stage, and on the second selected good member at the second stage. We describe the stages of the TSO algorithm and model them mathematically. Performance of the TSO algorithm is evaluated for twenty-three standard objective functions. In order to compare the optimization results of the TSO algorithm, eight other competing algorithms are considered, including genetic, gravitational search, grey wolf, marine predators, particle swarm, teaching-learning-based, tunicate swarm, and whale approaches. The numerical results show that the new algorithm is superior and more competitive in solving optimization problems when compared with other algorithms.     

基于多算法优化SVM的粗糙面参数反演

支持向量机（SVM）是粗糙面参数反演中常用的一种反演算法,SVM反演中的惩罚参数C和核函数参数G对反演结果精度的影响较大,若参数取值不当,会使模型产生"过学习"或者"欠学习"的现象,从而降低预测精度.给出几种SVM参数C和参数G的优化算法,如K折交叉验证（K-CV）、遗传算法（GA）和粒子群算法（PSO）,并在此基础上提出一种基于K-CV和GA改进的PSO算法（GA-CV-PSO）.利用矩量法（MoM）获得的粗糙面后向散射系数构造训练集和测试集,通过不同参数反演的仿真结果对比不同优化算法的反演精度和计算时间,表明GA-CV-PSO算法克服了单一优化算法的缺陷,具有更精确的反演精度和更强的泛化能力.     

Variational piecewise constant level set methods for shape optimization of a two-density drum

We apply the piecewise constant level set method to a class of eigenvalue related two-phase shape optimization problems. Based on the augmented Lagrangian method and the Lagrange multiplier approach, we propose three effective variational methods for the constrained optimization problem. The corresponding gradient-type algorithms are detailed. The first Uzawa-type algorithm having applied to shape optimization in the literature is proven to be effective for our model, but it lacks stability and accuracy in satisfying the geometry constraint during the iteration. The two other novel algorithms we propose can overcome this limitation and satisfy the geometry constraint very accurately at each iteration. Moreover, they are both highly initial independent and more robust than the first algorithm. Without penalty parameters, the last projection Lagrangian algorithm has less severe restriction on the time step than the first two algorithms. Numerical results for various instances are presented and compared with those obtained by level set methods. The comparisons show effectiveness, efficiency and robustness of our methods. We expect our promising algorithms to be applied to other shape optimization and multiphase problems.     

Application of the edge of chaos in combinatorial optimization

Many problems in science, engineering and real life are related to the combinatorial optimization. However, many combinatorial optimization problems belong to a class of the NP-hard problems, and their globally optimal solutions are usually difficult to solve. Therefore, great attention has been attracted to the algorithms of searching the globally optimal solution or near-optimal solution for the combinatorial optimization problems. As a typical combinatorial optimization problem, the traveling salesman problem(TSP) often serves as a touchstone for novel approaches. It has been found that natural systems, particularly brain nervous systems, work at the critical region between order and disorder, namely,on the edge of chaos. In this work, an algorithm for the combinatorial optimization problems is proposed based on the neural networks on the edge of chaos(ECNN). The algorithm is then applied to TSPs of 10 cities, 21 cities, 48 cities and 70 cities. The results show that ECNN algorithm has strong ability to drive the networks away from local minimums.Compared with the transiently chaotic neural network(TCNN), the stochastic chaotic neural network(SCNN) algorithms and other optimization algorithms, much higher rates of globally optimal solutions and near-optimal solutions are obtained with ECNN algorithm. To conclude, our algorithm provides an effective way for solving the combinatorial optimization problems.     

A Hybrid Rao-NM Algorithm for Image Template Matching

This paper proposes a hybrid Rao-Nelder–Mead (Rao-NM) algorithm for image template matching is proposed. The developed algorithm incorporates the Rao-1 algorithm and NM algorithm serially. Thus, the powerful global search capability of the Rao-1 algorithm and local search capability of NM algorithm is fully exploited. It can quickly and accurately search for the high-quality optimal solution on the basis of ensuring global convergence. The computing time is highly reduced, while the matching accuracy is significantly improved. Four commonly applied optimization problems and three image datasets are employed to assess the performance of the proposed method. Meanwhile, three commonly used algorithms, including generic Rao-1 algorithm, particle swarm optimization (PSO), genetic algorithm (GA), are considered as benchmarking algorithms. The experiment results demonstrate that the proposed method is effective and efficient in solving image matching problems.     

量子势阱粒子群优化算法的改进研究

为提高量子势阱粒子群优化算法的优化能力, 通过分析目前量子势阱粒子群优化算法的设计过程, 提出了改进的量子势阱粒子群优化算法. 首先, 分别基于Delta势阱、谐振子和方势阱 提出了改进的量子势阱粒子群优化算法, 并提出了基于统计量均值的控制参数设计方法. 然后, 在势阱中心的设计方面, 为强调全局最优粒子的指导作用, 提出了基于自身最优粒子加权平均和动态随机变量的两种设计策略. 实验结果表明, 三种势阱粒子群优化算法性能比较接近, 都优于原算法, 且Delta势阱模型略优于其他两种.     

基于粒子群优化算法的自适应图像分割方法

提出了一种基于粒子群优化算法的图像分割新方法。粒子群优化(PSO)算法是一类随机全局优化技术,它通过粒子间的相互作用发现复杂搜索空间中的最优区域缩短了寻找阈值的时间。将PSO用于基于改进的最佳加权熵阈值法的图像分割中,试验结果表明,该方法不仅能够避免陷入局部极值,而且其速度得到了明显的改善,是一种有效的图像分割新方法。     

微动粒子群优化算法用于Egun的多参量优化

 针对2维电子光学多参量优化问题,采用微动粒子群优化算法,在给出目标电子轨迹和优化范围的前提下,可以得到趋近于该电子轨迹的真空边界和聚束磁结构。该算法分为前后两阶段：第一阶段采用前后试探法(微动),同时参照最优粒子的信息;第二阶段采用标准粒子群优化算法。针对涉及多个相关参量的电子光学设计问题,标准粒子群优化算法仅能保证以较高概率收敛到局部最佳解,而微动粒子群优化算法能以较高概率收敛到全局最佳解,并且展现了多核计算机在电子光学设计上的潜力。初步的软件试验显示：消耗人类工程师几周时间的电子光学设计问题,用微动粒子群算法在普通个人计算机上几十小时就能完成。     

Truss optimization on shape and sizing with frequency constraints based on orthogonal multi-gravitational search algorithm

Structural optimization on shape and sizing with frequency constraints is well-known as a highly nonlinear dynamic optimization problem with several local optimum solutions. Hence, efficient optimization algorithms should be utilized to solve this problem. In this study, orthogonal multi-gravitational search algorithm (OMGSA) as a meta-heuristic algorithm is introduced to solve truss optimization on shape and sizing with frequency constraints. The OMGSA is a hybrid approach based on a combination of multi-gravitational search algorithm (multi-GSA) and an orthogonal crossover (OC). In multi-GSA, the population is split into several sub-populations. Then, each sub-population is independently evaluated by an improved gravitational search algorithm (IGSA). Furthermore, the OC is used in the proposed OMGSA in order to find and exploit the global solution in the search space. The capability of OMGSA is demonstrated through six benchmark examples. Numerical results show that the proposed OMGSA outperform the other optimization techniques.