A novel geometric center design method for genetic algorithm optimization
- Authors
- Lin, Ying; Zhang, Jun
- Issue Date
- Oct-2008
- Publisher
- IEEE
- Keywords
- Genetic algorithms (GAs); Geometric center; Local search
- Citation
- 2008 IEEE International Conference on Systems, Man and Cybernetics, pp 1446 - 1453
- Pages
- 8
- Indexed
- SCI
SCOPUS
- Journal Title
- 2008 IEEE International Conference on Systems, Man and Cybernetics
- Start Page
- 1446
- End Page
- 1453
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117813
- DOI
- 10.1109/ICSMC.2008.4811489
- ISSN
- 1062-922X
- Abstract
- This paper presents a novel geometric center embedded genetic algorithm (GCEGA) in solving optimization problems. Due to the inherent characteristics of genetic operators, traditional genetic algorithm (GA) has weaknesses in exploiting a peak. Hence it is time-consuming to attain a high precision solution. To deal with this problem, the geometric center design (GCD) method is proposed. It utilizes the geometric knowledge to approach the geometric center (GC) in search of potential optimum values. In every generation, some high-quality individuals are chosen to compute the GC, which is then evaluated and conditionally put back into the population. Experiments have been implemented on twelve functions for comparison between the traditional GA and the proposed algorithm. The results reveal that the proposed algorithm can remarkably enhance the performance of the traditional GA with faster speed and higher accuracy. © 2008 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117813)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.