ロバスト解探索型遺伝的アルゴリズムの基礎提案

概要

論文の詳細を見る
Many of the studies on GAs give emphasis on finding the global optimal solution. In this paper, we propose a new method which extend the application of GAs to domains that require robust solutions. If a global optimal solution found is on a sharp-pointed location, there may be cases where it is not good to use this solution. In nature, the phenotypic feature of an organism is determined from the genotypic code of genes in the chromosome. During this process, there may be some perturbations. Let X be the phenotypic parameter vector, f(X) a fitness function and Δ a noise vector. As can be easily understood from the analogy of nature, actual fitness function should be of the form f(X+Δ). We use this analogy for the present work. Simulation results confirm the utility of this approach in finding robust solutions.
社団法人人工知能学会の論文
1997-09-01