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 k...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.
