Performance Analysis of Distributed Genetic Algorithms for Traveling Salesman Problem

서지정보

ㆍ발행기관 : 한국산업경영시스템학회 ㆍ수록지정보 : 산업경영시스템학회지 / 39권 / 4호
ㆍ저자명 : 김영남, 이민정, 하정훈

영어 초록

Distributed genetic algorithm (DGA), also known as island model or coarse-grained model, is a kind of parallel genetic algorithm, in which a population is partitioned into several sub-populations and each of them evolves with its own genetic operators to maintain diversity of individuals. It is known that DGA is superior to conventional genetic algorithm with a single population in terms of solution quality and computation time. Several researches have been conducted to evaluate effects of parameters on GAs, but there is no research work yet that deals with structure of DGA. In this study, we tried to evaluate performance of various genetic algorithms (GAs) for the famous symmetric traveling salesman problems. The considered GAs include a conventional serial GA (SGA) with IGX (Improved Greedy Crossover) and several DGAs with various combinations of crossover operators such as OX (Order Crossover), DPX (Distance Preserving Crossover), GX (Greedy Crossover), and IGX. Two distinct immigration policies, conventional noncompetitive policy and newly proposed competitive policy are also considered. To compare performance of GAs clearly, a series of analysis of variance (ANOVA) is conducted for several scenarios. The experimental results and ANOVAs show that DGAs outperform SGA in terms of computation time, while the solution quality is statistically the same. The most effective crossover operators are revealed as IGX and DPX, especially IGX is outstanding to improve solution quality regardless of type of GAs. In the perspective of immigration policy, the proposed competitive policy is slightly superior to the conventional policy when the problem size is large.

참고 자료

없음