一种基于并行混沌和SFLA的风电电网无功优化模型设计

针对已有方法在解决电网无功优化时,由于系统的无功不足和电网电压的不稳定,容易过早收敛到局部最优解的缺点,设计了一种基于并行混沌和混合蛙跳算法 (Shuffle Frog Leaping Algorithm, SFLA)的电网无功优化模型。首先,建立了最小化有功网损、最大化静态电压稳定裕度和最大化无功补偿单位投资收益的多目标数学优化模型,然后,对经典的SFLA进行改进,通过引入精英协同进化机制和划分种群的方式实现并行寻优,从而增加个体的多样性和加快最优解的求取速度,在不同种群中设计不同的适应度函数和个体更新进化方法。为了使得算法的初始解分布更为均匀,引入用混沌机制来对种群进行初始化,最后,对基于并行混沌和SFLA的总体算法进行了设计和分析。在Matlab环境下进行实验,实验结果表明文中方法得到的优化结果具有电网有功损耗小、单位投资收益高和静态电压稳定裕度大的优点,具有较强的可行性和适应性。     

自适应变异的蝙蝠算法

针对基本蝙蝠算法(BA)寻优精度不高、收敛速度慢和易早熟收敛的问题,提出一种改进的具有自适应变异机制的蝙蝠算法,用以求解复杂函数问题。利用K-means聚类对蝙蝠种群进行初始化,使种群在搜索空间分布更为均匀;采用根据迭代次数自适应变化的控制概率Pt判断算法是否进行高斯变异,增强种群多样性,促使蝙蝠个体跳出局部极值点;将自然选择思想引入BA,提高算法搜索速度,避免早熟收敛。选取几个典型函数进行测试,结果表明改进算法优化性能有了显著提高,具有较快的收敛速度,较高的寻优精度、收敛稳定性和收敛可靠性,验证了改进蝙蝠算法(IBA)的有效性及优越性。     

用改进的两步模拟退火法进行二元光学元件的设计

为了减少二元光学元件设计的计算量并提高设计精度,在对现有算法机理进行深入分析的基础上,提出了适用于二元光学元件设计的两步模拟退火法.该算法在整个退火过程中采用先量化后优化的策略,并将优化过程分为两个阶段：搜索并锁定最优解区间;快速收敛到最优解.模拟实验显示,与传统设计方法相比,该算法不仅保持了全局寻优的特点,而且提高了稳健性和效率.算法剔除了对设计结果影响较大的量化误差,提高了设计精度.用此法实例设计了单焦面辐射聚焦元件,得到了与目标图像一致的光学实验结果.     

基于时变Morlet小波变异的蝙蝠算法及函数优化

为了提高蝙蝠算法的全局收敛能力和收敛速度,提出了一种时变Morlet小波变异的蝙蝠算法(TVMWMBA);构建Morlet小波分布函数来描述小波变异因子分布的概率密度,然后利用小波变异因子的波动性和周期性,在每次迭代中对蝙蝠种群的个体进行小波变异,避免陷入局部最优,再通过时变系数动态收缩小波变异因子的变异空间,加快算法的收敛,提高收敛精度;函数优化仿真实验结果表明,改进算法有效的保持了种群的多样性,显著提高了优化稳定性,具有全局收敛能力强、寻优精度高和收敛速度快等特点。     

SVM参数优化方法分析与决策

针对支持向量机应用过程中的参数选择问题,从UCI数据库选择样本集,分别采用传统的网格法、智能优化算法中的粒子群法及遗传算法实现核函数参数寻优过程,将所得最佳参数应用到样本测试中。在深入分析优化过程中各参数关系、参数对支持向量机性能的影响以及传统与智能优化算法的优劣后,得出了核函数优化策略。即先使用智能优化算法初步确定最优解范围,再结合网格法进行高精度寻优。实验数据验证了参数优化策略的有效性,为扩大支持向量机泛化率、提高应用性做了铺垫。     

薄膜光学常数的粒子群算法

为解决椭偏法测量薄膜厚度和折射率实验数据处理较为复杂的问题,采用一种新的基于群体智能的优化算法——粒子群算法处理实验数据.以单层吸收薄膜的测量为例,利用该算法进行数据处理.实验结果表明,可以同时获得3个薄膜参数(折射率n,消光系数k和薄膜厚度d),而且在确切参数范围未知情况下,大范围内进行搜索仍然能保证快速收敛到最优解.该算法与遗传算法以及利用椭偏仪数据处理软件得出的结果相比较,计算精度高,收敛速度快.     

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

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

