Please use this identifier to cite or link to this item:
Title: A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Authors: Tinos, R
Yang, S
Keywords: Genetic algorithms;Self-organized criticality;Dynamic optimization problems;Random immigrants
Issue Date: 2007
Publisher: Springer
Citation: Genetic Programming and Evolvable Machines, 8(3): 255 - 286, Sep 2007
Abstract: In this paper a genetic algorithm is proposed where the worst individual and individuals with indices close to its index are replaced in every generation by randomly generated individuals for dynamic optimization problems. In the proposed genetic algorithm, the replacement of an individual can affect other individuals in a chain reaction. The new individuals are preserved in a subpopulation which is defined by the number of individuals created in the current chain reaction. If the values of fitness are similar, as is the case with small diversity, one single replacement can affect a large number of individuals in the population. This simple approach can take the system to a self-organizing behavior, which can be useful to control the diversity level of the population and hence allows the genetic algorithm to escape from local optima once the problem changes due to the dynamics.
Description: This is the post-print version of the article. The official published version can be obtained from the link below - Copyright @ 2007 Springer
ISSN: 1389-2576
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf727.9 kBAdobe PDFView/Open

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