Proceedings of the Korean Institute of Intelligent Systems Conference (한국지능시스템학회:학술대회논문집)
- 2000.05a
- /
- Pages.134-137
- /
- 2000
A Performance Comparison between GA and Schema Co-Evolutionary Algorithm
스키마 공진화 알고리즘과 GA의 성능 비교
Abstract
Genetic algorithms(GAs) have been widely used as a method to solve optimization problems. This is because GAs have simple and elegant tools with reproduction, crossover, and mutation to rapidly discover good solutions for difficult high-dimensional problems. They, however, do not guarantee the convergence of global optima in GA-hard problems such as deceptive problems. Therefore we proposed a Schema Co-Evolutionary Algorithm(SCEA) and derived extended schema 76988theorem from it. Using co-evolution between the first population made up of the candidates of solution and the second population consisting of a set of schemata, the SCEA works better and converges on global optima more rapidly than GAs. In this paper, we show advantages and efficiency of the SCEA by applying it to some problems.
Keywords