Abstract: The neighborhood topology’s influence on the performance of a PSO is analyzed.Two methods to generate dynamic neighborhood are proposed.Based on a representative set of benchmark functions，the proposed scheme is tested.The result of numerical experiments demonstrate that the performance of a particle swarm depends on population topology as well as algorithm version.

Key words: particle swarm optimization, dynamic neighborhood, generating method

摘要： 研究了邻域拓扑结构对粒子群算法性能的影响。设计了两种动态邻域生成策略，并基于一组具有代表性的测试函数，对两种典型的算法模型——标准的粒子群算法（CPSO）和充分联系的粒子群算法（FIPS）进行实验。实验结果表明，不同的邻域拓扑结构和不同的算法模型都能够影响粒子群算法的性能。

关键词: 粒子群, 动态邻域, 生成策略