1996 | ReviewPaper | Buchkapitel
A robust solution searching scheme in genetic search
verfasst von : Shigeyoshi Tsutsui, Ashish Ghosh, Yoshiji Fujimoto
Erschienen in: Parallel Problem Solving from Nature — PPSN IV
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 detection of 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.