一种改进的量子进化算法
n Improved Quantum-Inspired Evolutionary Algorithm
本文在提出一种改进的量子进化算法，通过概率编码简化量子位的表示，引入粒子群算法的优化策略，并对量子位的概率进行限幅，提高算法的全局搜索能力。通过0-1 背包问题的仿真实验表明，改进后的算法具有比原量子进化算法更好的性能。
In this paper, an improved quantum-inspired evolutionary algorithm is presented, in which quantum bit is simplified by coding with probability. By invoking strategy of PSO and limiting probabilities of quantum bits, the novel algorithm is improved in global research. Experiments on 0-1 knapsack problem shows that the novel algorithm performs better than the original algorithm.
何昭晖、章兢
计算技术、计算机技术
量子进化算法粒子群算法背包问题
quantum-inspired evolutionary algorithmparticle swam optimizationknapsack problem
何昭晖,章兢.一种改进的量子进化算法[EB/OL].(2010-02-05)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/201002-272.点此复制
评论