Skip to main content

Optimization of Noisy Fitness Functions by Means of Genetic Algorithms Using History of Search

  • Conference paper
Parallel Problem Solving from Nature PPSN VI (PPSN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

Included in the following conference series:

Abstract

In the present paper, optimization of functions with uncertainty by means of Genetic Algorithms (GA) is discussed. For such problems, there have been proposed methods of sampling fitness function several times and taking average of them for evaluation of each individual. However, important applications having uncertain fitness functions are online adaptation of real systems and complicated computer simulation using random variables. In such applications, possible number of fitness evaluation is quite limited. Hence, methods achieving optimization with less number of fitness evaluation is needed. In the present paper, the authors propose a GA for optimization of continuous fitness functions with observation noise utilizing history of search so as to reduce number of fitness evaluation. In the proposed method, value of fitness function at a novel search point is estimated not only by the sampled fitness value at that point but also by utilizing the fitness values of individuals stored in the history of search. Computer experiments using quadric fitness functions show that the proposed method outperforms the conventional GA of sampling fitness values several times at each search point in noisy environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. I. Kamihara, M. Yamaguchi and H. Kita: On-line Adaptation of Vehicles by Means of an Evolutionary Control System, Proc IEEE International Conference on Systems, Man, and Cybernetics (SMC’ 99), pp. v-553–v558 (1999).

    Google Scholar 

  2. J. M. Fitzpatrick and J. J. Greffenstette: Genetic algorithms in noisy environments, Machine Learning, 3, pp.101–120 (1988)

    Google Scholar 

  3. J. Branke: Creating Robust Solustions by Means of Evolutionary Algorithms, Proc. PPSN V, pp. 119–128 (1998).

    Google Scholar 

  4. P. Stagge: Averaging Efficiently in the presence of Noise, Proc. PPSN V, pp. 188–197 (1998).

    Google Scholar 

  5. I. Ono and S. Kobayashi: A Real-Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover, Proc. 7th International Conference on Genetic Algorithms, pp. 246–253 (1997)

    Google Scholar 

  6. H. Tamaki and T. Arai: A Genetic Algorithm Approach to Optimization Problems in an Uncertain Environment, Proc. of 1997 Intl. Conf. on Neural Information Processing and Intelligent Information Systems, pp. 436–439 (1997)

    Google Scholar 

  7. K. Tanooka, H. Tamaki, S. Abe and S. Kitamura: A Continuous Age Model of Genetic Algorithms Applicable to Optimization Problems with Uncertainties, Proc. 1999 IEEE Intl. Conf. on Systems Man and Cybernetics, Vol. 1, pp. 637–642 (1999).

    Google Scholar 

  8. S. Tsutusi and A. Ghosh: Genetic algorithms with a robust solution searching scheme. IEEE Trans. on Evolutionary Computation, 1(3), pp. 201–208 (1997).

    Article  Google Scholar 

  9. D.E. Goldberg and R.E. Smith: nonstationary function optimization using genetic algorithms with dominance and diploidy, Proc. 2nd Intl. Conf. on Genetic Algorithms (ICGA), pp. 59–68 (1987).

    Google Scholar 

  10. H.G. Cobb and J.J. Grefenstette: Genetic Algorithms for Tracking Changing Environments, Proc. 5th Intl. Conf. on Genetic Algorithms, pp. 523–529 (1993).

    Google Scholar 

  11. D. Dasgupta and D.R. McGregor: Nonstationary function optimization using structured genetic algorithm, Proc. PPSN II, pp. 145–154 (1992).

    Google Scholar 

  12. N. Mori, S. Imanishi, H. Kita and Y. Nishikawa: Adaptation to Changing Environments by Means of the Memory Based Thermodynamical Genetic Algorithm, Proc. 7th ICGA, pp. 299–306 (1997).

    Google Scholar 

  13. N. Mori, Hajime Kita and Yoshikazu Nishikawa: Adaptation to a Changing Environment by Means of the Feedback Thermodynamical Genetic Algorithm, Proc. PPSN V, pp. 149–158 (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sano, Y., Kita, H. (2000). Optimization of Noisy Fitness Functions by Means of Genetic Algorithms Using History of Search. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics