| Article ID: | iaor20081976 |
| Country: | China |
| Volume: | 27 |
| Issue: | 1 |
| Start Page Number: | 16 |
| End Page Number: | 19 |
| Publication Date: | Jan 2006 |
| Journal: | Journal of Huaqiao University |
| Authors: | Song Haizhou, Wei Xuzhen |
| Keywords: | programming: integer |
A value density is designed for 0–1 knapsack problem and on this basis, a hybrid genetic algorithm is proposed for solving 0–1 knapsack problem. Compared with conventional method and single genetic algorithm on the basis of large quantity of numerical experiments, as shown by experimental results, this algorithm is very effective.