一种基于免疫小生境思想的粒子群优化算法

针对PSO易收敛于局部最优的缺点,提出了运用免疫小生境思想来改进PSO。该算法在初始化时,运用正交的思想,使得粒子分布均匀;且在进化时,通过对每个粒子做免疫变换,使得每个粒子扩展成为在一个区域寻找最优值,提高了粒子的多样性,避免了局部最优;并且在变换时,每隔几代才进行免疫变换。这样在保证粒子多样性的基础上减少了运算量,提高了收敛速度。并在MATLAB环境下对Ackley函数、Schaffer函数、Griewank函数、Rastrigrin函数四个多峰函数进行了仿真验证,实验结果表明,改进的PSO算法能够有效地达到全局最优。     

小生境粒子群优化算法

针对粒子群算法容易早熟收敛和后期收敛速度慢的缺点,结合进化论中小生境技术,提出了小生境粒子群优化算法。通过粒子之间的距离找到具有相似距离的粒子个体组成小生境种群,然后在该种群里面利用粒子群优化算法进化粒子,所有个体经过其小生境群体的进化之后,找到最优的个体存入到下一代的粒子群中,直到找到满意的适应值为止。最后利用Shaffer函数验证了该算法的性能,并且与其他算法进行比较,结果表明该文算法能获得比较好的解,收敛成功率高,并且代价也比较小。     

一种基于调节因子的小生境粒子群优化算法

针对混沌变异的小生境粒子群优化算法(NCPSO)进化中收敛速度慢、搜索精度低的缺点,提出一种基于调节因子的NCPSO改进算法(NCPSO-FLV)。通过引入速度调节因子,对收敛速度做出判断,改变粒子速度帮助粒子跳出局部最优值,使种群多样性得到加强,收敛速度和搜索精度得到提高。实验结果表明,与基于惯性权重的基本粒子群算法和NCPSO算法相比,NCPSO-FLV算法的精度更高,适用于生产任务分配的工业优化计算。     

基于混沌变异的小生境粒子群算法

针对粒子群算法早熟收敛和搜索精度低的问题,提出了基于混沌变异的小生境粒子群算法（NCPSO）．该算法结合小生境技术并加入了淘汰机制,使算法具有良好的全局寻优能力．变尺度混沌变异具有精细的局部遍历搜索性能·使算法具有较高的搜索精度．实验结果表明,NCPSO算法可有效避免标准PSO算法的早熟收敛,具有寻优能力强、搜索精度高、稳定性好等优点．适合于工程应用中的复杂函数优化问题．     

基于混沌变异算子的小生境量子粒子群算法

针对粒子群算法早熟收敛和搜索精度低的问题,提出了基于混沌变异的小生境量子粒子群算法(NCQPSO).该算法结合小生境技术并加入了淘汰机制.使算法具有良好的全局寻优能力.变尺度混沌变异具有精细的局部遍历搜索性能.使算法具有较高的搜索精度,实验结果表明,NCQPSO算法可有效避免标准PSO(Particle Swarm Optimization)算法的早熟收敛,具有寻优能力强、搜索精度高、稳定性好等优点.也优于原始的量子粒子群算法QPSO(Quantum-behaved Particle Swarm Optimization).     

基于小生境遗传算法的粒子滤波算法

重采样是解决粒子滤波退化问题的主要方法,重采样的基本思想是采取复制保留权值较高的粒子,删除权值较低的粒子,而这导致了粒子多样性的减弱,特别是在样本受限条件下,甚至导致滤波发散。针对上述问题,提出改进的粒子滤波算法,将Mean Shift与粒子滤波融合,在重采样部分引入小生境遗传算法,提高粒子的多样性,避免粒子退化。实验表明,改进后的算法状态估计精度更高,效果更好。     

一种新的自适应小生境粒子群优化算法

