采用粒子群算法的空时二维参数估计

针对传统的空时二维参数估计计算复杂、鲁棒性及通用性差、收敛速度慢等缺点,根据空时具有等效性,以空域和时域处理算法可以相互转化为基础,推导出合适的适应度函数,运用改进的粒子群算法同时搜索信号的到达角和频率,用K means聚类算法对搜索结果进行分类,利用粒子群算法计算简单、全局收敛、可并行性等特点提高算法的搜索能力。计算机仿真表明,与传统的方法相比该算法具有较好的统计和收敛性能。     

Multi-objective parameter estimation of induction motor using particle swarm optimization

In order to simplify the offline parameter estimation of induction motor, a method based on optimization using a particle swarm optimization (PSO) technique is presented. Three different induction motor models such as approximate, exact and deep bar circuit models are considered. The parameter estimation methodology describes a method for estimating the steady-state equivalent circuit parameters from the motor performance characteristics, which is normally available from the manufacturer data or from tests. The optimization problem is formulated as multi-objective function to minimize the error between the estimated and the manufacturer data. The sensitivity analysis is also performed to identify parameters, which have the most impact on motor performance. The feasibility of the proposed method is demonstrated for two different motors and it is compared with the genetic algorithm and the classical parameter estimation method. Simulation results show that the proposed PSO method was indeed capable of estimating the parameters over a wide operating range of the motor.     

一种用于多目标优化的混合粒子群优化算法

将粒子群算法与局部优化方法相结合,提出了一种混合粒子群多目标优化算法（HMOPSO）。该算法针对粒子群局部优化性能较差的缺点,引入多目标线搜索与粒子群算法相结合的策略,以增强粒子群算法的局部搜索能力。HMOPSO首先运行PSO算法,得到近似的Pareto最优解;然后启动多目标线搜索,发挥传统数值优化算法的优势,对其进行进一步的优化。数值实验表明,HMOPSO具有良好的全局优化性能和较强的局部搜索能力,同时HMOPSO所得的非劣解集在分散性、错误率和逼近程度等量化指标上优于MOPSO。     

混合粒子群优化算法

针对粒子群优化算法在处理高维复杂函数时存在收敛速度慢、易陷入早熟收敛等缺点,提出了混合粒子群优化算法。它借鉴群体位置方差的早熟判断机制,把基因换位和变异算子引入到算法中,构造出新的个体和个体基因的适应值函数,将适应值最差的基因进行变异。为减少算法计算量,采用耗散的粒子群算法结构。实验表明,该算法比只有一个适应值的粒子群算法具有更快的收敛速度。且具有很强的避免局部极小能力,其性能远远优于单一优化方法。     

一种求解作业车间调度的混合粒子群算法*

针对车间作业调度问题,提出了一种混合了知识进化算法和粒子群优化的算法。算法主要是结合知识进化算法的进化选择机制和粒子群优化的局部快速收敛性特性,首先让粒子替代知识进化算法中的进化个体,在群体空间中按粒子群优化规则寻找局部最优,然后根据知识进化算法的全局选择机制寻找全局最优,最后,将车间作业调度问题的特点融入到所提出的混合算法中求解问题。采用基准数据进行测试的仿真实验,并比对标准遗传算法,结果表明所提算法的有效性。     

一种混合的多目标粒子群算法

将混沌变异和局部搜索与粒子群算法相结合用于多目标寻优。寻优的过程中以拥挤距离为标准,在进化的不同阶段采用相应的优化策略。当种群陷入局部最优时用混沌变异跳出该局部最优;用局部搜索法在进化后期增强算法的多样性和收敛性。实验结果表明,该方法求得的Pareto前沿分布更加均匀,更加接近理论的Pareto前沿。     

Distributed and robust parameter estimation of IIR systems using incremental particle swarm optimization

In recent years because of substantial use of wireless sensor network the distributed estimation has attracted the attention of many researchers. Two popular learning algorithms: incremental least mean square (ILMS) and diffusion least mean square (DLMS) have been reported for distributed estimation using the data collected from sensor nodes. But these algorithms, being derivative based, have a tendency of providing local minima solution particularly for minimization of multimodal cost function. Hence for problems like distributed parameters estimation of IIR systems, alternative distributed algorithms are required to be developed. Keeping this in view the present paper proposes two population based incremental particle swarm optimization (IPSO) algorithms for estimation of parameters of noisy IIR systems. But the proposed IPSO algorithms provide poor performance when the measured data is contaminated with outliers in the training samples. To alleviate this problem the paper has proposed a robust distributed algorithm (RDIPSO) for IIR system identification task. The simulation results of benchmark IIR systems demonstrate that the proposed algorithms provide excellent identification performance in all cases even when the training samples are contaminated with outliers.     

