Parallelization of genetic algorithm with sexual selection

DOI Web Site Web Site 参考文献4件

抄録

<jats:title>Abstract</jats:title><jats:p>We propose a parallel genetic algorithm with sexual selection. In genetic algorithms with sexual selection with one population, females keep their traits around local optima by using a lower mutation rate than that of the males, while the males change their traits actively. When a runaway process takes place, the transitions of the males' traits are biased toward a certain direction which depends on the bias of the females' preferences. If the population size is large, the search converges quickly. However, the large population size causes a decrease in search performance. In the proposed method with parallelization, the population size of each subpopulation is maintained adequately, and each subpopulation seeks its own direction of evolution independently. As a result, the proposed method makes a search converge quickly because the runaway process which leads to intermittent evolution tends to take place more quickly than one population model. We applied the proposed method to some test problems. In these problems, while the performance of conventional genetic algorithms was decreased by parallelization, the proposed method exhibited better performance with parallelization. Moreover, the performance of the proposed method is better than that of conventional methods. This capability of parallelization is a remarkable characteristic of sexual selection. © 2004 Wiley Periodicals, Inc. Electr Eng Jpn, 150(1): 42–49, 2005; Published online in Wiley InterScience (<jats:ext-link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.interscience.wiley.com">www.interscience.wiley.com</jats:ext-link>). DOI 10.1002/eej.20029</jats:p>

収録刊行物

参考文献 (4)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