Abstract---A large number of studies on Genetic Algorithms (GAs) emphasize finding a globally op-timal solution. Some other investigations have also been made for detecting multiple solutions. If a glo-bal optimal solution is very sensitive to noise or per-turbations 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 dis-covery 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-dimen...