A robust solution searching scheme in genetic search

  • Shigeyoshi Tsutsui
  • Ashish Ghosh
  • Yoshiji Fujimoto
Modifications and Extensions of Evolutionary Algorithms Further Modifications and Extensionds
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1141)


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.


Genetic Search Robust Solutions Adding noise 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baker, J. E.: Reducing Bias and Inefficiency in the Selection Algorithm, Proc. of the Fifth ICGA, pp. 14–21 (1987).Google Scholar
  2. 2.
    Beasley, D., Bull, D. R. and Martin, R. R.: A Sequential Niche Technique for Multimodal Function Optimization, Evolutionary Computation, MIT Press, Vol. 1, No. 2, pp. 101–125 (1993).Google Scholar
  3. 3.
    De Jong, K. A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems (Doctoral Dissertation, University of Michigan). Dissertation Abstract International 36(10), 5140B. (University Microfilms No. 76-9381)Google Scholar
  4. 4.
    Deb, K. and Goldberg, D. E.: An Investigation of Niche and Species Formation in Genetic Function Optimization, Proc. of the Third ICGA, pp. 42–50 (1989).Google Scholar
  5. 5.
    Eshelman, L. J.: The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination, Foundations of Genetic Algorithms, edited by Rawlins, G.J.E., Morgan Kaufmann, pp.265–283 (1991).Google Scholar
  6. 6.
    Goldberg, D. E.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company, Inc. (1989).Google Scholar
  7. 7.
    Goldberg, D. E., Deb, K. and Korb, B.: Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale, Complex Systems, vol. 4, pp. 415–444 (1990).Google Scholar
  8. 8.
    Goldberg, D. E. and Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function Optimization, Proc. of the Second ICGA, pp. 41–49 (1987).Google Scholar
  9. 9.
    Hammel, U. and Back, T.: Evolution Strategies on Noisy Function How to Improve Convergence Properties, Proc. of Third Conf. on Parallel Problem Solving from Nature, North-Holland, pp. 159–168 (1994).Google Scholar
  10. 10.
    Mathias, K and Whitley, L. D.: Changing Representations During Search: A Comparative Study of Delta Coding, Evolutionary Computation, MIT Press, Vol. 2, No. 3, pp. 249–278 (1994).Google Scholar
  11. 11.
    Mahfoud, S. W.: Crowding and preselection revisited, Proc. of Second Conf. on Parallel Problem Solving from Nature, North-Holland, pp. 27–34 (1992).Google Scholar
  12. 12.
    Tsutsui, S. and Fujimoto, Y.: Forking Genetic Algorithm with Blocking and Shrinking Modes, Proc. of the Fifth ICGA, pp. 206–213 (1993).Google Scholar
  13. 13.
    Tsutsui, S. and Fujimoto, Y.: Phenotypic Forking Genetic Algorithms (p-fGA), Proc. of the 1995 IEEE ICEC, pp. 566–572 (1995).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Shigeyoshi Tsutsui
    • 1
  • Ashish Ghosh
    • 2
  • Yoshiji Fujimoto
    • 3
  1. 1.Department of Management and Information ScienceHannan UniversityOsakaJapan
  2. 2.Department of Industrial Engineering, College of EngineeringOsaka Prefecture UniversityOsakaJapan
  3. 3.Department of Applied Mathematics and Informatics Faculty of Science and TechnologyRyukoku UniversityShigaJapan

Personalised recommendations