非线性函数的混沌优化方法比较研究

已有的混沌优化方法几乎都是利用Logistic映射作为混沌序列发生器，而Logistic映射产生的混沌序列的概率密度函数服从两头多、中间少的切比雪夫型分布，不利于搜索的效率和能力。为此，首先根据Logistie映射混沌轨道点密度函数的特点，建立改进的混沌-BFGS混合优化算法。之后，考虑到Kent映射混沌轨道点密度为均匀分布，建立了基于Kent映射的混沌-BFGS混合优化算法。然后对五种混合优化方法——不加改进的和改进的基于Logistic映射的混沌-BFGS法，基于Kent映射的混沌-BFGS法，Monte Carlo试验-BFGS法，网格-BFGS法进行了研究，分别对3个低维和2个高维非线性复杂测试函数进行优化计算，对它们的全局优化计算效率和寻优能力做了比较，并探讨了混合优化方法全局优化性能差异的原因。结果表明，混沌优化方法是与Monte Carlo方法类似的一种随机性试验优化方法。而且，这类优化方法的计算性能至少与以下因素有关：混沌／随机序列的统计性质，优化问题全局最优点位置。     

面向工程全局优化的混沌优化算法研究进展Research advances of chaos optimization algorithms for engineering global optimization

近年来,基于混沌的初值敏感性、伪随机性、遍历性以及自相似分形等非线性动力学特性所发展的混沌优化方法,是一种有潜力的工程全局优化新工具,已广泛应用于科学与工程技术的各学科领域。根据混沌优化方法的发展历程,以算法基本思想和工程应用研究状况为重点,评述了混沌神经网络优化方法、第一类混合混沌优化算法（基于混沌搜索）、第二类混合混沌优化算法（混沌序列代替随机序列）以及混沌分形优化四种主要混沌优化算法。混沌映射最早被引入神经网络,发展了混沌神经网络优化方法,可解决复杂的组合优化等全局优化问题。遗传算法及粒子群等启发式随机算法虽具全局搜索能力,但易出现早熟并陷入局部最优。然后,出现了混沌搜索的概念,研究者将其嵌入启发式算法建立了第一类混合混沌优化算法,可有效克服原启发式算法早熟收敛的缺点。随后,利用混沌映射产生的混沌序列代替启发式算法中的随机参数形成了第二类混合混沌优化算法。混合混沌优化算法有益于实现快速全局收敛和提高计算精度。最后,利用混沌分形特性,从分形理论出发提出一类新颖的混沌分形优化算法,可搜索到优化问题的所有全局最优解。此外,对混沌优化算法研究的几个发展方向进行了展望,诸如加强混沌优化算法的参数设计、处理大规模优化、多目标优化问题以及使用代理模型等。     

Kinship-based differential evolution algorithm for unconstrained numerical optimization

Nonlinear Dynamics - We propose a modification of the standard differential evolution (DE) algorithm in order to significantly make easier and more efficient standard DE implementations. Taking...     

基于差分进化和RBF响应面的混合优化算法

针对气动优化等昂贵优化问题,提出了一种基于差分进化和RBF响应面的混合优化算法HSADE,该方法结合了差分进化算法的强全局寻优能力和RBF响应面方法的快速局部搜索能力,能够同时有效地提高算法的局部搜索效率和全局寻优能力.对各子算法中的策略和逻辑进行了多项改进,提出和应用了基于双败淘汰赛的竞赛赛制和参数自适应等改进策略.对HSADE使用多个典型算例进行了测试,并横向对比了NSGA-II,MOPSO和多目标差分进化算法.测试结果表明,在大多数问题中HSADE在以世代距离表征的局部搜索效率和以超体积比表征的全局寻优能力两项指标上都优于其他算法,证实了以上混合策略及算法改进的有效性.将该算法应用于一个翼型优化问题和一个二维超声速喷管膨胀面优化问题,并横向对比未经改良的差分进化算法DE和另一种混合算法NARSGA,结果表明在接近1 000次的函数评估下,HSADE能相对其他算法进一步对翼型减阻0.5 count,在喷管优化中HSADE得到的结果也好于其他两种算法,表明该方法具有较强工程应用价值.     

Stability properties of a two-dimensional system involving one Caputo derivative and applications to the investigation of a fractional-order Morris–Lecar neuronal model

Adaptive infinite impulse response filters have received much attention due to its utilization in a wide range of real-world applications. The design of the IIR filters poses a typically nonlinear, non-differentiable and multimodal problem in the estimation of the coefficient parameters. The aim of the current study is the application of a novel hybrid optimization technique based on the combination of cellular particle swarm optimization and differential evolution called CPSO–DE for the optimal parameter estimation of IIR filters. DE is used as the evolution rule of the cellular part in CPSO to improve the performance of the original CPSO. Benchmark IIR systems commonly used in the specialized literature have been selected for tuning the parameters and demonstrating the effectiveness of the CPSO–DE method. The proposed CPSO–DE method is experimentally compared with two new design methods: the tissue-like membrane system (TMS), the hybrid particle swarm optimization and gravitational search algorithm (HPSO–GSA), the original CPSO-outer and CPSO-inner, and classical implementations of PSO, GSA and DE. Computational results and comparison of CPSO–DE with the other evolutionary and hybrid methods show satisfactory results. The hybridization of CPSO and DE demonstrates powerful estimation ability. In particular, to our knowledge, this hybridization has not yet been investigated for the IIR system identification.     

