混合粒子群算法的软件测试数据自动生成

针对全连接拓扑结构的粒子群算法在生成测试数据过程中,存在收敛精度低,易陷入局部极值的问题,提出一种混合粒子群算法HPSO,并将其应用于测试数据自动生成。该算法在保证全局收敛性的前提下,对多样性匮乏的种群,首先采用定长环形拓扑结构取代粒子群的全连接拓扑结构;其次,采用轮盘赌方法选择候选解,更新粒子位置信息和速度信息;最后引入条件禁忌算法,对处于局部极值的粒子采取禁忌处理。通过实验比较表明:与基本粒子群算法(BPSO)相比,HPSO使种群多样性得到大幅度提升;在测试数据生成性能上,HPSO的搜索成功率和路径覆盖率均优于遗传算法与粒子群算法混合算法GA-PSO,而平均耗时与BPSO算法相当,性能表现优越。     

基于改进粒子群算法的机械臂能耗轨迹优化

针对工业机器人能耗轨迹优化问题,提出了一种基于金字塔层拓扑结构的粒子群算法。该算法引入了金字塔层式的拓扑结构,将粒子进行排序、分层,从而改进算法的竞争策略,增加了种群多样性;引入了新的合作策略以更新粒子的速度和位置;引入胜利百分比来自适应地调整粒子群算法的权重系数,提高了粒子的搜索效率。为了验证该算法的有效性,在测试函数集上进行了测试,并与其他八种变体粒子群算法进行比较,其结果表明所提出的算法性能具有显著优势。最后将该算法应用到工业机器人轨迹规划中,仿真实验表明该算法能有效求解机器人的能耗最优轨迹,机器人的能耗明显减低,且满足工业机器人的运动学及动力学约束。     

Attractive and Repulsive Fully Informed Particle Swarm Optimization based on the modified Fitness Model

A novel Attractive and Repulsive Fully Informed Particle Swarm Optimization based on the modified Fitness Model (ARFIPSOMF) is presented. In ARFIPSOMF, a modified fitness model is used as a self-organizing population structure construction mechanism. The population structure is gradually generated as the construction and the optimization processes progress asynchronously. An attractive and repulsive interacting mechanism is also introduced. The cognitive and the social effects on each particle are distributed by its ‘contextual fitness’ value \(F\). Two kinds of experiments are conducted. Results focusing on the optimization performance show that the proposed algorithm maintains stronger diversity of the population during the convergent process, resulting in good solution quality on a wide range of test functions, and converge faster. Moreover, the results concerning on topologic characteristics of the population structure indicate that (1) the final population structures developed by optimizing different test functions differ, which is an important for improving ARFIPSOMF performance, and (2) the final structures developed by optimizing some test functions exhibit scale-free property approximately.     

加权无标度网络病毒传播和局部免疫策略研究

为了进一步描述现实生活中复杂网络的病毒传播问题,改进加权无标度网络模型的传统构造方法,考虑流量带宽和个体抵抗力两个重要因子,利用平均场理论模拟仿真病毒传播过程,对实验数据进行分析,验证该模型的有效性.现实生活中往往只能了解复杂网络的局部拓扑信息,传统病毒免疫策略大多基于全局拓扑信息,在仅了解局部信息的前提下,提出加权无标度网络中基于局部最优的病毒免疫策略,通过动态模拟病毒传播的免疫仿真实验,与随机免疫策略和目标免疫策略对病毒传播影响进行比较,验证局部最优免疫策略的有效性.     

一种快速多种群的粒子群多模优化算法

针对粒子群多模优化问题中存在的易早熟、收敛速度慢及寻优精度低等问题,提出了一种快速多种群的粒子群多模优化算法。首先采用动态半径及种群划分策略,避免了多种群区域重叠问题;然后引入拓扑机制,使种群内粒子在速度上保持同步,以群落为单位在解空间上飞行,加快进化速度;同时增加种群之间的交流,在多样性和快速收敛之间达到平衡;最后采用随机权重、异步变化因子及种群淘汰策略,提高算法的搜索能力和学习能力。通过几个典型测试函数的实验结果表明,该算法具有较好的多模态寻优率,在收敛速度和精度等方面均有提高。     

基于KRTG的动态拓扑结构的粒子群算法研究

标准的粒子群优化算法作为一种随机全局搜索算法,因其在种群中传播速度过快,易陷入局部最优解。基于KRTG的动态拓扑结构的粒子群算法（KRTGPSO）,从粒子间的拓扑结构出发,动态地调整种群的拓扑结构,增加种群的多样性,使算法收敛于全局最优解。通过测试函数以及与其他算法的比较,并通过实验表明,该算法在收敛速度与数据精度上收到了满意的效果。     

Cellular particle swarm optimization

