基于线图与PSO的网络重叠社区发现

从优化模块度的角度出发,引入线图理论,给出线图的硬划分与原 图的有重叠划分相对应的理论证明, 提出了一种基于线图与粒子群优化技术的网络重叠社区发现算法(Communities discovery based on line graph and particle swarm optimization, LGPSO), 该方法通过粒子群优化 (Particle swarm optimization, PSO)算法寻找网络对应线图的最优划分来发现网络重叠社区, 实验结果显示,该方法能够在无先验信息的条件下快速有效地揭示网络的重叠社区结构.     

网络社区发现的多目标分解粒子群优化算法

通过分析社会网络中社区发现问题的优化目标,构造了社区发现的多目标优化模型,提出一种网络社区发现的多目标分解粒子群优化算法。该算法采用切比雪夫法将多目标优化问题分解为多个单目标优化子问题,使用粒子群优化(PSO)算法对社区结构进行挖掘,并引入了一种新颖的基于局部搜索的变异策略以提高算法的搜索效率和收敛速度,该算法克服了单目标优化算法存在的解单一以及难以发现社区层次结构的缺陷。人工网络及真实网络上的实验结果表明,该算法能够快速准确地挖掘网络社区并揭示社区的层次结构。     

基于EPSO-RVM的网络入侵检测模型

为了提高网络入侵检测的正确率,提出一种精英选择策略粒子群算法（EPSO）优化相关向量机（RVM）的网络入侵检测模型（EPSO-RVM）。将相关向量机的参数编码成粒子,将入侵检测正确率作为粒子群搜索的目标,通过粒子群算法对参数优化问题进行求解,并引入精英选择策略增强粒子群算法的全局搜索能力,根据最优参数建立基于RVM的入侵检测模型,采用KDD99数据集对其性能测试,结果表明,相对于对比模型,EPSO-RVM较好地解决了相关向量机参数优化难题,提高了网络入侵检测的正确率。     

一种改进的多目标粒子群优化算法及其应用

针对多目标粒子群优化算法在求解约束优化问题时存在难以兼顾收敛性能和求解质量这一问题,提出一种基于免疫网络的改进多目标粒子群优化算法.该算法通过免疫网络互通种群最优信息达到粒子群算法与人工免疫网络算法的协同搜索,同时给出了速度迁移策略、自适应方差变异策略和基于聚类的免疫网络策略.最后将所提出的方法应用于求解电弧炉供电优化模型,达到了减少电量消耗、缩短冶炼时间、延长炉衬使用寿命的目的,同时表明了该算法的有效性.     

基于粒子群算法的RBF网络参数优化算法

针对神经网络的一些缺陷,研究神经网络基于粒子群优化的学习算法,将粒子群优化算法用于RBF神经网络的学习训练。提出了一种基于粒子群优化（PSO）算法的径向基（RBF）网络参数优化算法,首先利用减聚类算法确定网络径向基函数中心的个数,再用PSO算法优化径向基函数的中心及宽度,最后用PSO算法训练隐含层到输出层的网络权值,找到神经网络权值的最优解,以达到优化神经网络学习的目的。最后,通过一个实验与最小二乘法优化的神经网络进行了比较,验证了算法的有效性。     

改进自适应粒子群算法在WSN覆盖优化中的应用

针对无线传感器网络（WSN）节点覆盖不均匀导致覆盖率低下的问题,提出了一种基于改进自适应粒子群优化算法的覆盖优化方法。首先,建立WSN覆盖优化的数学模型;然后将进化因子和聚合因子引入粒子群优化（PSO）算法中的惯性权重系数,使改进算法具有很强的自适应能力;接着在算法迭代过程中引入碰撞回弹策略保证粒子群的多样性,克服改进粒子群优化算法在优化后期容易陷入局部最优的弱点。实验表明,本文算法对WSN优化后的网络覆盖率均比其它文献算法提高了2%~6%,且传感器节点分布更加均匀。因此它能有效提高无线传感器网络的性能,是一种应用性较强的WSN覆盖优化算法。     

受限空间自适应区域栅格化的优化路径规划

针对障碍物分布复杂、存在封闭边界的受限空间,提出一种环境自适应区域栅格化的优化路径规划算法.该算法首先将环境自适应划分为区域栅格,并提出阻碍度指标降低搜索空间的维度以优化区域栅格的划分;然后结合随机变异和定向变异,给出一种可有效平衡搜索效率与精度矛盾的多维变异粒子群优化算法;最后使用最小二乘曲线拟合方法对优化路径予以平滑处理.与非线性递减惯性权值粒子群算法（NDW-PSO）及组合粒子群算法（C-PSO）对比的仿真结果验证了所提出算法的先进性.     

基于改进粒子群算法的WSN覆盖优化策略

