基于改进粒子群优化算法的混沌系统参数估计方法

估计混沌系统的未知参数是混沌控制与同步中必须解决的关键问题.利用群集智能的新进展粒子群优化算法(PSO)的全局搜索能力，从初始粒子群的产生、目标函数的处理的角度改进PSO，将改进的PSO引入混沌系统参数估计和在线估计.仿真试验表明，改进算法具有良好的适应性、较高的收敛可靠性及精度，对信号叠加噪声的情形也具有较高的鲁棒性，是混沌系统参数估计的一种成功算法. 关键词： 混沌系统 参数估计 在线估计 粒子群优化算法     

应用于亚波长角向偏振金属光栅设计的快速收敛粒子群算法优化

提出了分步寻优的基于粒子位置调整惯性权重的粒子群算法(PDW-PSO),通过调用严格耦合波方法(RCWA)计算衍射效率,进行了光栅结构参数的优化。将PDW-PSO与惯性权重不变的粒子群算法(PSO)和基于迭代次数调整惯性权重的粒子群算法(IDW-PSO)进行对比,结果表明PDW-PSO具有更快的收敛速度,相比于PSO和IDW-PSO,PDW-PSO的平均迭代次数分别从89.83和74减少至21.2,调用RCWA的次数分别从3144.05和2590下降至224。分析了波段匹配数对算法的影响, PSO和IDW-PSO的RCWA调用次数与波段匹配数呈等倍率增加,而PDW-PSO的RCWA调用次数的增加倍率小于波段匹配数的增加倍率。进行了算法准确度实验,在30次运行中,PDW-PSO与PSO、IDW-PSO正确收敛到最优值的次数相近,误差值不超过6.6%;随着粒子数的增加,三种方法的准确度都有所提高,粒子数达到27后基本都可以保证收敛到最优。     

Logistic型混合自适应分数阶达尔文粒子群优化算法

针对分数阶达尔文微粒群优化(FDPSO)算法收敛速度慢,收敛精度不高的问题,改进其算法中分数阶速度更新策略,同时引入Logistic型混合分数阶自适应动态调整策略,得到一种改进的自适应分数阶达尔文粒子群优化(LFDPSO)算法,通过理论分析,证明了该算法在给定条件下的收敛性,并由数值实验表明,Logistic型混合自适应分数阶达尔文粒子群(LFDPSO)算法在收敛精度和收敛速度上得到了有效改善与提高,粒子在局部最优时的逃逸能力、全局寻优及智能搜索能力显著增强。     

基于细菌觅食特征改进粒子群算法优化SVM模型参数研究

针对粒子群算法优化SVM模型参数在进化后期容易陷入局部最优的问题,研究了细菌觅食趋利避害机制,提出了一种基于细菌觅食特性改进粒子群算法的方法,并将改进方法应用于优化SVM预测模型参数的研究;实验结果表明,该方法能够弥补粒子群算法在进化后期容易陷入局部最优的缺陷,具备更好的寻优性能。     

鲸群优化的粒子滤波算法研究

针对标准的粒子滤波存在粒子贫化问题,提出了一种鲸群优化的粒子滤波算法。用粒子表征鲸鱼个体, 模拟鲸鱼群体搜寻猎物的过程,引导粒子向高似然区域移动。将粒子滤波中粒子的状态值作为鲸鱼群的个体位置,将粒子的状态估计转化为对鲸鱼群的寻优;通过鲸群的螺旋运动方式优化粒子的重要性采样过程,使粒子分布更加合理,对鲸群算法中的全局最优值引入最优邻域随机扰动策略,并在鲸鱼位置更新过程中加入自适应权重因子;选用一种典型的单静态非增长模型进行仿真测试。测试结果表明:提出的方法与传统的粒子滤波以及引力场优化的粒子滤波相比,在保证相同粒子数的前提下,算法的均方误差分别降低了28%和9%,证明了鲸群优化的粒子滤波算法具有更高的估计精度,并且在粒子数较少的情况下,可实现更准确的状态估计。     

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

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

基于粒子群算法改进SVM的滑模控制研究