Electrochemical machining process parameter optimization using particle swarm optimization

Electrochemical machining (ECM) is a nontraditional process used for the machining of hard materials and metal‐matrix composites. Composites are used in several applications such as aerospace, automobile industries, and medical field. The determination of optimal process parameters is difficult in the ECM process for obtaining maximum material removal rate (MRR) and good surface roughness (SR). In this paper, a multiple regression model is used to obtain the relationship between process parameters and output parameters. Particle swarm optimization (PSO) is one of the optimization techniques for solving the multiobjective problem; it is proposed to optimize the ECM process parameters. Current (C), voltage (V), electrolyte concentration (E), and feed rate (F) are considered as process parameters, and MRR and SR are the output parameters used in the proposed work. The developed multiple regression is statistically analyzed by regression plot and analysis of variance. The optimized value of MRR and SR obtained in PSO is 0.0116 g/min and 2.0106 μm, respectively. Furthermore, PSO is compared with the genetic algorithm. The PSO technique outperforms the genetic algorithm in computation time and statistical analysis. The obtained values are validated to test the significance of the model, and it is noticed that the error value for MRR and SR is within 0.15%.     

Hybrid particle swarm optimization with simulated annealing

Multimedia Tools and Applications - While solving the optimization problems of complex functions, particle swarm optimization (PSO) would be easy to fall into trap in the local optimum. Besides...     

Boost particle swarm optimization with fitness estimation

Natural Computing - It is well known that the classical particle swarm optimization (PSO) is time-consuming when used to solve complex fitness optimization problems. In this study, we perform...     

混合自适应粒子群工作流调度优化算法

针对具有截止期的云工作流完成时间与执行成本冲突的问题,提出一种混合自适应粒子群工作流调度优化算法（HAPSO）。首先,基于截止期建立有向无环图（DAG）云工作流调度模型;然后,通过范数理想点与自适应权重的结合,将DAG调度模型转化为权衡DAG完成时间和执行成本的多目标优化问题;最后,在粒子群优化（PSO）算法的基础上引入自适应惯性权重、自适应学习因子、花朵授粉算法的概率切换机制、萤火虫算法（FA）和粒子越界处理方法,从而平衡粒子群的全局搜索与局部搜索能力,进而求解DAG完成时间与执行成本的目标优化问题。实验中对比分析了PSO、惯性权重粒子群算法（WPSO）、蚁群算法（ACO）和HAPSO的优化结果。实验结果表明,HAPSO在权衡工作流（30～300任务数）完成时间与执行成本的多目标函数值上降低了40.9%～81.1%,HAPSO在工作流截止期约束下有效权衡了完成时间与执行成本。此外,HAPSO在减少完成时间或降低执行成本的单目标上也有较好的效果,验证了HAPSO的普适性。     

求解背包问题的混合粒子群优化算法

提出一种新的遗传思想：父代的基因决定子代继承某一基因的概率,而不是由单纯的交叉产生子代。根据此思想,提出两种利用遗传概率产生子代的方法,并将它们分别与粒子群优化算法相结合得到两种求解背包问题的混合粒子群优化算法。通过数值实验说明了同样的算法采用遗传策略要比交叉策略寻优性更强,分析了变异概率对算法的影响。     

A parameter selection strategy for particle swarm optimization based on particle positions

In this study, we found that engineering experience can be used to determine the parameters of an optimization algorithm. We came to this conclusion by analyzing the dynamic characteristics of PSO through a large number of experiments. We constructed a relationship between the dynamic process of particle swarm optimization and the transition process of a control system. A novel parameter strategy for PSO was proven in this paper using the overshoot and the peak time of a transition process. This strategy not only provides a series of flexible parameters for PSO but it also provides a new way to analyze particle trajectories that incorporates engineering practices. In order to validate the new strategy, we compared it with published results from three previous reports, which are consistent or approximately consistent with our new strategy, using a suite of well-known benchmark optimization functions. The experimental results show that the proposed strategy is effective and easy to implement. Moreover, the new strategy was applied to equally spaced linear array synthesis examples and compared with other optimization methods. Experimental results show that it performed well in pattern synthesis.     

利用T-S模糊自适应PSO算法优化PID参数