为了实现WSN网络覆盖范围的最大化,延长网络寿命,本文在标准粒子群算法的基础上提出了一种无线传感器网络覆盖优化策略。通过粒子分簇并行搜索,采取碰撞理论使陷入局部最优的粒子迅速跳出,有效地避免了标准粒子群算法容易出现的“早熟”问题,提高了算法的稳定性。通过仿真实验分析了分簇数和碰撞阈值对覆盖性能指标的影响,仿真实验结果表明基于碰撞理论的分簇粒子群算法覆盖策略有效地优化了网络的覆盖性能。     

基于粒子群算法的Web社区发现

Web社区发现技术是提高网络搜索引擎检索质量的重要途径之一.如何给出利用较少先验信息,并能对网络进行高效划分的算法是网络社区发现的关键.传统算法如Wu-Huberman算法虽能对社区进行快速划分,但需先确定分属不同社区的两个节点,Radichi快速分裂算法依赖于网络中存在的三角形的数目,Duch J提出的极值优化算法对初始解非常敏感.本文提出一种基于粒子群优化算法的网络社区发现方法,并用不同规模的网络图Zachary、Krebs和dolphins网络结构对方法进行测试,实验结果表明,该方法在无先验信息的条件下,以较低的时间复杂度,快速、高效地完成对网络社区的划分.     

基于粒子群算法的无线传感网络覆盖优化策略

无线传感器网络覆盖控制是研究在保证服务质量条件下,为了实现网络覆盖范围的最大化.采用覆盖优化策略及算法的应用,有助于网络节点能量的有效控制、感知服务质最的提高和网络生存时间的延长.提出基于概率测量模型的粒子群优化策略,以网络有效覆盖率为优化目标,通过粒子群算法实现覆盖控制并详细分析了传感半径对覆盖性能的影响.仿真实验表明,粒子群优化策略的有效覆盖率达到了85.63%,能有效地实现无线传感网络覆盖优化.     

Abundance estimation of crossover double particle swarms optimization for hyperspectral remote sensing imagery

ABSTRACT

Hyperspectral unmixing (HU) is an important technique for extracting materials and their abundance in hyperspectral remote sensing imagery. The presence of nonlinear mixing of light on the ground poses a difficult problem when estimating abundance fractions of all pixels. This problem makes the foundation of algorithms that can adapt all types of nonlinear mixing on the ground more complex and challenged. In this paper, a new bionic intelligent algorithm named crossover double particle swarms optimization (CDPSO) has been presented to estimate abundance for hyperspectral remote sensing imagery. The reconstruction error is used as the objective function for HU based on multilinear mixing model, and the nonlinear unmixing is transformed into an optimization problem. By improving the optimization performance of PSO for HU, we embed two types of new strategies, including double particle swarms crossover and swarm re-initialization, respectively. Our experiments, conducted using both synthetic and real hyperspectral data, demonstrate that the proposed CDPSO algorithm can outperform other state-of-the-art unmixing methods.     

高维化工数据共轭粒子群算法处理

针对化工数据多为高维数据,而粒子群算法对求解高维优化问题易陷局部极值,提出将共轭方向法与粒子群算法相结合处理高维数据.当粒子群算法迭代了一定步数而陷入局部极值并得局部最优解χ*时,以χ*为初值,用共轭方向法对其求解,利用粒子群算法对低维优化问题的有效性,将得新的更优的当前最优解χ**,从而使算法跳出局部极值;在新极值的条件下,又用粒子群算法对原问题求解,如此反复直至结束.通过经典的测试函数对其测试,结果表明这一尝试是有效的.最后将算法用于SO2催化氧化反应动力学模型的非线性参数估计,获得满意效果.     

Conjugate direction particle swarm optimization solving systems of nonlinear equations

Solving systems of nonlinear equations is a difficult problem in numerical computation. For most numerical methods such as the Newton’s method for solving systems of nonlinear equations, their convergence and performance characteristics can be highly sensitive to the initial guess of the solution supplied to the methods. However, it is difficult to select a good initial guess for most systems of nonlinear equations. Aiming to solve these problems, Conjugate Direction Particle Swarm Optimization (CDPSO) was put forward, which introduced conjugate direction method into Particle Swarm Optimization (PSO)in order to improve PSO, and enable PSO to effectively optimize high-dimensional optimization problem. In one optimization problem, when after some iterations PSO got trapped in local minima with local optimal solution , conjugate direction method was applied with as a initial guess to optimize the problem to help PSO overcome local minima by changing high-dimension function optimization problem into low-dimensional function optimization problem. Because PSO is efficient in solving the low-dimension function optimization problem, PSO can efficiently optimize high-dimensional function optimization problem by this tactic. Since CDPSO has the advantages of Method of Conjugate Direction (CD) and Particle Swarm Optimization (PSO), it overcomes the inaccuracy of CD and PSO for solving systems of nonlinear equations. The numerical results showed that the approach was successful for solving systems of nonlinear equations.     

