Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.

i-ant
.....\Debug
.....\.....\i-ant.exe
.....\.....\i-ant.ilk
.....\.....\i-ant.obj
.....\.....\i-ant.pch
.....\.....\i-ant.pdb
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\i-ant.cpp
.....\i-ant.dsp
.....\i-ant.dsw
.....\i-ant.ncb
.....\i-ant.opt
.....\i-ant.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．