OAK

Bolstering efficient SSGAs based on an ensemble of probabilistic variable-wise crossover strategies

Metadata Downloads
Abstract
A crossover operator in genetic algorithms (GAs) plays an essential role as the main search operator to breed offspring by exchanging information between individuals. Although different types of crossover operators have been developed for real-coded GAs (RCGAs), there has been very little research on combining different crossover operators to build more effective and efficient RCGAs. In this work, we propose new steady-state generation alternation-based RCGAs (SSGAs) ameliorated with (i) an ensemble of different probabilistic variable-wise crossover strategies, which is realized by the corresponding parallel populations, to utilize synergetic and complementary effect with their efficient operations, and (ii) efficient operation at each evolution step to obtain further performance enhancement. To investigate the performance of this ensemble with respect to search abilities and computation time, we compare the proposed algorithms against various SSGAs when running 27 benchmark functions. Empirical studies showed that the proposed algorithms exhibit better performance than the contestant SSGAs on these functions. Moreover, a comparison with the state-of-the-art evolutionary algorithms on eight difficult benchmark functions clearly demonstrated outperformance of the proposed algorithms.
Author(s)
Gwak, JeonghwanJeon, MoonguPedrycz, Witold
Issued Date
2016-06
Type
Article
DOI
10.1007/s00500-015-1630-8
URI
https://scholar.gist.ac.kr/handle/local/14230
Publisher
Springer Verlag
Citation
Soft Computing, v.20, no.6, pp.2149 - 2176
ISSN
1432-7643
Appears in Collections:
Department of Electrical Engineering and Computer Science > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.