一种带修复函数的QGA及其在背包问题中的应用  

A quantum genetic algorithm with repair function and its application in knapsack question

作　　者：朱筱蓉[1] 张兴华[1] 

机构地区：[1]南京工业大学自动化学院,江苏南京210009

出　　处：《计算机应用》2007年第5期1187-1190,共4页journal of Computer Applications

基　　金：江苏省教育厅自然科学基金资助项目(06-KJB-510040)

摘　　要：提出了一种带修复函数的量子遗传算法来求解背包问题。该算法采用量子比特概率编码方式构造染色体,由量子旋转门操作实现种群进化。在求解背包问题时,采用修复函数来修正不可行编码。文中给出了该算法的具体实现方法和流程,并用几个典型背包问题实例对其进行测试,结果表明带修复函数的量子遗传算法在求解背包问题时,综合性能优于传统遗传算法。A Quantum Genetic Algorithm （QGA） with repair function was proposed in this paper. This algorithm codes the chromosomes in the way of quantum bit probability, and makes the population evolve by the operation of quantum gate. When solving the knapsack question, repair function was used to repair unfeasible code. The implementation and procedure of this algorithm were introduced in detail in the paper. The test results of several typical knapsack questions show that this algorithm has better comprehensive performance than conventional genetic algorithm.

关 键 词：量子遗传算法 背包问题 修复函数 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]