A Master-Slave Model NGA and its Application in the Multidimensional 0-1 Knapsack Problem
2013 ◽
Vol 433-435
◽
pp. 566-569
Keyword(s):
Np Hard
◽
The Multidimensional 0-1 knapsack problem is a NP hard problem, though there are many algorithm is used to solve the problem, but there is still not a good solution to solving the problem. This paper improved niche genetic algorithm, established a master-slave mode niche genetic algorithm, and carried on adaptive setting the individual Euclidean distance criterion, making it can changed with the evolving algebra incremental. At last, used master-slave niche genetic algorithm to solve the Multidimensional 0-1 knapsack problem, test results showed, the algorithm has good applicability and superiority in solving the Multidimensional 0-1 knapsack problem.