一种多样性反馈高斯粒子群算法

针对粒子群算法在算法迭代后期因多样性减少而容易陷入局部最优的缺陷,引入种群多样性反馈(群活性反馈)和高斯正态惯性权重变异算子对粒子群算法进行改进,当粒子群的多样性减少时,通过改变粒子的惯性权重调节粒子速度和位置,从而跳出局部最优解.与标准粒子群算法对比仿真结果表明:多样性反馈高斯粒子群算法在全局搜索能力和寻优性能上有很大提高,多样性提高近一倍,迭代时间缩短近3/4.     

基于微粒群本质特征的混沌微粒群优化算法

在总结对微粒群优化(PSO)算法本质的主要研究成果的基础上,提出了基于微粒群本质特征的混沌微粒群优化(CPSO)算法.该算法用混沌搜索方法代替随机数产生器在较好的区域搜索最优解.为了提高粒子群的多样性,用由粒子邻域内若干个个体最优位置依其适应值加权平均得到的中心位置代替标准PSO算法的全局历史最优位置.然后,根据粒子个体最优位置与上述中心位置间的距离自适应地调整混沌搜索区域半径.用几个经典测试函数的仿真结果及与其它几种PSO算法的比较结果验证了新算法的有效性.     

局部阴影光伏发电系统中基于改进PSO的MPPT控制

光伏发电系统在局部阴影条件下,传统的最大功率点跟踪算法（maximum power point tracking,MPPT）容易陷入局部寻优,无法跟踪到全局最大功率点. 针对这一问题,本文提出了一种基于自适应学习因子粒子群算法的最大功率跟踪方法. 该方法在普通粒子群算法的基础上不断改变学习因子和权重系数,以提高算法收敛的速度和精度. 将其应用于局部阴影条件下的光伏发电系统最大功率点跟踪中,并在RT-LAB实时仿真平台中以两个接受不同光照强度的光伏阵列为例进行实时仿真验证. 仿真结果表明,两峰情况下本文所提出的自适应学习因子粒子群算法能够在0.298 s左右跟踪到全局最大功率点,普通粒子群算法需要约0.615 s,而扰动观察法陷入了局部最大功率点,本文所提算法能够有效提高系统的收敛速度和精度并且适用于多峰情况. 最后设置仿真算例验证本算法适用于光照突变的情况.      

具有动态调节机制的多粒子群改进算法及应用

针对标准粒子群算法(standard particle swarm optimization,SPSO)的稳定性较差及易陷入局部收敛等缺陷,将粒子群体划分为多组粒子群,提出了一种子群粒子和其产生的精英粒子分两步协同进化的方案,采用混沌、高斯动态扰动粒子位置及云正态模型自适应动态调整惯性权重等动态调节机制优化粒子飞行轨迹,促进粒子又快又好的向群体最优目标飞行,以改善SPSO算法的全局寻优性能并提高多目标优化问题的多样性.采用新颖的误差适应度函数设计了FIR高通数字滤波器,并与基于RGA、PSO、CRPSO及典型Parks-McClellan算法的滤波器进行了对比与分析.仿真实验表明:基于具有动态调节机制的多粒子群改进算法及目标函数设计的滤波器,具有通带波动小,阻带衰减大的优势.     

基于云模型的改进粒子群PMSM参数辨识算法

针对永磁同步电机传统参数辨识方法存在的缺陷,提出了一种基于云模型的改进粒子群参数辨识算法.该算法首先采用高频电压注入法建立高频电压方程,通过滤波处理获取高低频信号构建四阶满秩实时电机辨识模型;将云模型理论与粒子群算法相结合,采用正态云发生器对粒子进化变异操作建模,实现了自适应动态调节粒子的搜索范围,有效克服早熟收敛,保证了辨识参数为全局最优解.实验表明该辨识方法寻优能力强,搜索精度高,稳定性好,具有良好的动态性能.     

敷设聚脲的吸声模型改进粒子群算法优化

