量子行为粒子群优化中多样性的分析与控制
Analyzing and controlling diversity in quantum-behaved particle swarm optimization
AI总结:
本文针对量子行为粒子群优化(QPSO)定义基因型与表现型多样性,发现到平均点距离多样性与搜索性能关联更强,并提出两种多样性控制策略以提升算法搜索能力。
摘要:
本文研究量子行为粒子群优化(QPSO)中种群多样性的控制与分析问题。QPSO 是一种受量子力学概念和粒子群优化(PSO)启发的优化方法。为了深入理解多样性在演化过程中的作用,我们首先为 QPSO 定义了基因型多样性和表现型多样性:基因型多样性由粒子位置到平均点的距离度量,表现型多样性由适应度值度量。随后,在多个基准函数上测试并分析了这两类多样性与搜索性能之间的相关性,结果表明在演化过程中,到平均点距离多样性(distance-to-average-point diversity)与搜索性能具有更强的关联。最后,基于所进行的多样性分析,我们提出了两种控制到平均点距离多样性的策略,以提升 QPSO 算法的搜索能力。在 CEC 2005 基准测试套件的一组基准函数上,对引入多样性控制方法的 QPSO 进行了实证研究,并将所提方法的性能与原始 QPSO 及其他 PSO 变体进行了评估和比较。
英文摘要:
This paper addresses the issues of controlling and analyzing the population diversity in quantum-behaved particle swarm optimization (QPSO), which is an optimization approach motivated by concepts in quantum mechanics and PSO. In order to gain an in-depth understanding of the role the diversity plays in the evolving process, we first define the genotype diversity by the distance to the average point of the particles' positions and the phenotype diversity by the fitness values for the QPSO. Then, the correlations between the two types of diversities and the search performance are tested and analyzed on several benchmark functions, and the distance-to-average-point diversity is showed to have stronger association with the search performance during the evolving processes. Finally, in the light of the performed diversity analyses, two strategies for controlling the distance-to-average-point diversities are proposed for the purpose of improving the search ability of the QPSO algorithm. Empirical studies on the QPSO with the introduced diversity control methods are performed on a set of benchmark functions from the CEC 2005 benchmark suite. The performance of the proposed methods are evaluated and compared with the original QPSO and other PSO variants.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。