A study on Solving Unbounded Knapsack Problem Based on Adaptive Genetic Algorithm
碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 95 === The Knapsack problem is an NP-Complete problem. Unbounded Knapsack problems are more complex and harder to solve than the general Knapsack problem. In this thesis, we apply the genetic algorithm using adaptive mechanism which includes greedy method to arrange th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/16649717016724242659 |