角度受限下稀疏投影数据的改进粒子群优化随机CT重建

当计算机断层成像(CT)中X射线的采样范围和数量受限时,得到的稀疏投影数据完备性很低,重建算法的搜索空间巨大。基于凸优化思路的迭代求解算法及其改进采用固定搜索路径,难以在有限时间内收敛至全局最优解;粒子群优化具有全局搜索能力,但计算成本和存储代价过高。为解决这类不完备投影数据的重建问题,提出基于粒子群优化的随机稀疏重建算法。首先,通过随机策略生成具有多样性的初始种群,以保证算法的搜索能力;其次,随机选择梯度下降或基于个体历史最优解和全局历史最优解的随机方向进行迭代,以兼顾算法效率和搜索方向的多样性;最后,基于适应度评价,有针对性地重新生成随机初始种群,强制跳离局部最优。针对角度受限下无噪声和含噪声的稀疏投影数据,分别进行重建实验。结果显示,与常见的凸优化迭代和粒子群优化算法相比,本文算法既能保证算法效率,又在重建质量和算法稳健性上具有明显优势。     

有源头靠中一种分布式虚拟传声器优化方法

有源降噪头靠系统中,远程虚拟传声器技术能够解决控制点处与误差传声器处降噪量不匹配的问题。在实际应用中,多通道虚拟传声器技术存在收敛速度慢和运算复杂度高等问题。针对这个问题,本文通过重新设计远程虚拟传声技术的离线优化过程,提出一种分布式远程虚拟传声器技术优化方法。该方法将虚拟次级通路矩阵作对角化限制,同时对观测传递函数矩阵进行联合寻优,以实现一种分布式的更新算法。有源降噪头靠实验结果表明,所提算法能够有效降低远程虚拟传声器技术算法的运算复杂度,并且提升了算法的收敛速度。     

基于高速移动通信的虚拟天线阵列理论研究

在高速移动通信中, 多普勒频移对通信性能产生严重的影响, 通常需要对接收信号的多普勒频移进行估计并进行补偿. 本文研究在对单个天线接收的高速移动通信信号进行频移估计和补偿的基础上产生多路无频偏的信号, 并虚拟为天线阵列的输出以提高系统的接收增益. 首先讨论了“均匀时间采样”和“均匀相位采样”的关系, 并根据两者之间的关系提出了补偿多普勒频移和虚拟天线阵列的算法, 即对采样信号进行插值、均匀相位抽取以后, 再进行均匀时间采样. 然后分析了算法对高速移动通信系统性能的改善作用, 并提出了算法的硬件实现结构. 通过数值仿真验证了算法的干扰抑制能力和误码性能, 结果表明本文提出的虚拟天线阵列算法能够改善飞机、高铁上的高速移动通信系统的性能.     

Learning Competitive Swarm Optimization

Particle swarm optimization (PSO) is a popular method widely used in solving different optimization problems. Unfortunately, in the case of complex multidimensional problems, PSO encounters some troubles associated with the excessive loss of population diversity and exploration ability. This leads to a deterioration in the effectiveness of the method and premature convergence. In order to prevent these inconveniences, in this paper, a learning competitive swarm optimization algorithm (LCSO) based on the particle swarm optimization method and the competition mechanism is proposed. In the first phase of LCSO, the swarm is divided into sub-swarms, each of which can work in parallel. In each sub-swarm, particles participate in the tournament. The participants of the tournament update their knowledge by learning from their competitors. In the second phase, information is exchanged between sub-swarms. The new algorithm was examined on a set of test functions. To evaluate the effectiveness of the proposed LCSO, the test results were compared with those achieved through the competitive swarm optimizer (CSO), comprehensive particle swarm optimizer (CLPSO), PSO, fully informed particle swarm (FIPS), covariance matrix adaptation evolution strategy (CMA-ES) and heterogeneous comprehensive learning particle swarm optimization (HCLPSO). The experimental results indicate that the proposed approach enhances the entropy of the particle swarm and improves the search process. Moreover, the LCSO algorithm is statistically and significantly more efficient than the other tested methods.     

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.     

Intelligent reversible watermarking technique in medical images using GA and PSO

