0-1 knapsack problem is a typical combinatorial optimization question in the design and analysis of algorithms. The mathematical description of the knapsack problem is given in theory. The 0-1 knapsack problem is solved by ant colony optimistic algorithm that is improved by introducing genetic operators. To solve the 0-1 knapsack problem with the improved ant colony algorithm, experimental results of numerical simulations, compared with greedy algorithm and dynamic programming algorithm, have shown obvious advantages in efficiency and accuracy on the knapsack problem.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2011) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: