Sciweavers

Share
KES
1998
Springer

Properties of robust solution searching in multi-dimensional space with genetic algorithms

9 years 9 months ago
Properties of robust solution searching in multi-dimensional space with genetic algorithms
-A large number of studies on Genetic Algorithms (GAs) emphasize finding a globally optimal solution. Some other investigations have also been made for detecting multiple solutions. If a global optimal solution is very sensitive to noise or perturbations in the environment then there may be cases where it is not good to use this solution. We have proposed a new scheme, GA/RS3 , which extends the application of GAs to domains that require the discovery of robust solutions and a mathematical model for this scheme has been developed restricting their search space to one-dimensional. In this paper, we analyze properties of GAs/RS3 in multi-dimension search spaces. The effectiveness of the scheme is demonstrated by solving two-dimensional functions having broad and sharp peaks.
Shigeyoshi Tsutsui, Lakhmi C. Jain
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where KES
Authors Shigeyoshi Tsutsui, Lakhmi C. Jain
Comments (0)
books