This paper proposes a cellular particle swarm optimization (CPSO), hybridizing cellular automata (CA) and particle swarm optimization (PSO) for function optimization. In the proposed CPSO, a mechanism of CA is integrated in the velocity update to modify the trajectories of particles to avoid being trapped in the local optimum. With two different ways of integration of CA and PSO, two versions of CPSO, i.e. CPSO-inner and CPSO-outer, have been discussed. For the former, we devised three typical lattice structures of CA used as neighborhood, enabling particles to interact inside the swarm; and for the latter, a novel CA strategy based on “smart-cell” is designed, and particles employ the information from outside the swarm. Theoretical studies are made to analyze the convergence of CPSO, and numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on benchmark test functions.     

混沌动态种群数粒子群优化算法

针对粒子群优化算法在整个迭代过程中粒子极易陷于局部极值区域,提出一种混沌动态粒子数的粒子群优化算法,也即在判定全局最优值处于停滞时,以混沌策略对粒子进行位置初始化后加入种群,从而有效地保证了粒子群的多样性。用4个测试函数验证了该算法具有很好的寻优能力和较高的搜索精度。     

压缩因子综合信息粒子群算法

在群体智能算法中个体种群的多样性在进化后期逐渐消失,个体趋同性增加,因此粒子群算法的主要缺点是容易陷入局部最优值。提出了一种新的改进粒子群算法,该算法结合了压缩因子和综合信息策略,其中压缩因子可以平衡粒子群算法中的局部和全局搜索,综合信息可以较好地加强种群的多样性。改进后的粒子群算法与基本粒子群算法、自适应粒子群算法和压缩因子粒子群算法在7个测试函数上分别进行了精度对比测试、成功概率测试和收敛速度测试,结果表明新算法获得了较高的搜索精度和较快的收敛速度。     

一种动态调整惯性权重的粒子群优化算法

针对粒子收敛速度慢、搜索精度不高和算法性能在很大程度上依赖于参数的选取等缺点,提出了一种非线性指数惯性权重粒子群优化算法(Exponential Inertia Weight in Particle Swarm Optimization,EIW-PSO)。在每次迭代的过程中, 采用粒子最大适应值和最小适应值的指数函数来动态调整 算法中的惯性权重,更有利于算法在寻优过程中跳出局部最优;同时,引入随机因子以确保种群的多样性,使粒子更快地收敛到全局最优位置。为了验证该算法的寻优性能,通过8个基准测试函数将标准PSO、线性递减惯性权重LDIW-PSO、均值自适应惯性权重MAW-PSO在不同维度和种群规模下进行测试比较。实验结果表明,提出的EIW-PSO算法具有更快的收敛速度和更高的求解精度。     

混合拓扑结构的粒子群算法及其在测试数据生成中的应用研究

粒子群算法(PSO)的拓扑结构是影响算法性能的关键因素,为了从根源上避免粒子群算法易陷入局部极值及早熟收敛等问题,提出一种混合拓扑结构的粒子群优化算法(MPSO)并将其应用于软件结构测试数据的自动生成中。通过不同邻域拓扑结构对算法性能影响的分析,采用一种全局寻优和局部寻优相结合的混合粒子群优化算法。通过观察粒子群的多样性反馈信息,对每一代种群粒子以进化时选择全局拓扑结构模型(GPSO)或局部拓扑结构模型(LPSO)的方法进行。实验结果表明,MPSO使得种群的多样性得到保证,避免了粒子群陷入局部极值,提高了算法的收敛速度。     

Comparison of simple diversity mechanisms on plateau functions

It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no rigorous analysis pointing out how different diversity mechanisms influence the runtime behavior. We consider evolutionary algorithms that differ from each other in the way they ensure diversity and point out situations where the right mechanism is crucial for the success of the algorithm. The considered evolutionary algorithms either diversify the population with respect to the search points or with respect to function values. Investigating simple plateau functions, we show that using the “right” diversity strategy makes the difference between an exponential and a polynomial runtime. Later on, we examine how the drawback of the “wrong” diversity mechanism can be compensated by increasing the population size.     

基于信息分享机制的粒子滤波算法及其在视觉跟踪中的应用

针对基本粒子滤波方法存在的权值退化和计算效率低问题,提出了一种基于信息分享机制的粒子滤波算法.该方法将粒子群优化算法和蚁群优化算法的优化思想共同作用到粒子更新中,实现粒子之间信息共享,从而增强粒子的多样性和最优估计能力.同时分析了该算法的收敛性.视觉跟踪实验表明,该算法能用较少的粒子实现单目标和多目标跟踪,综合跟踪性能优于基本粒子滤波和基于粒子群优化的粒子滤波方法,验证了本算法的有效性.     

基于博弈机制的多目标粒子群优化算法

为改善多目标粒子群算法存在优化解的多样性不足和算法的收敛性问题,提出一种基于博弈机制的多目标粒子群优化算法。使用博弈机制,无需外部储备集,通过非占优排序和拥挤距离选出一部分优秀的粒子,从这些优秀的粒子中随机选择一个作为全局最优粒子,有效提升算法的收敛性和种群的多样性。算法初期使用多尺度混沌变异策略,避免算法陷入局部最优。通过与6个多目标算法在3个系列标准测试函数上进行比较,验证了该算法所得解分布性较好,能快速收敛到真实Pareto前端。     

一种新型的多种群微粒群算法

