arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.16989cs.NEquant-ph
收藏

QPSO-CD:基于柯西分布的量子粒子群优化算法

QPSO-CD: Quantum-behaved Particle Swarm Optimization Algorithm with Cauchy Distribution

Amandeep Singh Bhatia, Mandeep Kaur Saggi, Shenggen Zheng, Soumya Ranjan Nayak

摘要:

受粒子群优化(PSO)和量子计算理论的启发,提出了一种基于柯西算子和自然选择机制的PSO量子变体(QPSO-CD)。提出的混合量子行为粒子群优化与柯西分布(QPSO-CD)的性能进行了研究,并与其同行的基础上一组基准问题进行了比较。此外,QPSO-CD被用于研究约束工程问题,以研究其适用性。进一步分析了QPSO-CD算法的正确性和时间复杂度,并与经典PSO算法进行了比较。事实证明,QPSO-CD有效地处理了这些现实生活中的问题,并可以在大多数问题中获得更好的解决方案。实验结果表明,结合柯西分布和自然选择策略的QPSO算法在稳定性和收敛性方面优于其他算法。

英文摘要:

Motivated by particle swarm optimization (PSO) and quantum computing theory, we have presented a quantum variant of PSO (QPSO) mutated with Cauchy operator and natural selection mechanism (QPSO-CD) from evolutionary computations. The performance of proposed hybrid quantum-behaved particle swarm optimization with Cauchy distribution (QPSO-CD) is investigated and compared with its counterparts based on a set of benchmark problems. Moreover, QPSO-CD is employed in well-studied constrained engineering problems to investigate its applicability. Further, the correctness and time complexity of QPSO-CD are analysed and compared with the classical PSO. It has been proven that QPSO-CD handles such real-life problems efficiently and can attain superior solutions in most of the problems. The experimental results showed that QPSO associated with Cauchy distribution and natural selection strategy outperforms other variants in the context of stability and convergence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