A Parallel Genetic Algorithm and Its Variance Analysis for A New Multiple Knapsack Problem

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.