为了提高敷薄吸声层的水下小目标的隐身性能,以敷设聚脲的多层结构为基本吸声模型,推导了模型的反射系数计算公式.针对材料优化的应用需求,将粒子群算法的局部算法和全局算法相结合,改进粒子群算法的优化策略,得到了动态混合粒子群算法,提高了收敛能力和搜索精度.利用该算法对多层吸声模型的材料参数进行寻优,结果表明:当吸声材料杨氏模量近似为频率的分段线性函数时,其吸声性能最优.在此基础上,建立了提高模型吸声性能的理论方法,并进行了实例验证,结果表明,该方法可使模型吸声性能在140～500 kHz范围内达到-10dB以上.     

基于遗传-粒子群优化算法的USV路径规划方法

为解决传统粒子群优化算法(particle swarm optimization algorithm,PSO)应用于无人水面舰艇(unmanned surface vessel,USV)路径规划时存在的早熟收敛问题,提出一种结合遗传思想的PSO,在传统的PSO中引入遗传算法(genetic algorithm,GA)中的交叉、变异操作,避免算法进入局部最优解,对惯性权重进行自适应调整,加速算法收敛.采用MATLAB软件对USV巡检水域环境进行建模,应用改进的PSO进行路径规划.仿真结果表明:相对于传统的PSO和GA,该算法有效减少路径交叉点,大幅缩短路径总长和算法收敛时间.     

细菌觅食机制粒子群优化算法

针对基本粒子群优化算法易陷入局部极值的缺陷,提出了一种细菌觅食机制粒子群优化算法.其基本思想是在粒子群优化算法中引入细菌觅食行为机制,提高PSO算法跳出局部极值的能力,借以改善PSO算法的寻优性能.采用标准测试函数的实验结果表明,该算法在收敛速度和求解精度方面均有显著改进.     

基于多智能体局部寻优的粒子群优化算法

为了提高粒子群算法的收敛速度和全局寻优能力,用多智能体遗传算法对粒子群算法当前搜索到的全局极值进行局部寻优．用搜索到的更好的解在下一次迭代中引导粒子进行搜索从而获得更快的收敛速度和更好的全局收敛性。对函数优化和神经网络训练的仿真实验表明．此算法能更快的收敛到全局最优解。     

一种基于ADPSO优化的循环神经网络模型

针对循环神经网络(Recurrent Neural Network,RNN)采用传统的训练方法造成的收敛速度慢、易陷入局部最优的问题,提出一种自动调整的动态粒子群优化算法(ADPSO),利用ADPSO较强的全局寻优能力来优化RNN的初始权值及阈值,构建基于ADPSO优化的RNN模型(ADPSO-RNN),从而提升RNN的预测性能及泛化性能.在ADPSO中,将动态搜索空间策略引入到粒子群算法中,同时自适应地调整学习因子以平衡算法的全局和局部搜索能力.在实验中,将ADPSO与PSO进行算法优化性能对比,结果表明ADPSO具有更好的寻优性能;然后以某股票的股票价格历史数据为实验数据,将ADPSO-RNN与常规RNN、PSO优化的RNN分别对其进行预测,结果表明ADPSO-RNN模型在股票价格预测中预测指标平均绝对误差和均方误差上相对于另外两种模型均有所降低,具有更好的泛化性能.     

Research of Improved Fuzzy c-means Algorithm Based on a New Metric Norm

For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FCM and particle swarm optimization(PSO)clustering algorithm,and proposes a parallel optimization algorithm using an improved fuzzy c-means method combined with particle swarm optimization(AF-APSO).The experiment shows that the AF-APSO can avoid local optima,and get the best fitness and clustering performance significantly.     

Application of particle swarm algorithm in the optimal allocation of regional water resources based on immune evolutionary algorithm