为了克服基本粒子群算法过早收敛的缺陷,提出了一种新的自适应小生境粒子群优化算法.首先,让整个粒子群进行独立地演化寻优,以构造小生境环境.同时,通过设定合适的信息共享周期,以实现各个粒子搜索信息的共享,指导粒子向全局最优位置的搜索.最后,通过几个典型的多峰测试函数,对算法进行了仿真验证.结果表明,在算法的收敛性、寻优性等方面,算法均达到了良好的效果.     

一种改进的小生境多目标粒子群优化算法

提出一种小生境多目标粒子群优化算法。使用环邻域拓扑且无需任何小生境参数,克服常规小生境技术中需确定小生境参数的困难。采用NSGA-II的非支配排序策略和动态加权方法选择最优粒子。基于拥挤度的变异操作引导粒子跳出局部最优,增强算法的全局搜索能力。通过对ZDT1~ZDT4和ZDT6的测试结果表明,与经典的多目标进化算法NSGA-II、PESA-II和MOPSO相比,该算法在最优解集的收敛度与多样性方面具有明显的优势。     

基于改进小生境粒子群算法的多模函数优化

在基于粒子群算法的多模优化问题中,针对现存小生境方法需要特定参数的缺陷,提出了一种不需要参数的小生境算法。该算法通过粒子适应度在种群适应度中所占比例以及粒子之间的欧式距离两方面因素确定粒子的局部最优解,并通过每轮迭代中每个局部最优解粒子和以它作为局部最优解的普通粒子的欧式距离的平均值确定出该小生境的半径。在几个广泛的测试函数上的实验结果表明,该算法在收敛速度和成功率方面比需要小生境参数的算法(FERPSO、SPSO)更优秀。     

基于小生境粒子群算法的图像分割方法

为了得到分割图像的最佳阈值,提出了一种基于小生境粒子群算法的图像分割方法。小生境粒子群算法通过划分小生境的方法,保持了物种的多样性,克服了粒子群算法容易陷入局部解,后期收敛速度慢的缺点,提高了算法的全局寻优能力。该方法基于最大类间方差阈值分割技术,用小生境粒子群算法对适应度函数进行优化,得到最佳阈值,并用该阈值对图像进行分割。实验结果表明,与最大类间方差法,基于基本粒子群算法的最大类间方差分割法相比,所提出的方法不仅能得到理想的分割结果,而且分割速度也得到了提高。     

A self-organized speciation based multi-objective particle swarm optimizer for multimodal multi-objective problems

This paper proposes a self-organized speciation based multi-objective particle swarm optimizer (SS-MOPSO) to locate multiple Pareto optimal solutions for solving multimodal multi-objective problems. In the proposed method, the speciation strategy is used to form stable niches and these niches/subpopulations are optimized to search and maintain Pareto-optimal solutions in parallel. Moreover, a self-organized mechanism is proposed to improve the efficiency of the species formulation as well as the performance of the algorithm. To maintain the diversity of the solutions in both the decision and objective spaces, SS-MOPSO is incorporated with the non-dominated sorting scheme and special crowding distance techniques. The performance of SS-MOPSO is compared with a number of the state-of-the-art multi-objective optimization algorithms on fourteen test problems. Moreover, the proposed SS-MOSPO is also employed to solve a real-life problem. The experimental results suggest that the proposed algorithm is able to solve the multimodal multi-objective problems effectively and shows superior performance by finding more and better distributed Pareto solutions.     

A hybrid niching PSO enhanced with recombination-replacement crowding strategy for multimodal function optimization

This paper presents a hybrid niching algorithm based on the PSO to deal with multimodal function optimization problems. First, we propose to evolve directly both the particle population and memory population (archive population), called the P&A pattern, to enhance the efficiency of the PSO for solving multimodal optimization functions, and investigate illustratively the niching capability of the PSO and the PSO_P&A. It is found that the global version PSO is disable, but the local version PSO_P&A is able, to niche multiple species for locating multiple optima. Second, the recombination-replacement crowding strategy that works on the archive population is introduced to improve the exploration capability, and the hybrid niching PSO_P&A (HN-PSO_P&A) is developed. Finally, experiments are carried out on multimodal functions for testing the niching efficiency and scalability of the proposed method, and it is verified that the proposed method has a sub-quadratic scalability with dimension in terms of fitness function evaluations on specific MMFO problems.     

