Description: This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm to solve the 01 knapsack problem. In the 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. From the n-items, select the items into the backpack, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight can not exceed the capacity of backpack, the best load is the value of the items loaded the highest.
- [Matlabtoolbox.Rar] - Matlab Toolbox : Matlab Toolbox genetic
- [mathmodel2] - 1.1 knapsack problem is a hikers. he is
- [Chp15] - knapsack problem genetic algorithm metho
- [Antbeibao] - Using ant colony algorithm to solve 0-1
- [xujinpeng-matlab] - Genetic Algorithm for Solving Traveling
- [gabags] - Web site development on the genetic algo
- [optimization] - matlab matlab matlab matlab optimization
File list (Check if you may need any files):
GA.m
Download