genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.

Packet : 83390054ga_for_tsp.rar filelist
用遗传算法求解背包问题\背包问题的遗传算法解法\frmMain.frm
用遗传算法求解背包问题\背包问题的遗传算法解法\GA.exe
用遗传算法求解背包问题\背包问题的遗传算法解法\GA.gif
用遗传算法求解背包问题\背包问题的遗传算法解法\GA.vbp
用遗传算法求解背包问题\背包问题的遗传算法解法\源码说明.txt
用遗传算法求解背包问题\背包问题的遗传算法解法
用遗传算法求解背包问题\说明.txt
用遗传算法求解背包问题

• 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．