基于生物地理-海鸥群优化的高维结构可靠性分析

结构可靠度分析中,一阶可靠度方法由于简单高效而得到广泛使用.然而,对于高维非线性问题,一阶可靠度方法可能导致不收敛或者早熟.为克服这一缺陷,本文提出了基于生物地理-海鸥群优化的改进一阶可靠度方法.针对海鸥群优化算法在寻优过程中存在的早熟现象,引入生物地理优化算法中的变异与迁移机制,提出生物地理-海鸥群混合优化策略进行寻...     

最优化问题全局寻优的混合遗传算法

把BFGS方法作为一个与选择、交叉和变异平行的算子,嵌入到浮点编码遗传算法中,得到一种基于BFGS方法和浮点编码遗传算法的混合计算智能算法．该方法兼顾了遗传算法和BFGS方法两者的长处,既有较快的收敛速度,又能以非常大的概率求得最优化问题全局解．数值结果表明,混合方法是求解优化问题的一种有潜力的智能算法．     

A HYBRID GRANULARITY PARALLEL ALGORITHM FOR PRECISE INTEGRATION OF STRUCTURAL DYNAMIC RESPONSES

Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integration term. The second term can be solved by the series solution. Two hybrid granularity parallel algorithms are designed, that is, the exponential matrix and the first term are computed by the fine-grained parallel algorithra and the second term is computed by the coarse-grained parallel algorithm. Numerical examples show that these two hybrid granularity parallel algorithms obtain higher speedup and parallel efficiency than two existing parallel algorithms.     

基于改进粒子群算法的翼型多目标优化研究

在多目标优化研究中,为改善多目标粒子群算法的局部搜索能力,以标准粒子群算法为基础,引入单点模拟退火算法,局部进化最优个体,采用基于目标向量的共享函数法评价适应值.标准测试函数优化实例表明:本文算法比标准粒子群算法具有更好的收敛稳定性和收敛速度,收敛速度提高了近50%;针对某翼型的气动优化设计结果表明:改进算法有效缩短了优化时间,迭代代数由61减为49,调用CFD由4880减为4250次;阻力系数、升力系数、低头力矩系数分别改进了9.23%、0.42%、16.4%,取得了较好的优化效果.     

钢-复合材料组合结构材料选型优化设计映射解法

建立了基于拓扑分布的钢-复合材料组合结构材料选型优化的数学模型,通过变量连续化,用映射函数对材料选型优化模型进行函数变换,使其能适应更多的优化算法进行求解.分别采用线性函数、指数函数、对数函数、阶跃函数、反三角函数和分段函数等对原始模型进行了变换,得到相应材料选型优化模型并求解.以组合浮筏材料选择动力学优化为例,对比研...     

Simulation of angular velocity sensor measurements using telemetry data on the motion of an object

An algorithm for the formation of smooth trajectories corresponding to telemetry data on the coordinates and orientation angles of a flying object with a strapdown inertial navigation system is proposed. Another algorithm of forming the angular velocity sensor measurements corresponding to this trajectory is developed. These algorithms allow one to analyze the accuracy of various numerical methods of determining the orientation of such system using the information on motions close to the real motions with known telemetry data.     

A novel chaotic Jaya algorithm for unconstrained numerical optimization

Nonlinear Dynamics - Jaya algorithm is one of the recent algorithms developed to solve optimization problems. The basic concept of this algorithm consists in moving the obtained solution, for a...     

基于遗传退火算法的鱼雷外形优化设计

将基于实数编码的基本遗传算法与模拟退火算法相结合,建立了数值优化设计中的混合遗传算法。该算法既通过传统遗传算法的“优胜劣汰”操作保留了群体操作中的最优个体,又利用了退火算法的概率突跳性有效避免了问题求解陷入局部最小。本文还把混合遗传算法运用于鱼雷外形优化设计中,优化设计后的鱼雷流体阻力明显减小,压力分布曲线平缓,鱼雷的流体动力性能得到显著改善,表明改进的遗传退火算法运用于鱼雷外形优化设计是很有效的。在优化设计过程中,鱼雷线型由分段解析函数叠加表示,目标函数由二维欧拉方程的流场解提供。     

Erratum to: Parameter identification of electronic throttle using a hybrid optimization algorithm

Aiming at the problems in parameter identification of an electronic throttle, this paper proposes a novel hybrid optimization algorithm to search the optimal parameter values of the plant. The parameter identification of an electronic throttle is considered as an optimization process with an objective function minimizing the errors between the measurement and identification, and the optimal parameter values of the plant are searched by using a hybrid optimization algorithm. The proposed hybrid optimization algorithm, effective combination of parallel chaos optimization algorithm (PCOA) and simplex search method, preserves both the global optimization capability of PCOA and the accurate search ability of simplex search method. Simulation and experiment results have shown the good performance of the proposed approach.     

