Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm

2006 ◽  
Author(s):  
Hanxiao Shi
Keyword(s):  
Knapsack Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Improved Ant Colony Algorithm

Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators

2011 ◽  
Vol 230-232 ◽  
pp. 973-977 ◽  
Author(s):  
Zhi Jun Hu ◽  
Rong Li
Keyword(s):  
Knapsack Problem ◽  
Ant Colony Algorithm ◽  
Analysis Of Algorithms ◽  
Dynamic Programming Algorithm ◽  
Ant Colony ◽  
Programming Algorithm ◽  
Ant Colony Optimization Algorithm ◽  
Genetic Operators ◽  
Optimistic Algorithm ◽  
Improved Ant Colony Algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document