• Citations Per Year
Learn More
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(More)
TSP (Traveling Salesman Problem) is a typical combinational optimization problem. At present, there are a lot of methods to solve this problem, but with the increase of the scale of this problem, most methods face the difficult problem of "combination exploding". This paper combines Multi-Agent theory and MSM-PGA (Master-slaver Model Parallel Genetic(More)
In order to solve problem of the speed of convergence and early-maturing of the serial genetic algorithm, people begin to study the parallel genetic algorithm. However most researcher devoted to study the single way parallel genetic algorithm (PGA), while solving some combination optimizing problem, have made good result, but as to the more complicated(More)
In order to improve irrigated automatic degree of irrigated area, and make the control center and telemeter station to intelligent complete the task, structures the control center and telemeter station Agent union by instruct Multi-Agent theory, and make use of GSM network to finish the communication between the control center and telemeter station, at last(More)
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(More)
Though the research of relay protection of power system has already passed certain period, but at present, the relay protection of power system still exists some problem such that the mend time is too long, regular protection value can't meet dynamic change of system, the detection means of trouble is limited and the judgment and location of trouble is(More)
Reactive power optimization of power system is a dispersed, many variables, many restraint and non-linearly combination optimization problem, so it is very difficult to find optimum solving in theory. This paper combines Multi-Agent theory with the CGS-MSM PGA together, and make a certain improvement to heredity operate, set up a kind of improvement CGS-MSM(More)
TSP (traveling salesman problem) is a typical combinational optimization problem. At present, there are a lot of methods to solve this problem, but with the increase of the scale of this problem, most methods face the difficult problem of "combination exploding". This paper combines multi-agent theory and CGS-MSM PGA (coarse grain size-master slaver model(More)
In the course of whole operation of the power station, the distribution of the load among the units is a very key course, but the existing optimization algorithm has not reflected the real-time character of load optimal distributing, and because of having no considering repetitiveness of calculation, thus reduced the speed of calculation. This paper(More)