poster

Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems

Authors:

Seung-Kyu Lee,

Byung-Ro MoonAuthors Info & Claims

GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation

Pages 1865 - 1866

https://doi.org/10.1145/1569901.1570206

Published: 08 July 2009 Publication History

Get Access

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.

Reference

[1]

S. Yang. Genetic algorithms with elitism-based immigrants for changing optimization problems. In Evo Workshops 2007, ages 627--636, 2007.

Digital Library

Google Scholar

Cited By

View all

Barnes CEkárt ALewis P(2020)Beyond goal-rationality: Traditional action can reduce volatility in socially situated agentsFuture Generation Computer Systems10.1016/j.future.2020.07.033Online publication date: Jul-2020
https://doi.org/10.1016/j.future.2020.07.033
Yong CWenjian L(2010)A novel updating strategy for associative memory scheme in cyclic dynamic environmentsThird International Workshop on Advanced Computational Intelligence10.1109/IWACI.2010.5585215(32-39)Online publication date: Aug-2010
https://doi.org/10.1109/IWACI.2010.5585215

Index Terms

Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems
1. Applied computing

Recommendations

Evolutionary Computation for Dynamic Optimization Problems
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation

Many real-world optimization problems are subject to dynamic environments, where changes may occur over time regarding optimization objectives, decision variables, and/or constraint conditions. Such dynamic optimization problems (DOPs) are challenging ...
Genetic algorithms with memory-and elitism-based immigrants in dynamic environments

In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme ...
A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization

Traditional Genetic Algorithms (GAs) mating schemes select individuals for crossover independently of their genotypic or phenotypic similarities. In Nature, this behavior is known as random mating. However, non-random protocols, in which individuals ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation

July 2009

2036 pages

ISBN:9781605583259

DOI:10.1145/1569901

General Chair:
Franz Rothlauf
University of Mainz, Germany

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 July 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GECCO09

Sponsor:

GECCO09: Genetic and Evolutionary Computation Conference

July 8 - 12, 2009

Québec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
168
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Barnes CEkárt ALewis P(2020)Beyond goal-rationality: Traditional action can reduce volatility in socially situated agentsFuture Generation Computer Systems10.1016/j.future.2020.07.033Online publication date: Jul-2020
https://doi.org/10.1016/j.future.2020.07.033
Yong CWenjian L(2010)A novel updating strategy for associative memory scheme in cyclic dynamic environmentsThird International Workshop on Advanced Computational Intelligence10.1109/IWACI.2010.5585215(32-39)Online publication date: Aug-2010
https://doi.org/10.1109/IWACI.2010.5585215

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Evolutionary Computation for Dynamic Optimization Problems

Genetic algorithms with memory-and elitism-based immigrants in dynamic environments

A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization