Thumbnail
Access Restriction
Subscribed

Author Yu, Xin ♦ Tang, Ke ♦ Chen, Tianshi ♦ Yao, Xin
Source SpringerLink
Content type Text
Publisher Springer-Verlag
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations
Subject Keyword Evolutionary Algorithm ♦ Dynamic Optimization Problem ♦ Immigrants scheme ♦ Applications of Mathematics ♦ Bioinformatics ♦ Complexity ♦ Artificial Intelligence (incl. Robotics) ♦ ApplicationMathematics/Computational Methods of Engineering ♦ Control ♦ Robotics ♦ Mechatronics
Abstract In recent years, there has been a growing interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs). Among approaches developed for EAs to deal with DOPs, immigrants schemes have been proven to be beneficial. Immigrants schemes for EAs on DOPs aim at maintaining the diversity of the population throughout the run via introducing new individuals into the current population. In this paper, we carefully examine the mechanism of generating immigrants, which is the most important issue among immigrants schemes for EAs in dynamic environments. We divide existing immigrants schemes into two types, namely the direct immigrants scheme and the indirect immigrants scheme, according to the way in which immigrants are generated. Then experiments are conducted to understand the difference in the behaviors of different types of immigrants schemes and to compare their performance in dynamic environments. Furthermore, a new immigrants scheme is proposed to combine the merits of two types of immigrants schemes. The experimental results show that the interactions between the two types of schemes reveal positive effect in improving the performance of EAs in dynamic environments.
ISSN 18659284
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-12-12
Publisher Place Berlin, Heidelberg
e-ISSN 18659292
Journal Memetic Computing
Volume Number 1
Issue Number 1
Page Count 22
Starting Page 3
Ending Page 24


Open content in new tab

   Open content in new tab
Source: SpringerLink