A MSM-PGA Based on Multi-Agent for Solving 0-1 Knapsack Problem

0-1 knapsack problem is a typical optimization difficult problem. At present, there are a lot of methods to solve this problem, but with the increase of the scale of this problem, among them, the genetic algorithm is an important branch, it is quite active to ask the research of solving 0-1 knapsack on the basis of the genetic algorithm. This paper combines multi-agent theory and MSM-PGA(master-slaver model parallel genetic algorithm) together, form one MSM-PGA multi-agent union. This union solves the 0-1 by the coordination between many agents inside the union. The introduction of multi-agent theory, make the master course and slave course of MSM-PGA to be made of agent, so the ability of communication and coordination raise greatly, thus overcome the shortcoming of original MSM-PGA; And comparing with other methods solved 0-1 knapsack problem, the method of this paper not only has the fast computational speed and the high precision, but also can get more optimal solving than other algorithms.