The optimal allocation model of regional water resources is built with the purpose of maximizing the comprehensive economic,social and environmental benefits of regional water consumption.In order to solve the problems that easily appear during the model solution of regional water resource optimal allocation with multiple water sources,multiple users and multiple objectives like＂curse of dimensionality＂or sinking into local optimum,this paper proposes a particle swarm optimization（PSO）algorithm based on immune evolutionary algorithm（IEA）.This algorithm introduces immunology principle into particle swarm algorithm.Its immune memorizing and self-adjusting mechanism is utilized to keep the particles in the fitness level at a certain concentration and guarantee the diversity of population.Also,the global search characteristics of IEA and the local search capacity of particle swarm algorithm have been fully utilized to overcome the dependence of PSO on initial swarm and the deficiency of vulnerability to local optimum.After applying this model to the allocation of water resources in Zhoukou,we obtain the scheme for optimization allocation of water resources in the planning level years,i.e.2015and 2025 under the guarantee rate of 50%.The calculation results indicate that the application of this algorithm to solve the issue of optimal allocation of regional water resources is reliable and reasonable.Thus it ofers a new idea for solving the issue of optimal allocation of water resources.     

Adaptive Identification of Logging Lithology Based on VPSO-ENN Hybrid Algorithm

Particle swarm optimization (PSO) was modified by variation method of particle velocity, and a variation PSO (VPSO) algorithm was proposed to overcome the shortcomings of PSO, such as premature convergence and local optimization. The VPSO algorithm is combined with Elman neural network (ENN) to form a VPSO-ENN hybrid algorithm. Compared with the hybrid algorithm of genetic algorithm (GA) and BP neural network (GA-BP), VPSO-ENN has less adjustable parameters, faster convergence speed and higher identification precision in the numerical experiment. A system for identifying logging parameters was established based on VPSO-ENN. The results of an engineering case indicate that the intelligent identification system is effective in the lithology identification.     

TDOA Passive Location Based on Cuckoo Search Algorithm

This paper formulates a new framework to estimate the target position by adopting cuckoo search(CS)positioning algorithm. Addressing the nonlinear optimization problem is a crucial spot in the location system of time difference of arrival(TDOA). With the application of the Levy flight mechanism, the preferential selection mechanism and the elimination mechanism, the proposed approach prevents positioning results from falling into local optimum. These intelligent mechanisms are useful to ensure the population diversity and improve the convergence speed. Simulation results demonstrate that the cuckoo localization algorithm has higher locating precision and better performance than the conventional methods. Compared with particle swarm optimization(PSO) algorithm and Newton iteration algorithm, the proposed method can obtain the Cram′er-Rao lower bound(CRLB) and quickly achieve the global optimal solutions.     

Learning Bayesian Networks from Data by Particle Swarm Optimization

Introduction Bayesian networks are a graphical representa-tion of a multivariate joint probability distributionthat exploits the dependency structure of distribu-tions. Bayesian networks are directed acyclicgraphs(DAG), where the nodes are random vari-abl…     

车辆路径问题的混沌粒子群算法研究

针对车辆路径问题中单仓库非满载这一基本类型的具体特性,设计了一种混沌粒子群算法;利用混沌系统的随机性、规律性和遍历性初始化粒子,大范围覆盖车辆路径问题的解空间,加强算法最优路径的搜索能力;通过在求解过程中的次优路径处施加混沌扰动,使算法放弃当前求解的路径,避免结果为次优解。并通过试验验证了该算法在车辆路径问题中具有很强的寻优能力。     

Multi-objective optimal approach for injection molding based on surrogate model and particle swarm optimization algorithm

An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization(PSO) algorithm was constructed.As a new surrogate model technology,Kriging model has better fitting precision for nonlinear problem.The Kriging model was adopted to replace computer aided engineering(CAE) simulation as fitness function of multi-objective PSO algorithm,and the computation cost can be reduced greatly.By introducing multi-objective handling mechanism of crowding distance and mutation oper...     

A Discrete Bat Algorithm for Disassembly Sequence Planning

Based on the bat algorithm (BA), this paper proposes a discrete BA (DBA) approach to optimize the disassembly sequence planning (DSP) problem, for the purpose of obtaining an optimum disassembly sequence (ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model (FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm (GA), particle swarm optimization (PSO) algorithm and differential mutation BA (DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.