The advances in recording, editing, and broadcasting multimedia contents in digital form motivate to protect these digital contents from illegal use, such as duplication, manipulation, and redistribution. However, watermarking algorithms are designed to satisfy requirements of applications, as different applications have different concerns. We intend to design a watermarking algorithm for applications which require high embedding capacity and imperceptibility, to maintain the integrity of the host signal as well as embedded information. Reversible watermarking is a promising technique which satisfies our requirements. In this paper, we concentrate on improving the watermark capacity and reducing the perceptual degradation of an image. We investigated the Luo's [1] additive interpolation-error expansion algorithm and enhanced it by incorporating with two intelligent techniques: genetic algorithm (GA), and particle swarm optimization (PSO). Genetic algorithm is applied to exploit the correlation of image pixel values to obtain better estimation of neighboring pixel values, which results in optimal balance between information storage capacity and imperceptibility. Particle swarm optimization (intelligent technique) is also applied for the same purpose. Experimental results show that PSO and GA nearly give the same results, but GA outperforms the PSO. Experimental results also reveal that the proposed strategy outperforms the state of art works in terms of perceptual quality and watermarking payload.     

一种基于离散粒子群优化算法的高光谱图像端元提取方法

针对混合像元分解过程中,由于数据噪声引起的端元提取不准确问题,引入了群智能算法中的粒子群优化算法,并对粒子群优化算法进行了改进,重新定义了位置和速度的表示方法和更新策略,得到离散粒子群优化(discrete particle swarm optimization,D-PSO),能够在离散空间中进行搜索,解决组合优化问题。同时,通过定义目标函数和可行解空间,将端元提取问题改写成组合优化问题,最终实现利用D-PSO进行端元提取。在给出算法的详细流程之后,文章通过一组模拟数据实验和一组实际数据实验验证了D-PSO算法对于具有较大噪声的数据的适应性和提取端元的可信程度,并分析了不同参数对于算法性能的影响。     

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

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

A Diversity Model Based on Dimension Entropy and Its Application to Swarm Intelligence Algorithm

The swarm intelligence algorithm has become an important method to solve optimization problems because of its excellent self-organization, self-adaptation, and self-learning characteristics. However, when a traditional swarm intelligence algorithm faces high and complex multi-peak problems, population diversity is quickly lost, which leads to the premature convergence of the algorithm. In order to solve this problem, dimension entropy is proposed as a measure of population diversity, and a diversity control mechanism is proposed to guide the updating of the swarm intelligence algorithm. It maintains the diversity of the algorithm in the early stage and ensures the convergence of the algorithm in the later stage. Experimental results show that the performance of the improved algorithm is better than that of the original algorithm.     

Improved Particle Swarm Optimization Based on Entropy and Its Application in Implicit Generalized Predictive Control

Setting sights on the problem of input-output constraints in most industrial systems, an implicit generalized predictive control algorithm based on an improved particle swarm optimization algorithm (PSO) is presented in this paper. PSO has the advantages of high precision and fast convergence speed in solving constraint problems. In order to effectively avoid the problems of premature and slow operation in the later stage, combined with the idea of the entropy of system (SR), a new weight attenuation strategy and local jump out optimization strategy are introduced into PSO. The velocity update mechanism is cancelled, and the algorithm is adjusted respectively in the iterative process and after falling into local optimization. The improved PSO is used to optimize the performance index in predictive control. The combination of PSO and gradient optimization for rolling-horizon improves the optimization effect of the algorithm. The simulation results show that the system overshoot is reduced by about 7.5% and the settling time is reduced by about 6% compared with the implicit generalized predictive control algorithm based on particle swarm optimization algorithm (PSO-IGPC).     

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

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

Epileptic Seizure Detection Using Geometric Features Extracted from SODP Shape of EEG Signals and AsyLnCPSO-GA

Epilepsy is a neurological disorder that is characterized by transient and unexpected electrical disturbance of the brain. Seizure detection by electroencephalogram (EEG) is associated with the primary interest of the evaluation and auxiliary diagnosis of epileptic patients. The aim of this study is to establish a hybrid model with improved particle swarm optimization (PSO) and a genetic algorithm (GA) to determine the optimal combination of features for epileptic seizure detection. First, the second-order difference plot (SODP) method was applied, and ten geometric features of epileptic EEG signals were derived in each frequency band (δ, θ, α and β), forming a high-dimensional feature vector. Secondly, an optimization algorithm, AsyLnCPSO-GA, combining a modified PSO with asynchronous learning factor (AsyLnCPSO) and the genetic algorithm (GA) was proposed for feature selection. Finally, the feature combinations were fed to a naïve Bayesian classifier for epileptic seizure and seizure-free identification. The method proposed in this paper achieved 95.35% classification accuracy with a tenfold cross-validation strategy when the interfrequency bands were crossed, serving as an effective method for epilepsy detection, which could help clinicians to expeditiously diagnose epilepsy based on SODP analysis and an optimization algorithm for feature selection.     

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.