Binary ant Colony Algorithm with congestion control strategy for the 0/1 Multiple Knapsack problems

Aiming at the characteristic of 0/1 Multiple Knapsack problem, congestion control strategy to Binary Ant Colony Algorithm was introduced, and Greedy algorithm was used to revise the illegal individuals that don´t satisfy the constraints, so as to a compound algorithm for 0/1 Multiple Knapsack problem was suggested. The simulation results to test Knapsack problems, which Zuse Institute Berlin proclaimed, show a good correctness and appropriateness, and all of them are better than the given results of test cases.