保持多样性的自适应动态粒子群算法及其应用

Adaptive Dynamic Particle Swarm Algorithm with Diversity Preservation and Its Application

针对动态环境中的种群多样性问题,提出一种保持种群多样性的双子群粒子群优化算法。将群搜索算法中的游走者思想引入到粒子群优化算法中,基于群体多样性,子种群B采用不同的方法更新速度和位置,子种群A和子种群B交换最优信息,扩展种群的搜索范围,增强整个群体的多样性水平。将改进的算法应用于复杂变化的抛物线函数和群体动画的跟随效果中,结果表明该算法在动态环境中的有效性,并能够真实模拟群体跟随行为。

A double population particle swarm optimization with adaptive diversity preservation is proposed considering the population diversity in dynamic environment. The ranger idea of group search is introduced to particle swarm optimization, where subswarm B updates its speeds and positions with different methods according to the diversity of particle swarm and subswarm A and B exchange their optima. These mechanisms extend the search range and improve the swarm diversity. The scheme is tested on benchmark functions with dynamic complex changes and the simulation results show the proposed algorithm is effective in dynamic environments. It is also used to simulate group following behavior.