摘要:
粒子群优化算法(Particle swarm optimizer, PSO)是一种基于群体智能的优化方法. 本文提出了标准粒子群优化方法按迭代时间展开的一般性描述公式. 在此基础上分析了标准PSO的优化机理, 基于群体社会信息和自身历史经验的情况下,推导了粒子最大搜索空间的数学描述. 通过将粒子运动的一般性描述图解为历史状态加权和的形式, 进一步证明了PSO参数随迭代周期的积累, 在概率意义上的遗忘特性. 分析表明在经过一定周期的搜索后, 标准PSO方法同Barebones粒子群方法(Barebones particle swarm, BBPS)具有近似的搜索机制.从信息传递的角度, PSO的搜索策略是一种在概率意义上具有遗忘特性的历史信息加权求和的结果. 本文的研究结果对标准粒子群算法的一些重要性质(如:遗忘特性、标准PSO与BBPS间的相似性等)进行了合理解释.
Abstract:
Particle swarm optimizer (PSO), a swarm intelligence based optimization technique, is described by a general formula in terms of iterations in the paper. Based on the general formula, its optimization mechanism is analyzed and the general mathematic description of particle's maximum covering space is deduced according to the current social information and personal experience. Furthermore, the general formula is illustrated as the weighted summation of historical position states, so as to prove that in terms of cumulative iterations, parameters of PSO have an inherent forgetting characteristic in probability, moreover the searching mechanisms of canonical PSO and Barebones particle swarm are almost the same. From the perspective of information propagation, the strategy of PSO is a weighted summation of the historical information, which has the forgetting characteristic in probability. Some important properties of canonical PSO, such as forgetting characteristic, similarity between canonical PSO and BBPS, etc, are explained by the results of the research in this paper.