为了提高离散时间系统的控制品质以及削弱系统抖振,提出了基于粒子群算法(particle swarm optimization,PSO)改进支持向量机(support vector machine,SVM)的滑模控制方法并进行了仿真研究;通过SVM识辨参量模型与PSO寻优处理,获得趋于理想滑模运动的趋近律参数,确保寻优处理时间短、精度高;利用PSO和SVM在线调整滑模趋近律参数,可以克服常规滑模控制中需要事先设定趋近律参数限制的弊端,加快跟踪速度,削弱系统抖振,完善控制质量;仿真实验表明,该方法可以克服因 PSO寻优过程中的寻优时间过长等不足,又可解决SVM精度不高或计算量大的缺点;该方法用于离散时间系统是可行、有效的,工程实用性强。      

群智能算法优化SVR预测模型的应用与分析

群体智能是基于生物群体行为规律的智能计算技术,常用以解决参数寻优等问题;作为群体智能的两种典型算法,蚁群算法和粒子群算法应用极为广泛;文章分析了标准蚁群算法和粒子群算法的不足,分别采用改进的蚁群算法和粒子群算法对支持向量机回归模型参数进行优化,并以钕铁硼吸氢阶段合金氢含量预测为例,通过MATLAB对改进后的预测模型进行了仿真验证,最终给出了两种方法优化后,模型的预测效果及性能对比;仿真结果表明,改进的群体智能算法对工艺优化控制有着重要的意义。     

基于混合群智能优化算法的混沌系统参数估计

混沌系统的未知系统参数估计是实现混沌控制和同步的首要问题,通过构造一个合理的适应度函数,可将其转化为一个多维搜索空间的优化问题.提出一种融合改进骨干粒子群算法与改进差分进化算法的混合群智能优化方法来解决上述优化问题.对骨干粒子群算法中的粒子位置更新机制以及差分进化算法中的变异操作、交叉操作、交叉概率因子的设计等进行改进,有效兼顾了种群的多样性与算法的收敛性.在此基础上,讨论骨干粒子群优化算法与差分进化的融合优化策略,实现两个算法的协同进化,进一步提高算法的综合优化性能.用6个基准测试函数以及Lorenz混沌系统为例进行仿真实验,结果表明该方法具有全局寻优能力强、收敛速度快、搜索精度高、稳健性好等优点.     

改进粒子群算法的立体传声器阵列声成像系统阵形优化设计

提出改进的粒子群优化算法,获得波束方向图主瓣宽度和旁瓣级折中的优化立体阵形,避免基本实数粒子群算法仅采用旁瓣级或主瓣宽度一个性能指标优化而导致另一个性能指标恶化的问题,利用阵列视角限制进一步优化立体阵形并设计了声成像测量系统。改进的粒子群算法与基本粒子群算法仿真优化阵形比较表明改进粒子群算法设计的优化阵形在保持较窄的主瓣宽度的条件下具有较低的旁瓣级。阵列声成像测量系统的性能测量分析结果表明该系统的空间分辨率和旁瓣抑制能力与理论结果接近,验证了所提算法的有效性。      

A hybrid membrane evolutionary algorithm for solving constrained optimization problems

Solving constrained optimization problems (COPs) is a central research topic in the field of optimization. Given the complexity of COPs, it is difficult to solve them with traditional optimization techniques. In this paper, a hybrid membrane evolutionary algorithm (HMEA) is proposed. It combines a one-level membrane structure with a particle swarm optimization (PSO) local search algorithm. The simulation results show that the proposed algorithm is valid and outperforms the state-of-the-art algorithms.     

一种采用种群多样性监控和实时更新策略的粒子群优化算法

针对粒子群算法优化后期容易出现早熟收敛问题,建立一种具有种群多样性监测和实时更新策略的改进方法.首先建立种群健康度指标用来评价粒子群进化状态;其次提出随机扰动策略和离心搜索策略用于丰富粒子群的种群多样性,增强算法的全局搜索能力,并提出梯度搜索策略用于精确、高效地搜寻当前邻域内的局部极值点,提高算法的计算效率.最后建立种群健康度反馈机制,使粒子可以实时感知种群的健康程度,并自适应地采用不同的粒子更新策略,保证粒子群处于健康进化水平.将新方法应用于优化实例,并与其它改进方法进行性能比较,结果验证了新方法的有效性.     

The reconstruction of particle size distributions from dynamic light scattering data using particle swarm optimization techniques with different objective functions

