A new dynamical evolutionary algorithm based on statistical mechanics

Journal of Computer Science and Technology

Volumn 18, Issue 3, 2003, Pages 361-368

  Li, YuanXiang ^a   Zou, XiuFen ^a   Kang, LiShan ^a   Michalewicz, Zbigniew ^b  

^a WUHAN UNIVERSITY   (China)

^b University of North Carolina at Charlotte   (United States)

Author keywords

Dynamical evolutionary algorithm; Dynamical system; Statistical mechanics; Stopping criterion

Indexed keywords

COMPUTER SIMULATION; DYNAMIC PROGRAMMING; FUNCTION EVALUATION; NUMERICAL METHODS; PROBLEM SOLVING; STATISTICAL MECHANICS;

DYNAMIC EVOLUTIONARY ALGORITHM; NUMERICAL FUNCTION MINIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 0038285575     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02948906     Document Type: Article

References (17)

1. Mitchell M. An Introduction to Genetic Algorithms. MIT Press, Cambridge, Massachusetts, 1996.
2. Back T, Fogel D, Michalewicz Z. Handbook of Evolutionary Computation. Volume 1, Oxford University Press, Oxford, England, 1997.
3. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1996.
4. Banzhaf W, Nordin P, Keller R, Francone F. Genetic Programming: An Introduction. Morgan Kaufmann, San Francisco, California, 1998.
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. In Proc. 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. In Proc. 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.
10. Reichl L E. A Modern Course in Statistical Mechanics. University of Texas Press, Austin, Texas, 1980.
11. Eberhart R C, Kennedy J. A new optimizer using particle swarm theory. In Proc. 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. In Proc. 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.
14. Demmel J W. Applied Numerical Linear Algebra, Society for Industrial and Applied Mathematics. Philadelphia, Pennsylvania, 1997.
15. Arts E H L et al. Simulated Annealing and Boltzmann 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.
17. He J, Kang L S. On the convergence rate of genetic algorithms. Theoretical Computer Science, 1999, 229: 23-39.