针对微粒群优化算法存在的早熟问题,提出了一种基于T-S模型的模糊自适应PSO算法（T-SPSO算法）。算法依据种群当前最优性能指标和惯性权重值所制定T-S规则,动态自适应惯性权重取值,改善了PSO算法的收敛性。将该算法应用于PID控制器的参数整定,可得到更优的控制器参数。仿真结果验证了所提出算法的有效性和所设计控制器的优越性。     

粒子群算法量子模型

针对目前粒子群优化(PSO)算法理论基础薄弱,算法本质的分析还未形成体系的问题,从微观的角度出发,以量子力学为基础,提出并建立了粒子群优化算法的量子模型.模型采用无限深方势阱为分析背景,将算法的搜索过程解释为量子状态的转换,并通过模型解释算法执行过程中的内部机制,最后通过实验证明了所提出PSO算法寻优的量子本质.     

基于粒子群优化方法的电力系统状态向量估计模型

电力系统状态向量估计是电力系统能量管理系统的重要组成部分;在电力系统实时监控中,传统的基于最小二乘法的状态向量估计方法,存在估计值与实际电力系统中的参数值相差较大的问题,基于此提出了一种适用于电力系统实时监测的有效状态估计模型;该模型采用了一种基于直角坐标系的加权最小二乘法,由一组与测量量和状态变量相关的非线性方程组描述,使用预测-校正迭代技术求解状态估计器模型;利用粒子群算法优化同步相量测量单元(phasor measurements unit,PMU)仪表的分配,增强了算法的有效性;该模型被应用于IEEE14总线和IEEE-30总线测试系统;结果表明,与传统算法相比,所开发的电力系统状态向量估计模型在执行时间、准确性和迭代次数方面均有明显的优势,所提出的估计模型对于实时监控应用具有很好的应用前景.     

求解非线性方程组的混合粒子群算法

结合Hooke-Jeeves和粒子群的优点,提出了一种混合粒子群算法,用于求解非线性方程组,以克服Hooke-Jeeves算法对初始值敏感和粒子群容易陷入局部极值而导致解的精度不够的缺陷。该算法充分发挥了粒子群强大的全局搜索能力和Hooke-Jeeves的局部精细搜索能力,数值实验结果表明：能够以满意的精度求出对未知数具有敏感性的非线性方程组的解,具有良好的鲁棒性和较快的收敛速度和较高的搜索精度。     

量子粒子群优化算法的控制参数分析

针对现有的量子粒子群优化算法（ QPSO）中收缩扩张系数α取固定值或线性变化时,不能很好地适应复杂的多维非线性优化搜索问题,提出了两种参数α控制策略：基于Logistic函数的动态非线性递减策略和自适应参数调整策略。在第一种策略中引入S型函数来描述α值在进化过程中的动态变化特性,第二种策略中引入反馈调节方式来控制α值的变化。几个典型函数的实验测试结果表明,两种改进后的参数调整策略对于复杂优化问题在收敛速度和平均最优值上都有所改善,明显优于取固定值或线性变化策略。     

Geometric particle swarm optimization for robust visual ego-motion estimation via particle filtering

Conventional particle filtering-based visual ego-motion estimation or visual odometry often suffers from large local linearization errors in the case of abrupt camera motion. The main contribution of this paper is to present a novel particle filtering-based visual ego-motion estimation algorithm that is especially robust to the abrupt camera motion. The robustness to the abrupt camera motion is achieved by multi-layered importance sampling via particle swarm optimization (PSO), which iteratively moves particles to higher likelihood region without local linearization of the measurement equation. Furthermore, we make the proposed visual ego-motion estimation algorithm in real-time by reformulating the conventional vector space PSO algorithm in consideration of the geometry of the special Euclidean group SE(3), which is a Lie group representing the space of 3-D camera poses. The performance of our proposed algorithm is experimentally evaluated and compared with the local linearization and unscented particle filter-based visual ego-motion estimation algorithms on both simulated and real data sets.     

基于Lotka-Volterra 模型的双群协同竞争粒子群优化算法

针对粒子群优化算法易出现早熟收敛的问题,提出了基于Lotka-Volterra模型的双群协同竞争粒子群优化算法(LVPSO).LVPSO算法借鉴种群生态学中著名的Lotka-Volterra双群协同竞争模型,讨论了两种种群协同竞争方案,通过群内和群间竞争增加粒子的多样性,提高了种群摆脱局部极值的能力.对5个典型基准测试函数进行优化实验表明,LVPSO在收敛速度和优化精度方面均有良好的表现.