The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Most algorithms proposed in the literature for individual haplotyping problem try to generate a single pair of haploytpes with the highest accuracy in terms of certain specific optimization criteria. However, due to the limitations of models, the result produced by these algorithms may not be the real best one, which leads to a low reconstruction rate for the pair of constructed haplotypes. This paper...
In this paper, an improved genetic algorithm based on polygymy which means one father and many mothers is proposed. The population is divided into several sub-populations, and each sub-population is composed of a father, some mothers and some bachelors. Crossover is occurred between the father and the mothers. Mutation is occurred only among the bachelors. The function optimization results show that...
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 CGS-MSM PGA (coarse...
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 parallel genetic algorithm) together,...
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 combination optimizing problem, all have certain...
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...
The authors describe a multithreaded parallel genetic algorithm (PGA) implementation. Considering the basic models of parallel genetic algorithms, we identify a variant of global PGA (GPGA) as the most appropriate one for use on a multiprocessor system with few processors. The difference between the synchronous and asynchronous model is analyzed and their characteristics are evaluated. Unlike some...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.