×

A new dynamical evolutionary algorithm based on statistical mechanics. (English) Zbl 1046.68092

Summary: A new Dynamical Evolutionary Algorithm (DEA) is presented based on the theory of statistical mechanics. The novelty of this kind of dynamical evolutionary algorithm is that all individuals in a population (called particles in a dynamical system) are running and searching with their population evolving driven by a new selecting mechanism. This mechanism simulates the principle of molecular dynamics, which is easy to design and implement. A basic theoretical analysis for the dynamical evolutionary algorithm is given and as a consequence two stopping criteria of the algorithm are derived from the principle of energy minimization and the law of entropy increasing. In order to verify the effectiveness of the scheme, DEA is applied to solving some typical numerical function minimization problems which are poorly solved by traditional evolutionary algorithms. The experimental results show that DEA is fast and reliable.

MSC:

68T05 Learning and adaptive systems in artificial intelligence
68W05 Nonnumerical algorithms

Software:

Genocop
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Mitchell M. An Introduction to Genetic Algorithms. MIT Press, Cambridge, Massachusetts, 1996. · Zbl 0906.68113
[2] Back T, Fogel D, Michalewicz Z. Handbook of Evolutionary Computation. Volume 1, Oxford University Press, Oxford, England, 1997. · Zbl 0883.68001
[3] Michalewicz Z. Genetic Algorithms+Data Structures =Evolution Programs. Springer-Verlag, Berlin 1996. · Zbl 0841.68047
[4] Banzhaf W, Nordin P, Keller R, Francone F. Genetic Programming: An Introduction. Morgan Kaufmann, San Francisco, California, 1998. · Zbl 0893.68117
[5] Lack D L. Darwin’s Finches. Cambridge University Press, Cambridge, England, 1947.
[6] Mitchell M, Forrest S, Holland J H. The royal road for genetic algorithms: Fitness landscapes and GA performance. InProc. the First European Conference on Artificial Life, Varela F J, Bourgine P (eds.), MIT Press, Cambridge, Massachusetts, 1992, pp.245–254.
[7] Deb K, Goldberg D E. An investigation of niche and species formation in genetic function optimization. InProc. the Third International Conference on Genetic Algorithms, Schaffer J D (ed.), Morgan Kaufmann, San Mateo, California, 1989, pp.42–50.
[8] Holland J H. Hidden Order: How Adaptation Builds Complexity. Addison-Wesley, Reading, Massachusetts, 1995.
[9] Holland J H. Building blocks, cohort genetic algorithms, and hyperplane-defined functions.Evolutionary Computation, 2000, 8: 373–391. · Zbl 05412829 · doi:10.1162/106365600568220
[10] Reichl L E. A Modern Course in Statistical Mechanics. University of Texas Press, Austin, Texas, 1980. · Zbl 0913.00015
[11] Eberhart R C, Kennedy J. A new optimizer using particle swarm theory. InProc. the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp.39–43.
[12] Eberhart R C, Yuhui Shi. Particle swarm optimization: Development, applications and resources. InProc. the 2001 IEEE Congress on Evolutionary Computation, Seoul, Korea, 2001, pp.81–86.
[13] Joseph J McCauley. Classical Mechanics: Transformations, Flows, Integrable and Chaotic Dynamics Cambridge University Press, Cambridge, England, 1997. · Zbl 0915.70002
[14] Demmel J W. Applied Numerical Linear Algebra, Society for Industrial and Applied Mathematics. Philadelphia, Pennsylvania, 1997. · Zbl 0879.65017
[15] Arts E H Let al. Simulated Annealing and Boltznann Machines. John Wiley & Sons, New York, 1988.
[16] Eiben A E, Rudolph G. Theory of evolutionary algorithms: A bird’s eye view.Theoretical Computer Science, 1999, 229: 3–9. · Zbl 0940.00016 · doi:10.1016/S0304-3975(99)00089-4
[17] He J, Kang L S. On the convergence rate of genetic algorithms.Theoretical Computer Science, 1999, 229: 23–39. · Zbl 0938.68081 · doi:10.1016/S0304-3975(99)00091-2
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.