A computationally efficient evolutionary algorithm for real-parameter optimization

Evolutionary Computation

Volumn 10, Issue 4, 2002, Pages 371-395

  Deb, Kalyanmoy ^a   Anand, Ashish ^a   Joshi, Dhiraj ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Covariance matrix adaptation; Differential evolution; Parent centric recombination; Quasi Newton method; Real parameter optimization; Scalable evolutionary algorithms; Self adaptive evolution strategy; Simulated binary crossover

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER ANALYSIS; EVOLUTION; REPRODUCIBILITY; THEORETICAL MODEL;

ALGORITHMS; COMPUTING METHODOLOGIES; EVOLUTION; MODELS, THEORETICAL; REPRODUCIBILITY OF RESULTS;

EID: 0036885602     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365602760972767     Document Type: Article

References (31)

1. Bäck, T. (1997). Self-adaptation. In Bäck, T., Fogel, D., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, pages C7.1:1-15, Institute of Physics Publishing, Bristol, UK, and Oxford University Press, New York, New York.
2. Beyer, H.-G. (2001). The Theory of Evolution Strategies. Springer, Berlin, Germany.
3. Beyer, H.-G. and Deb, K. (2001). On self-adaptive features in real-parameter evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 5(3):250-270.
4. Branch, M. A. and Grace, A. (1996). Optimization toolbox for use with MATLAB, The MathWorks, Inc., Natick, Massachusetts.
5. Chellapilla, K. and Fogel, D. B. (1999). Fitness distributions in evolutionary computation: Analysis of local extrema in the continuous domain. Proceedings of the IEEE Congress on Evolutionary Computation (CEC-1999), pages 1885-1892, IEEE Press, Piscataway, New Jersey.
6. Deb, K. (1995). Optimization methods for engineering design, Prentice-Hall, New Delhi, India.
7. Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. John Wiley and Sons, Chichester, UK.
8. Deb, K. and Agrawal, R. B. (1995). Simulated binary crossover for continuous search space. Complex Systems, 9(2):115-148.
9. Deb, K. and Beyer, H.-G. (2000). Self-adaptive genetic algorithms with simulated binary crossover. Evolutionary Computation, 9(2):197-221.
10. Eiben, A. E. and Back, T. (1997). Empirical investigation of multiparent recombination operators in evolution strategies. Evolutionary Computation, 5(3):347-365.
11. Fogel, D. B. and Beyer, H.-G. (1995). A note on the empirical evaluation of intermediate recombination. Evolutionary Computation, 3(4):491-495.
12. Goldberg, D. E., Deb, K., and Clark, J. H. (1992). Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6(4):333-362.
13. Hansen, N. and Ostermeier, A. (1996). Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 312-317, IEEE Press, Piscataway, New Jersey.
14. Hansen, N. and Ostermeier, A. (2000). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195.
15. Harik, G. et al. (1999). The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-254.
16. Herrera, F., Lozano, M., and Verdegay, J. L. (1998). Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review, 12(4):265-319.
17. Higuchi, T., Tsutsui, S., and Yamamura, M. (2000). Theoretical analysis of simplex crossover for real-coded genetic algorithms. In Schoenauer, M. et al., editors, Parallel Problem Solving from Nature (PPSN-VI), pages 365-374, Springer, Berlin, Germany.
18. Kita, H. (2000). A comparison study of self-adaptation in evolution strategies and real-coded genetic algorithms. Evolutionary Computation 9(2):223-241.
19. Kita, H. and Yamamura, M. (1999). A functional specialization hypothesis for designing genetic algorithms. Proceedings of the 1999 IEEE International Conference on Systems, Man, and Cybernetics, pages 579-584, IEEE Press, Piscataway, New Jersey.
20. Kita, H., Ono, I., and Kobayashi, S. (1999). Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms. In Porto, V. W., editor, Proceedings of the 1999 Congress on Evolutionary Computation, pages 1581-1587, IEEE Press, Piscataway, New Jersey.
21. Ono, I. and Kobayashi, S. (1997). A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In Bäck, T., editor, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA-7), pages 246-253, Morgan Kaufmann, San Francisco, California.
22. Patton, A. L., Goodman, E. D., and Punch, W. F. (1999). Scheduling variance loss using population level annealing for evolutionary computation. Proceedings of the IEEE Congress on Evolutionary Computation (CEC-1999), pages 760-767, IEEE Press, Piscataway, New Jersey.
23. Rechenberg, I. (1973). Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart, Germany.
24. Reklaitis, G. V., Ravindran, A., and Ragsdell, K. M. (1983). Engineering Optimization Methods and Applications. John Wiley and Sons, New York, New York.
25. Salomon, R. (1999). The deterministic genetic algorithm: Implementation details and some results. Proceedings of the IEEE Congress on Evolutionary Computation (CEC-1999), pages 695-702, IEEE Press, Piscataway, New Jersey.
26. Satoh, H., Yamamura, M., and Kobayashi, S. (1996). Minimal generation gap model for GAs considering both exploration and exploitation. In Yamakawa, T. and Matsumoto, G., editors, Proceedings of the IIZUKA: Methodologies for the Conception, Design, and Application of Intelligent Systems, pages 494-497, World Scientific, Singapore.
27. Schwefel, H.-P. (1987). Collective intelligence in evolving systems. In Wolff, W., Soeder, C. J., and Drepper, F., editors, Ecodynamics - Contributions to Theoretical Ecology, pages 95-100, Springer, Berlin, Germany.
28. Storn, R. and Price, K. (1997). Differential evolution - a fast and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11:341-359.
29. Tsutsui, S., Yamamura, M., and Higuchi, T. (1999). Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In Banzhaf, W. et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 657-664, Morgan Kaufmann, San Francisco, California.
30. Voigt, H.-M., Mühlenbein, H., and Cvetkovic, D. (1995). Fuzzy recombination for the Breeder Genetic Algorithm. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 104-111, Morgan Kaufmann, San Francisco, California.
31. Wakunda, J. and Zell, A. (2000). Median-selection for parallel steady-state evolution strategies. In Schoenauer, M. et al., editors, Proceedings of the Parallel Problem Solving from Nature, (PPSN-VI), pages 405-414, Springer, Berlin, Germany.