In this paper, the reconstruction of particle size distributions (PSDs) using particle swarm optimization (PSO) techniques from dynamic light scattering (DLS) data was established. Three different objective functions containing non-smooth constrained objective function, smooth functional objective function of Tikhonov regularization and L objective function, were employed. Simulated results of unimodal, bimodal and bi-dispersed particles show that the PSO technique with non-smooth constrained objective function produces narrower PSDs focusing on peak position in the presence of random noise, the PSO technique with smooth functional of Tikhonov regularization creates relative smooth PSDs, which could be successfully applied to the broad particles inversion, and the PSO technique with L objective function yields smooth PSDs, which saves calculation amount. Experimental results as well as comparisons with CONTIN algorithm and Cumulants method demonstrate the performance of our algorithms. Therefore, the PSO techniques employing the three different objective functions, which only require objective function and need a few initial guesses, may be applied to the reconstruction of PSDs from DLS data.     

粒子群算法在非线性系统应用中的早熟现象及其改进

通过分析粒子群算法早熟现象的机理,研究早熟收敛的本质,并提出一种克服粒子群算法早熟现象的局部"飞跃"策略.应用仿真及系统工程实例表明,该方法能有效地改善粒子群算法在非线性全局优化上的早熟问题,提高了粒子群算法的全局搜索能力.     

二冷配水优化建模与混合自适应PSO算法求解

针对连铸二冷区生产环境复杂且存在着大量水雾干扰的情况,建立了连铸水量优化模型并提出了一种混合的自适应粒子群算法来求解连铸二冷水优化问题。依据冶金过程中的工艺要求建立了二冷水量优化模型,并在经典的PSO算法基础上提出了适合该问题求解了混合自适应PSO算法。由于连铸过程存在着偏微分方程约束,传统的优化方法容易陷入局部最优解,不能达到很好的动态优化效果。研究了粒子群算法,基于种群的多样性,不断的自适应的更新粒子群算法中参数,将禁忌搜索的方法和传统的粒子群算法结合,增强了算法的局部搜索能力和全局寻找全局最优的能力。将该算法应用到连铸二冷水动态优化中,实验结果表面该算法能够快速有效的求解该优化问题。该方法用于连铸二冷水优化是可行的、有效的。     

The emergence of scaling laws search dynamics in a particle swarm optimization

This paper investigates the search dynamics of a fundamental particle swarm optimization (PSO) algorithm via gathering and analyzing the data of the search area during the optimization process. The PSO algorithm exhibits a distinct performance when optimizing different functions, which induces the emergence of different search dynamics during the optimization process. The simulation results show that the performance is tightly related to the search dynamics which results from the interaction between the PSO algorithm and the landscape of the solved problems. The Lévy type scaling laws search dynamics emerges from the process in which the PSO algorithm shows good performance, while the Brownian dynamics appears after the algorithm has stagnated due to the premature convergence. The Lévy dynamics characterized by a large number of intensive local searches punctuated by long-range transfers is an indicator of good performance, which allows the algorithm to achieve an efficient balance between exploration and exploitation so as to improve the search efficiency.     

A Particle Swarm Algorithm Based on a Multi-Stage Search Strategy

Particle swarm optimization (PSO) has the disadvantages of easily getting trapped in local optima and a low search accuracy. Scores of approaches have been used to improve the diversity, search accuracy, and results of PSO, but the balance between exploration and exploitation remains sub-optimal. Many scholars have divided the population into multiple sub-populations with the aim of managing it in space. In this paper, a multi-stage search strategy that is dominated by mutual repulsion among particles and supplemented by attraction was proposed to control the traits of the population. From the angle of iteration time, the algorithm was able to adequately enhance the entropy of the population under the premise of satisfying the convergence, creating a more balanced search process. The study acquired satisfactory results from the CEC2017 test function by improving the standard PSO and improved PSO.     

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

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

Cognitive radio adaptation for power consumption minimization using biogeography-based optimization

Adaptation is one of the key capabilities of cognitive radio, which focuses on how to adjust the radio parameters to optimize the system performance based on the knowledge of the radio environment and its capability and characteristics.In this paper, we consider the cognitive radio adaptation problem for power consumption minimization. The problem is formulated as a constrained power consumption minimization problem, and the biogeography-based optimization(BBO) is introduced to solve this optimization problem. A novel habitat suitability index(HSI) evaluation mechanism is proposed,in which both the power consumption minimization objective and the quality of services(Qo S) constraints are taken into account. The results show that under different Qo S requirement settings corresponding to different types of services, the algorithm can minimize power consumption while still maintaining the Qo S requirements. Comparison with particle swarm optimization(PSO) and cat swarm optimization(CSO) reveals that BBO works better, especially at the early stage of the search, which means that the BBO is a better choice for real-time applications.