ACM Home Page
Please provide us with feedback. Feedback
Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems
Full text PdfPdf (293 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 9: genetic algorithms table of contents
Pages 1865-1866  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Seung-Kyu Lee  Seoul National University, Seoul, South Korea
Byung-Ro Moon  Seoul National University, Seoul, South Korea
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570206
What is a DOI?

ABSTRACT

We propose a genetic algorithm with adaptive elitism-based immigrants which tunes the balance between elitism-based immigrants and random immigrants by itself. Experimental results show that our genetic algorithm with adaptive elitism-based immigrants performs better than that with the elitism-based immigrants for onemax and produces comparable results for royal road and knapsack problems.



Collaborative Colleagues:
Seung-Kyu Lee: colleagues
Byung-Ro Moon: colleagues