Skip to main content

Adaptation to a changing environment by means of the thermodynamical genetic algorithm

  • Modifications and Extensions of Evolutionary Algorithms Further Modifications and Extensionds
  • Conference paper
  • First Online:

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

Abstract

In the genetic algorithm (GA), maintenance of the diversity of the population is an important issue to enhance its optimization and adaptation ability. The authors have proposed the thermodynamical genetic algorithm (TDGA), which can maintain the diversity explicitly and systematically by evaluating the entropy and the free energy of the population. In adaptation to changing environment, the maintenance of the diversity is quite essential because it is a key factor of generating novel search points. This paper discusses adaptation to changing environment by means of TDGA by taking a time-varying knapsack problem as an example.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. H. Holland: Adaptation in Natural and Artificial Systems, The University of Michigan (1975).

    Google Scholar 

  2. D. E. Goldberg: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley (1989).

    Google Scholar 

  3. J. J. Grefenstette: Genetic algorithms for changing environments, Problem Solving from Nature 2, Vol. 2, pp.137–144 (1992).

    Google Scholar 

  4. H. G. Gobb and J. J. Grefenstette: Genetic Algorithms for Tracking Changing Environments, Proc. of 5th ICGA, Vol. 5, pp. 523–529 (1993).

    Google Scholar 

  5. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi: Optimization by simulated annealing, Science, Vol. 220, pp. 671–680 (1983).

    Google Scholar 

  6. H. Tamaki and Y. Nishikawa: A Paralleled Genetic Algorithm based on a Neighborhood Model and Its Application to the Jobshop Scheduling, Parallel Problem Solving from Nature 2 (PPSN'92), North-Holland, pp. 573–582 (1992).

    Google Scholar 

  7. Y. Ichikawa and Y. Ishii: Retaining Diversity of Genetic Algorithms Based on Allele Distribution, Trans. SICE, Vol. 30, No. 10, pp. 1242–1250 (1994, in Japanese).

    Google Scholar 

  8. K. Ohkura and K. Ueda: A Genetic Algorithm for Nonstationary Function Optimization Problems, Trans. SICE, Vol. 8, No. 6, pp. 269–276, (1995).

    Google Scholar 

  9. N. Mori, J. Yoshida, H. Tamaki, H. Kita and Y. Nishikawa: “A Thermodynamical Selection Rule for the Genetic Algorithm,” Proc. of 2nd IEEE Conference on Evolutionary Computation (ICEC'95), pp. 188–192 (1995).

    Google Scholar 

  10. T. Fukao: Thermodynamical Theory of Distributed System, Shoukoudou (1987, in Japanese).

    Google Scholar 

  11. S. Martello and P. Toth: Knapsack Problems, Wiley (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans-Michael Voigt Werner Ebeling Ingo Rechenberg Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mori, N., Kita, H., Nishikawa, Y. (1996). Adaptation to a changing environment by means of the thermodynamical genetic algorithm. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1015

Download citation

  • DOI: https://doi.org/10.1007/3-540-61723-X_1015

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61723-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics