Fast evolution strategies

Control and Cybernetics

Volumn 26, Issue 3, 1997, Pages 466-491

  Yao, Xin ^a   Liu, Yong ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Cauchy mutation; Evolutionary strategies; Function optimisation

Indexed keywords

EID: 3042859422     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. BÄCK, T. (1996) Evolutionary Algorithms in Theory and Practice. New York: Oxford University Press.
2. BÄCK, T. and SCHWEFEL, H.-P. (1993) An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1, 1, 1-23.
3. BÄCK, T. and SCHWEFEL, H.-P. (1996) Evolutionary computation: an overview. In: Proc. of the 1996 IEEE Int'l Conf. on Evolutionary Computation (ICEC'96), Nagoya, Japan, 20-29, IEEE Press, New York, NY 10017-2394.
4. DEKKERS, A. and AARTS, E. (1991) Global optimization and simulated annealing. Math. Programming, 50, 367-393.
5. DEVROYE, L. (1986) Non-Uniform Random Variate Generation. New York, NY 10010: Springer-Verlag.
6. FELLER, W. (1971) An Introduction to Probability Theory and Its Applications, 2. John Wiley & Sons, Inc., 2nd ed.
7. FOGEL, D.B. (1994) An introduction to simulated evolutionary optimisation. IEEE Trans. on Neural Networks, 5, 1, 3-14.
8. FOGEL, D.B. (1991) System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling. Needharn Heights, MA 02194: Ginn Press.
9. GEHLHAAR, D.K. and FOGEL, D.B. (1996) Tuning evolutionary programming for conformationally flexible molecular docking. In: Evolutionary Programming V: Proc. of the Fifth Annual Conference on Evolutionary Programming, L. J. Fogel, P. J. Angeline and T. Bäck, eds., 419-429, MIT Press, Cambridge, MA.
10. INGBER, L. and ROSEN, B. (1992) Genetic algorithms and very fast simulated rcanncaling: a comparison. Mathl. Comput. Modelling, 16, 11, 87-100.
11. KAPPLER, C. (1996) Are evolutionary algorithms improved by large mutations? In: Parallel Problem Solving from Nature (PPSN) IV, H.-M. Voigt, W. Ebeling, I. Reehenberg and H.-P. Schwefel, eds., 1141 of Lecture Notes in Computer Science, Berlin, 346-355, Springer-Verlag.
12. LIN, G. and YAO, X. (1997) Analysing crossover operators by search step size. In: Proc. of the 1997 IEEE Int'l Conf. on Evolutionary Computation (ICEC'97), Indianapolis, USA, 107-110, IEEE Press, New York, NY.
13. PRESS, W.H., TEUKOLSKY, S.A., VETTERLING, W.T. and FLANNERY, B.P. (1992) Numerical Recipes in FORTRAN. Cambridge, Cambridge University Press.
14. SCHWEFEL, H.-P. (1995) Evolution and Optimum Seeking. New York: John Wiley & Sons.
15. SZU, H.H. and HARTLEY, R.L. (1987) Nonconvex optimization by fast simulated annealing. Proceedings of IEEE, 75, 1538-1040.
16. TÖRN, A. and ŽILINSKAS, A. (1989) Global Optimisation. Berlin: Springer-Verlag, 1989. Lecture Notes in Computer Science, 350.
17. YAO, X. (1995) A new simulated annealing algorithm. Int. J. of Computer Math., 56, 161-168.
18. YAO, X. (1996) An overview of evolutionary computation. Chinese Journal of Advanced Software Research, 3, 1, 12-29.
19. YAO, X., LIN, G. and LIU, Y. (1997) An analysis of evolutionary algorithms based on neighbourhood and step sizes. In: Evolutionary Programming VI: Proc. of the Sixth Annual Conference on Evolutionary Programming, P. J. Angelina, R. G. Reynolds, J. R. McDonnell and R. Eberhart, eds., 1213 of Lecture Notes in Computer Science, Berlin, 297-307, Springer-Verlag.
20. YAO, X. and LIU, Y. (1996) Fast evolutionary programming. In: Evolutionary Programming V: Proc. of the Fifth Annual Conference on Evolutionary Programming, L. J. Fogel, P. J. Angelina and T. Back, eds., Cambridge, MA, 451-460, The MIT Press.
21. YAO, X. and LIU, Y. (1997) Fast evolution strategides. In: Evolutionary Programming VI: Proc. of the Sixth Annual Conference on Evolutionary Programming, P. J. Angeline, R. G. Reynolds, J. R. McDoimell and R. Eberhart, eds., 1213 of Lecture Notes in Computer Science, Berlin, 151-161, Springer-Verlag.