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

@article{Shi2006SolutionT0,
  title={Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm},
  author={Hanxiao Shi},
  journal={2006 IEEE International Conference on Information Acquisition},
  year={2006},
  pages={1062-1066}
}
  • Hanxiao Shi
  • Published 2006 in
    2006 IEEE International Conference on Information…
Ant colony algorithms analogize the social behaviour of ant colonies, they are a class of meta-heuristics which are inspired from the behavior of real ants. It was applied successfully to the well-known traveling salesman problem and other hard combinational optimization problems. In order to apply it to the classical 0/1 knapsack problem, this paper compares the difference between the traveling salesman problem and the 0/1 knapsack problem and adapts the ant colony optimization (ACO) model to… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…