针对微粒群算法容易出现早熟问题,提出一种动态种群与子群混合的微粒群算法（SPSDPSO）。该算法在微粒群搜索停滞时对微粒进行分群,在子群内部通过微粒随机初始化以及个体替代策略提高优化性能,在子群进化一定代数后重新混合为一个种群继续优化,种群进化与子群进化交替进行直至满足算法终止条件。SPSDPSO的种群与子群混合进化策略增强了群体多样性,并且使得子群体之间能够进行充分的信息交流。收敛性分析表明,SPSDPSO以概率1收敛到全局最优解。函数测试结果表明,新算法的全局收敛性能有了显著提高。     

An improved GA and a novel PSO-GA-based hybrid algorithm

Inspired by the natural features of the variable size of the population, we present a variable population-size genetic algorithm (VPGA) by introducing the “dying probability” for the individuals and the “war/disease process” for the population. Based on the VPGA and the particle swarm optimization (PSO) algorithms, a novel PSO-GA-based hybrid algorithm (PGHA) is also proposed in this paper. Simulation results show that both VPGA and PGHA are effective for the optimization problems.     

Task Scheduling in Distributed Systems Using Heap Intelligent Discrete Particle Swarm Optimization

The optimal mapping of tasks to the processors is one of the challenging issues in heterogeneous computing systems. This article presents a task scheduling problem in distributed systems using discrete particle swarm optimization (DPSO) algorithm with various neighborhood topologies. The DPSO is a recent metaheuristic population‐based algorithm. In DPSO, the set of particles in a swarm flies through the N‐dimensional search space by learning from both the personal best position and a neighborhood best position. Each particle inside the swarm belongs to a specific topology for communicating with neighboring particles in the swarm. The neighborhood topology affects the performance of DPSO significantly, because it determines the rate at which information transmits through the swarm. The proposed DPSO algorithm works on dynamic topology that is binary heap tree for communication between the particles in the swarm. The performance of the proposed topology is compared with other topologies such as star, ring, fully connected, binary tree, and Von Neumann. The three well‐known performance measures such as Makespan, mean flow time, and reliability cost are used for the comparison of the proposed topology with other neighborhood topologies. Computational simulation results indicate that the performance of DPSO algorithm has shown significant improvement with binary heap tree topology used for communication among the particles in the swarm.     

加权无标度网络病毒传播控制中带粒子群优化的免疫策略

为有效解决加权无标度网络中的病毒传播控制问题,基于图分割思想,同时考虑子网络规模和子网络节点的强度和两个优化目标,引入遗传算法的变异和交叉算子以提高种群多样性并避免算法过早陷入局部最优解,进而提出一种带粒子群优化的免疫策略.仿真实验结果表明所提免疫策略比目前公认高效的目标免疫策略效果更好,可通过免疫指定数量的节点,较好地将网络分割成节点个数尽可能少、节点强度和尽可能小的子网络.     

嵌入列维变异的混合动态粒子群算法

针对标准粒子群优化算法易陷入局部最优、收敛精度不高的问题,提出一种嵌入列维变异的混合动态粒子群算法（DLPSO）。算法在进化过程中采用动态拓扑Dbest策略以降低粒子趋同性,每次迭代时根据解的好坏将粒子分为全局最优粒子、探索粒子及无目标粒子,并对探索粒子进行分簇,簇内粒子的更新受到全局最优粒子及簇内最优粒子的共同影响;为确保粒子多样性,平衡局部搜索与全局搜索,采用免疫机制与自适应列维变异相结合的方式对粒子进行变异。利用7个测试函数对算法进行性能评价,数值仿真结果表明该算法搜索精度高且稳定性好,具有良好的收敛性能。     

具有拓扑时变和搜索扰动的混合粒子群优化算法

粒子群优化（PSO）算法在求解复杂多峰函数时极易早熟,陷入局部最优无法跳出。研究表明改变粒子间的拓扑结构和调整算法的迭代机制有助于改善种群的多样性,提高算法的寻优能力。因此,提出一种具有拓扑时变和搜索扰动的混合粒子群优化（HPSO-TS）算法。该算法采用K-medoids聚类算法对粒子群进行动态分簇,形成多个异构子群,以利于子群内粒子间进行信息流通。在速度更新中,增加簇最优粒子的引导,并引入非线性变化极值扰动,帮助粒子搜索更多的区域。而后在位置迭代中引入花授粉算法（FPA）中的转换概率,使粒子在全局搜索和局部搜索之间转换。在全局搜索时结合狮群算法中的母狮觅食机制对粒子的位置进行更新;在局部搜索时引入正弦扰动因子,帮助粒子跳出局部最优。实验结果表明所提算法在求解精度和鲁棒性方面明显优于FPA、PSO、改进粒子群算法（IPSO）、具有动态拓扑结构的粒子群算法（PSO-T）;并且随着测试维度和次数的增加,这种优势更加明显。HPSO-TS算法所引入的拓扑时变策略和搜索扰动机制能有效地提高种群的多样性和粒子的活性,从而改善寻优能力。