计算机工程与应用Issue(16)：35-39,5.DOI:10.3778/j.issn.1002-8331.1212-0086
一种自适应相位旋转的二进制量子蚁群算法
Binary Quantum Ant Colony Algorithm based on adaptive phase rotation
洪超 1李飞2
作者信息
- 1. 南京邮电大学 通信与信息工程学院，南京 210003
- 2. 南京邮电大学 信号处理与传输研究院，南京 210003
- 折叠
摘要
Abstract
Based on the theory of quantum evolution and ant colony optimization strategy, combined with a binary quantum ant colony algorithm, this paper proposes a novel quantum ant colony algorithm based on adaptive phase rotation(BQACO). The al-gorithm uses the probability amplitude of quantum bits to represent the ant colony pheromone, uses a pseudo-random selection policy to achieve the moving of the position, based on the adaptive phase rotation strategy and the mutating operation, the phero-mone is dynamically updated and the probability of premature convergence is reduced. To test the new algorithm’s optimization performance, a research based on benchmark functions is conducted. The result indicates that the BQACO has a stronger ability of global optimization and higher convergence speed than binary coded quantum ant colony algorithm and continuous quantum ant colony algorithm.关键词
量子进化计算/量子蚁群算法/量子旋转门/自适应相位/二进制编码Key words
quantum evolution algorithm/quantum ant colony algorithm/quantum rotation gate/adaptive phase/binary coded分类
信息技术与安全科学引用本文复制引用
洪超,李飞..一种自适应相位旋转的二进制量子蚁群算法[J].计算机工程与应用,2013,(16):35-39,5.
