ロバスト解探索型遺伝的アルゴリズムの多次元空間における性質について

抄録

Many of the studies on GAs give emphasis on finding the global optimal solution. If a global optimal solution found is on a sharp-pointed location, there may be cases where it is dangerous to use this solution. In the previous paper, we have proposed the GA/RS^3(GA with a Robust Solution Seraching Scheme) which extend the application of GAs to domains that require robust solutions, and its analytical and experimental study has been made limitting the search space to be one dimensional case. In this paper, we extend it to multidimensional case.