| 一种解决组合优化问题的量子遗传算法QGA |
| |
| 引用本文： | 熊焰,陈欢欢,苗付友,王行甫.一种解决组合优化问题的量子遗传算法QGA[J].电子学报,2004,32(11):1855-1858. |
| |
| 作者姓名： | 熊焰 陈欢欢 苗付友 王行甫 |
| |
| 作者单位： | 中国科学技术大学计算机科学技术系,安徽合肥 230027 |
| |
| 基金项目： | 中国科学院知识创新工程项目，国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 本文在量子变异的基础上,提出了一种解决组合优化问题的量子遗传算法QGA,它融合了遗传量子算法GQA和经典遗传算法的优点,只用一个个体就可在很短的时间内搜索到最优解,并针对一个典型的组合优化问题——0/1背包问题进行了对比实验,实验结果表明本文所提出的量子遗传算法QGA优于传统遗传算法和遗传量子算法GQA.
|
| 关 键 词： | 量子计算 遗传算法 遗传量子算法 量子遗传算法 |
| 文章编号： | 0372-2112(2004)11-1855-04 |
| 收稿时间： | 2002-12-12 |
A Quantum Genetic Algorithm to Solve Combinatorial Optimization Problem |
| |
| XIONG Yan,CHEN Huan-huan,MIAO Fu-you,WANG Xing-fu.A Quantum Genetic Algorithm to Solve Combinatorial Optimization Problem[J].Acta Electronica Sinica,2004,32(11):1855-1858. |
| |
| Authors: | XIONG Yan CHEN Huan-huan MIAO Fu-you WANG Xing-fu |
| |
| Affiliation: | Dept.of Computer Science and Technology,University of Science and Technology of China,Hefei,Anhui 230027,China |
| |
| Abstract: | Based on quantum mutation, a quantum genetic algorithm (QGA) to solve combinatorial optimization problem is proposed.It has good features of genetic quantum algorithm (GQA) and traditional genetic algorithm,which can obtain the best solution with one chromosome in a short time.Comparing experiments have been conducted on a typical combinatorial optimization problem——0/1 knapsack problem.Experimental results have shown that the proposed quantum genetic algorithm is superior to genetic quantum algorithm and traditional genetic algorithm on performance. |
| |
| Keywords: | quantum computation genetic algorithm genetic quantum algorithm quantum genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
