抄録
In optimization process of genetic algorithm application, early convergence often happens through iterations of the generation alternation. In order to avoid such situation, individuals in GA should be sufficiently varied in whole generations (Diversity maintaining). Distributed genetic algorithm (DGA) is a promising approach for the diversity maintaining as well as acceleration of the calculation. This paper presents a study on topology of each group(island) in construction ofDGA based optimization system. We discuss the performance especially resulting from the difference of topologies such as "small-world networks" in DGA, through numerical experiments of traveling salesman problem, in terms of accuracy and diversity of the solutions.