基于二阶插值滤波的粒子滤波改进算法研究

粒子退化等问题严重制约了粒子滤波的工程应用,通过对粒子滤波的分析与总结,提出一种基于二阶插值滤波的粒子滤波改进算法,利用二阶插值滤波器计算出更优的重要性函数,从而有效抑制粒子滤波的退化,降低了计算量,通过对导弹再入时的非线性导航参数估计问题进行实例仿真分析,所得结果验证了该算法的有效性.     

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.     

用于目标跟踪的智能群体优化滤波算法

针对目标跟踪中的状态估计，提出一种智能群体优化滤波算法。算法在贝叶斯滤波的基础上，运用智能群体优化的3种运动模型估计目标的后验状态，其中内聚运动在保持了粒子多样性的情况下增加了样本的权值，分离运动和排列运动相协调能够更加准确地预测下一时刻目标的先验状态。实验结果表明:与标准粒子滤波相比，该算法能够更加准确地估计非线性系统中的后验状态，在复杂多变的场景环境中，表现出更高的跟踪准确性。     

嵌入局部一维搜索技术的混合粒子群优化算法*

通过将粒子群优化算法(PSO)与经典局部一维搜索技术相结合,提出一种嵌入局部一维搜索技术的混合粒子群优化算法(LLS-PSO)。该算法在基本粒子群优化算法中引入一维搜索技术,选取最优粒子进行局部一维搜索,增强了在最优点附近的局部搜索能力,以加快算法的收敛速度。对三个经典复杂优化问题进行数值实验,并与基本PSO算法进行比较。实验分析和结果表明,LLS-PSO具有更好的优化性能。     

基于粒子进化的多粒子群优化算法

提出了一种基于粒子进化的多粒子群优化算法。该算法采用局部版的粒子群优化方法,多个粒子群彼此独立地搜索解空间,从而增强了全局搜索能力;利用重置进化粒子位置的方法使陷入局部值的粒子摆脱局部最小,从而有效地避免了"早熟"问题,提高了算法的稳定性。对3个测试函数进行了对比实验,结果表明该算法优于标准粒子群算法。     

A hybrid algorithm based on particle swarm and chemical reaction optimization

In this paper, a hybrid method for optimization is proposed, which combines the two local search operators in chemical reaction optimization with global search ability of for global optimum. This hybrid technique incorporates concepts from chemical reaction optimization and particle swarm optimization, it creates new molecules (particles) either operations as found in chemical reaction optimization or mechanisms of particle swarm optimization. Moreover, some technical bound constraint handling has combined when the particle update in particle swarm optimization. The effects of model parameters like InterRate, γ, Inertia weight and others parameters on performance are investigated in this paper. The experimental results tested on a set of twenty-three benchmark functions show that a hybrid algorithm based on particle swarm and chemical reaction optimization can outperform chemical reaction optimization algorithm in most of the experiments. Experimental results also indicate average improvement and deviate over chemical reaction optimization in the most of experiments.     

Swarm intelligence in intrusion detection: A survey

Intrusion Detection Systems (IDS) have nowadays become a necessary component of almost every security infrastructure. So far, many different approaches have been followed in order to increase the efficiency of IDS. Swarm Intelligence (SI), a relatively new bio-inspired family of methods, seeks inspiration in the behavior of swarms of insects or other animals. After applied in other fields with success SI started to gather the interest of researchers working in the field of intrusion detection. In this paper we explore the reasons that led to the application of SI in intrusion detection, and present SI methods that have been used for constructing IDS. A major contribution of this work is also a detailed comparison of several SI-based IDS in terms of efficiency. This gives a clear idea of which solution is more appropriate for each particular case.