摘要
Knapsack problem is one kind of NP-Complete problem. Unbounded knapsack problems are more complex and harder than general knapsack problem. In this paper,we apply QGAs (Quantum Genetic Algorithms) to solve unbounded knapsack problem and then follow other procedures. First,present the problem into the mode of QGAs and figure out the corresponding genes types and their fitness functions. Then,find the perfect combination of limitation and largest benefit. Finally,the best solution will be found. Primary experiment indicates that our method has well results.
Knapsack problem is one kind of NP-Complete problem. Unbounded knapsack problems are more complex and harder than general knapsack problem. In this paper, we apply QGAs （ Quantum Genetic Algorithms） to solve unbounded knapsack problem and then follow other procedures. First, present the problem into the mode of QGAs and figure out the corresponding genes types and their fitness functions. Then, find the perfect combination of limitation and largest benefit. Finally, the best solution will be found. Primary experiment indicates that our method has well results.
出处
《中国管理信息化》
2009年第15期57-60,共4页
China Management Informationization
关键词
背包问题
信息化建设
遗传算法
量子学
Quantum Genetic Algorithms
Knapsack Program
Optimization Problems