飞艇最优飞行轨迹研究

目前，各国对无人飞艇平台的研究产生了很大的兴趣，飞艇作为平台可以实现无线通信、环境监测和监视等目的。本文通过采用最优控制问题的数值计算方法得到飞艇在不同性能指标下的最优飞行轨迹。飞艇的动力学模型采用六自由度非线性模型。飞艇采用安装在飞艇轴向由直流电机带动的螺旋桨作为动力。通过螺旋桨、方向舵和升降舵对飞艇进行控制。控制消耗的能量作为控制变量的函数。采用直接配点法与由遗传算法和单纯形法构成的混合参数优化方法得到飞艇在不同条件下的最优轨迹。     

CABC–CSA: a new chaotic hybrid algorithm for solving optimization problems

Recently a lot of methods have been presented for solving optimization problems. In this paper, we are trying to propose a new hybrid algorithm for solving these kinds of problem. The proposed algorithm is based on chaotic artificial bee colony and chaotic simulated annealing, CABC–CSA. The chaotic artificial bee colony finds new locations chaotically. Actually, the proposed algorithm provides a combination of local search accuracy of simulated annealing and the ability of global search of artificial bee colony. Furthermore, we used a different method for generating the initial population. The proposed algorithm is validated using 12 benchmark functions. The results are compared with those of the artificial bees’ algorithm, the hybrid algorithm of artificial bee colony and simulated annealing and particle swarm optimization. Simulation results show the efficiency of the proposed algorithm.     

Multi-objective optimization of a dimpled channel for heat transfer augmentation

Staggered arrays of dimples printed on opposite surfaces of a cooling channel is formulated numerically and optimized with hybrid multi-objective evolutionary algorithm and Pareto optimal front. As Pareto optimal front produces a set of optimal solutions, the trends of objective functions with design variables are predicted by hybrid multi-objective evolutionary algorithm. The problem is defined by three non-dimensional geometric design variables composed of dimpled channel height, dimple print diameter, dimple spacing, and dimple depth, to maximize heat transfer rate compromising with pressure drop. Twenty designs generated by Latin hypercube sampling were evaluated by Reynolds-averaged Navier–Stokes solver and the evaluated objectives were used to construct Pareto optimal front through hybrid multi-objective evolutionary algorithm. The optimum designs were grouped by k-means clustering technique and some of the clustered points were evaluated by flow analysis. With increase in dimple depth, heat transfer rate increases and at the same time pressure drop also increases, while opposite behavior is obtained for the dimple spacing. The heat transfer performance is related to the vertical motion of the flow and the reattachment length in the dimple.     

A new design method for adaptive IIR system identification using hybrid particle swarm optimization and gravitational search algorithm

Design of adaptive infinite impulse response (IIR) filter is the process of utilizing adaptive algorithm to iteratively determine the filter parameters to obtain an optimal model for the unknown plant based on minimizing the error cost function. However, the error cost surface of IIR filter is generally nonlinear, non-differentiable and multimodal. Hence, an efficient global optimization technique is required to minimize the error cost objective. A novel hybrid particle swarm optimization and gravitational search algorithm (HPSO–GSA) is proposed in this paper for IIR filter design. The proposed HPSO–GSA updates particle positions through obeying the influence of gravity acceleration in GSA and receiving direction of cognitive memory and social sharing information from PSO by means of coevolutionary strategy. The effect of key parameters on the performance of the proposed algorithm is firstly studied, and the proper parameters in HPSO–GSA are established using five benchmark plants along with the same-order model. The simulation studies have been performed for the performance comparison of eight algorithms such as PSO, GSA, QPSO, DPSO, FO-DPSO, GAPSO, PSOGSA and the proposed HPSO–GSA for unknown IIR system identification with the same-order and reduced-order filters. Simulation results show that the proposed algorithm has advantages over PSO, GSA and other PSO-based variants in terms of the convergence speed and the MSE levels.     

Automated critical point identification for PIV data using multimodal particle swarm optimization

A hybrid sequential niche algorithm is used for the automated identification of critical points of velocity fields. This method combines an adaptive sequential niche technique with deterministic local optimization to detect critical points: focus, node and saddle points. A particle swarm algorithm performs a global search whereas vortex core identification functions compute the precise location as the extremum of the corresponding function. Once a critical point is found, a rectangular niche is constructed around the point. The particle swarm then proceeds to explore different regions of the velocity field. The process advances sequentially, avoiding areas near previously found critical points by blocking niches obtained from previous steps. The niche size is automatically adjusted each time a search enters inside an existing niche. Vortex core functions are used for critical point identification and calculating its precise location inside each niche. The procedure is validated on particle image velocimetry data obtained with two types of flows, an impinging jet flow and a flow downstream of a model building. The hybrid algorithm proved to be very efficient and robust for automated detection and identification of critical points. It can be used as a first step for studying the time‐dependent dynamic behavior of instantaneous velocity fields by tracking topological critical points. This is the first study that uses a multi‐modal particle swarm algorithm for critical point identification. Copyright © 2011 John Wiley & Sons, Ltd.