http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Parallel Genetic Algorithm and Its Variance Analysis for A New Multiple Knapsack Problem
Hayato Miyagi,Morikazu Nakamura 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
This paper presents some results of experimental evaluation on the fitness varieties in parallel genetic algorithms based on tree topology migrations. The evaluation focuses on the relation between the solution quality and the fitness varieties. We perform the evaluation for the typical tree topologies; the star, line, and balanced binary tree with varying migration interval since the solution quality of the parallel genetic algorithm depends on the kind of the topology and migration interval. The results show that the line topology can keep the chromosome variety of the GA and obtain better quality of solutions since the topology has the longest distance between the root and the leaves.