A particle swarm optimization based memetic algorithm for dynamic optimization problems

Recently, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are dynamic. This paper investigates a particle swarm optimization (PSO) based memetic algorithm that hybridizes PSO with a local search technique for dynamic optimization problems. Within the framework of the proposed algorithm, a local version of PSO with a ring-shape topology structure is used as the global search operator and a fuzzy cognition local search method is proposed as the local search technique. In addition, a self-organized random immigrants scheme is extended into our proposed algorithm in order to further enhance its exploration capacity for new peaks in the search space. Experimental study over the moving peaks benchmark problem shows that the proposed PSO-based memetic algorithm is robust and adaptable in dynamic environments.     

Frequency-domain Tuning of Robust Fixed-structure Controllers via Quantum-behaved Particle Swarm Optimizer with Cyclic Neighborhood Topology

This paper presents a constrained particle swarm optimization (PSO) algorithm with a cyclic neighborhood topology inspired by the quantum behavior of particles, and describes its application to the frequency-domain tuning of robust fixed-structure controllers. Two main methodologies for improving the exploration and exploitation performance of the PSO framework are described. First, a PSO scheme with a neighborhood structure based on a cyclic network topology is presented. This scheme enhances the exploration ability of the swarm and effectively reduces the probability of premature convergence to local optima. Second, the above PSO scheme is hybridized using a distributed quantum-principle-based offspring creation mechanism. Such a hybridized PSO framework enables neighboring particles to concentrate the search around the region covered by those particles to refine the candidate solution. A frequency-domain tuning method for fixed-structure controllers is then demonstrated. This method guarantees certain preassigned performance specifications based on the developed PSO technique. A typical numerical example is considered, and the results clearly demonstrate that the proposed PSO scheme provides a novel and powerful impetus with remarkable reliability for robust fixed-structure controller syntheses. Further, an experiment was conducted on a magnetic levitation system to compare the proposed strategy with a well-known frequency-domain tuning method implemented in the MATLAB tool for Structured H_∞ Synthesis. The comparative experimental results validate the effectiveness of the proposed tuning strategy in practical applications.     

Swarm intelligence-based extremum seeking control

This paper proposes an extremum seeking control (ESC) scheme based on particle swarm optimization (PSO). In the proposed scheme, the controller steers the system states to the optimal point based on the measurement, and the explicit form of the performance function is not needed. By measuring the performance function value online, a sequence, generated by PSO algorithm, guides the regulator that drives the state of system approaching to the set point that optimizes the performance. We also propose an algorithm that first reshuffles the sequence, and then inserts intermediate states into the sequence, in order to reduce the regulator gain and oscillation induced by population-based stochastic searching algorithms. The convergence of the scheme is guaranteed by the PSO algorithm and state regulation. Simulation examples demonstrate the effectiveness and robustness of the proposed scheme.     

动态环境中的Memetic算法

针对近几年在进化计算领域被广泛关注的动态优化问题,提出了一种基于粒子群优化(PSO)的Memetic算法.在一种环状拓扑结构的局部PSO模型中,利用模糊认知局域搜索策略来改善部分粒子的质量,同时引入一种自组织随机移民策略来保持算法的种群多样性.通过对一组标准动态测试问题的仿真实验,能够证明所提出的算法在动态环境中的有效性和适应能力.     

粒子群优化在图像最小误差阈值化中的应用

提出了一种基于粒子群优化（PSO）的图像最小误差阈值化方法。将粒子群优化算法应用于图像最小误差阈值化中,克服了常规最小误差阈值化计算量大的缺点。实验证明该算法能有效降低常规图像最小误差阈值化的计算量,与遗传算法相比,该方法有更好的收敛性和稳定性。     

离散微粒群算法求解批量流水线调度问题

提出了解决批量流水线调度问题的离散微粒群优化算法。该算法采用了基于工序的编码方式,设计了新的粒子生成公式,从而使微粒群算法可以直接应用于调度问题。同时,针对微粒群算法容易陷入局部最优的缺陷,将其与模拟退火算法结合,得到了改进的微粒群优化算法。仿真实验表明了上述算法的有效性。     

控制系统的辨识建模及微粒群优化设计

针对控制系统的传递函数建模与控制器的参数优化问题,提出了基于Prony和微粒群优化（PSO）算法的设计方案。首先在被控对象的输入端施加一个脉冲信号,然后对其输出信号进行Prony分析,得出该被控对象的传递函数,最后采用改进PSO算法进行控制器的参数优化设计。基于辨识的Prony算法可快速准确得出被控对象的传递函数;基于T-S模型模糊自适应的改进PSO算法（T-SPSO算法）依据种群当前最优性能指标和惯性权重自适应惯性权重取值,较好解决了PSO算法的早熟问题,可以更好地优化控制器参数。该方案实现了控制系统的精确建模与优化设计,仿真结果验证了所提方案的有效性。