Parameter control in evolutionary algorithms

Studies in Computational Intelligence

Volumn 54, Issue , 2007, Pages 19-46

  Eiben, A E ^a   Michalewicz, Zbigniew ^b   Schoenauer, Marc ^c   Smith, James E ^d  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b UNIVERSITY OF ADELAIDE   (Australia)

^c INRIA   (France)

^d UWE ^*  (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34147120314     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-69432-8_2     Document Type: Article

References (84)

1. E.H.L. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines Wiley, Chichester, UK, 1989.
2. P.J. Angeline. Adaptive and self-adaptive evolutionary computations. In Computational Intelligence, pages 152-161. IEEE Press, 1995.
3. J. Arabas, Z. Michalewicz, and J. Mulawka. GAVaPS - a genetic algorithm with varying population size. In ICEC-94 [42], pages 73-78.
4. A. Auger. Contributions théoriques et numériques à l'optimisation continue par algorithmes évolutionnaires. PhD thesis, Université Paris 6, December 2004. in French.
5. A. Auger, C. Le Bris, and M. Schoenauer. Dimension-independent convergence rate for non-isotropic (1, λ)-es. In proceedings of GECCO2003, pages 512-524, 2003.
6. T. Bäck. The interaction of mutation rate, selection and self-adaptation within a genetic algorithm. In Männer and Manderick [56], pages 85-94.
7. T. Bäck. Self adaptation in genetic algorithms. In F.J. Varela and P. Bourgine, editors, Toward a Practice of Autonomous Systems: Proceedings of the 1st European Conference on Artificial Life, pages 263-271. MIT Press, Cambridge, MA, 1992.
8. T. Bäck. Optimal mutation rates in genetic search. In Forrest [31], pages 2-8.
9. T. Bäck. Evolutionary Algorithms in Theory and Practice. New-York:OXford University Press, 1995.
10. T. Bäck. Self-adaptation. In T. Bäck, D.B. Fogel, and Z. Michalewicz, editors, Evolutionary Computation 2: Advanced Algorithms and Operators, chapter 21, pages 188-211. Institute of Physics Publishing, Bristol, 2000.
11. T. Bäck, A.E. Eiben, and N.A.L. van der Vaart. An empirical study on GAs "without parameters". In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo, and H.-P. Schwefel, editors, Proceedings of the 6th Conference on Parallel Problem Solving from Nature, number 1917 in Lecture Notes in Computer Science, pages 315-324. Springer, Berlin, Heidelberg, New York, 2000.
12. T. Bäck, D.B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol, and Oxford University Press, New York, 1997.
13. T. Bäck, M. Schütz, and S. Khuri. A comparative study of a penalty function, a repair heuristic and stochastic operators with set covering problem. In Proceedings of Evolution Artificial 1995, number 1063 in LNCS. Springer-Verlag, 1995.
14. J.C. Bean and A.B. Hadj-Alouane. A dual genetic algorithm for bounded integer problems. Technical Report 92-53, University of Michigan, 1992.
15. R.K. Belew and L.B. Booker, editors. Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco, 1991.
16. L. Davis. 'Adapting operator probabilities in genetic algorithms. In Schaffer [61], pages 61-69.
17. L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
18. K.A. De Jong. An Analysis of the Behaviour of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975.
19. K. Deb and H.-G. Beyer. Self-adaptive genetic algorithms with simulated binary crossover. Evolutionary Computation.
20. A.E. Eiben. Evolutionary algorithms and constraint satisfaction: Definitions, survey, methodology, and research directions. In L. Kallel, B. Naudts, and A. Rogers, editors, Theoretical Aspects of Evolutionary Computing, pages 13-58. Springer, Berlin, Heidelberg, New York, 2001.
21. A.E. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124-141, 1999.
22. A.E. Eiben, B. Jansen, Z. Michalewicz, and B. Paechter. Solving CSPs using self-adaptive constraint weights: How to prevent EAs from cheating. In Whitley et al. [81], pages 128-134.
23. A.E. Eiben, P.-E. Rauè, and Z. Ruttkay. GA-easy and GA-hard constraint satisfaction problems. In M. Meyer, editor, Proceedings of the ECAI-94 Workshop on Constraint Processing, number 923 in LNCS, pages 267-284. Springer, Berlin, Heidelberg, New York, 1995.
24. A.E. Eiben and Z. Ruttkay. Self-adaptivity for constraint satisfaction: Learning penalty functions. In ICEC-96 [43], pages 258-261.
25. A.E. Eiben and J.E. Smith. Introduction to Evolutionary Computation Springer, 2003.
26. A.E. Eiben and J.K. van der Hauw. Solving 3-SAT with adaptive genetic algorithms. In ICEC-97 [44], pages 81-86.
27. A.E. Eiben and J.I. van Hemert. SAW-ing EAs: Adapting the fitness function for solving constrained problems. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, Chapter 26, pages 389-402. McGraw Hill, London, 1999.
28. L.J. Eshelman, editor. Proceedings of the 6th International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco, 1995.
29. D.B. Fogel. Evolutionary Computation. IEEE Press, 1995.
30. D.B. Fogel and J.W. Atmar. Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems. Biological Cybernetics, 63(2):111-114, 1990.
31. S. Forrest, editor. Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco, 1993.
32. B. Friesleben and M. Hartfelder. Optimisation of genetic algorithms by genetic algorithms. In R.F. Albrecht, C.R. Reeves, and N.C. Steele, editors, Artifical Neural Networks and Genetic Algorithms, pages 392-399. Springer, Berlin, Heidelberg, New York, 1993.
33. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
34. J.J. Grefenstette. Optimisation of control parameters for genetic algorithms. IEEE Transaction on Systems, Man and Cybernetics, 16(1):122-128, 1986.
35. N. Hansen, S. Müller, and P. Koumoutsakos. Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES). Evolution Computation, 11(1), 2003.
36. N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaption. In ICEC96, pages 312-317. IEEE Press, 1996.
37. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195, 2001.
38. N. Hansen, A. Ostermeier, and A. Gawelczyk. On the adaptation of arbitrary normal mutation distributions in evolution strategies: The generating set adaptation. In Eshelman [28], pages 57-64.
39. J. Hesser and R. Manner. Towards an optimal mutation probablity in genetic algorithms. In H.-P. Schwefel and R. Männer, editors, Proceedings of the 1st Conference on Parallel Problem Solving from Nature, number 496 in Lecture Notes in Computer Science, pages 23-32. Springer, Berlin, Heidelberg, New York, 1991.
40. R. Hinterding, Z. Michalewicz, and A.E. Eiben. Adaptation in evolutionary computation: A survey. In ICEC-97 [44].
41. R. Hinterding, Z. Michalewicz, and T.C. Peachey. Self-adaptive genetic algorithm for numeric functions. In Voigt et al. [80], pages 420-429.
42. Proceedings of the First IEEE Conference on Evolutionary Computation IEEE Press, Piscataway, NJ, 1994.
43. Proceedings of the 1996 IEEE Conference on Evolutionary Computation IEEE Press, Piscataway, NJ, 1996.
44. Proceedings of the 1997 IEEE Conference on Evolutionary Computation. IEEE Press, Piscataway, NJ, 1997.
45. A. Jain and D.B. Fogel. Case studies in applying fitness distributions in evolutionary algorithms. II. comparing the improvements from crossover and gaussian mutation on simple neural networks. In X. Yao and D.B. Fogel, editors, Proc. of the 2000 IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks, pages 91-97. IEEE Press, 2000.
46. J.A. Joines and C.R. Houck. On the use of non-stationary penalty functions to solve nonlinear constrained optimisation problems with ga's. In ICEC-94 [42], pages 579-584.
47. B.A. Julstrom. What have you done for me lately?: Adapting operator probabilities in a steady-state genetic algorithm. In Eshelman [28], pages 81-87.
48. Y. Kakuza, H. Sakanashi, and K. Suzuki. Adaptive search strategy for genetic algorithms with additional genetic algorithms. In Männer and Manderick [56], pages 311-320.
49. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated anealing. Science, 220:671-680, 1983.
50. N. Krasnogor and J.E. Smith. A memetic algorithm with self-adaptive local search: TSP as a case study. In Whitley et al. [81], pages 987-994.
51. N. Krasnogor and J.E. Smith. Emergence of profitable search strategies based on a simple inheritance mechanism. In Spector et al. [77], pages 432-439.
52. M. Lee and H. Takagi. Dynamic control of genetic algorithms using fuzzy logic techniques. In Forrest [31], pages 76-83.
53. J. Lis. Parallel genetic algorithm with dynamic control parameter. In ICEC-96 [43], pages 324-329.
54. J. Lis and M. Lis. Self-adapting parallel genetic algorithm with the dynamic mutation probability, crossover rate, and population size. In J. Arabas, editor, Proceedings of the First Polish Evolutionary Algorithms Conference, pages 79- 86. Politechnika Warszawska, Warsaw, 1996.
55. S.W. Mahfoud. Boltzmann selection. In Bäck et al. [12], pages C2.5:1-4.
56. R. Männer and B. Manderick, editors. Proceedings of the 2nd Conference on Parallel Problem Solving from Nature. North-Holland, Amsterdam, 1992.
57. K.E. Mathias and L.D. Whitley. Remapping hyperspace during genetic search: Canonical delta folding. In L.D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 167-186. Morgan Kaufmann, San Francisco, 1993.
58. K.E. Mathias and L.D. Whitley. Changing representations during search: A comparative study of delta coding. Evolutionary Computation, 2(3):249-278, 1995.
59. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, Heidelberg, New York, 3rd edition, 1996.
60. Z. Michalewicz and M. Schoenauer. Evolutionary algorithms for constrained parameter optimisation problems. Evolutionary Computation 4(1):1-32, 1996.
61. J.D. Schaffer, editor. Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco, 1989.
62. J.D. Schaffer, R.A. Caruana, L.J. Eshelman, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimisation. In Schaffer [61], pages 51-60.
63. J.D. Schaffer and L.J. Eshelman. On crossover as an evolutionarily viable strategy. In Belew and Booker [15], pages 61-68.
64. D. Schlierkamp-Voosen and H. Mühlenbein. Strategy adaptation by competing subpopulations. In Y. Davidor, H.-P. Schwefel, and R. Männer, editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in Lecture Notes in Computer Science, pages 199-209. Springer, Berlin, Heidelberg, New York, 1994.
65. H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, volume 26 of ISR. Birkhaeuser, Basel/ Stuttgart, 1977.
66. H.-P. Schwefel. Numerical Optimisation of Computer Models. Wiley, New York, 1981.
67. J.E. Smith. Self Adaptation in Evolutionary Algorithms. PhD thesis, University of the West of England, Bristol, UK, 1998.
68. J.E. Smith. Modelling GAs with self-adaptive mutation rates. In Spector et al. [77], pages 599-606.
69. J.E. Smith. On appropriate adaptation levels for the learning of gene linkage. J. Genetic Programming and Evolvable Machines, 3(2):129-155, 2002.
70. J.E. Smith. Parameter perturbation mechanisms in binary coded gas with selfadaptive mutation. In Rowe, Poli, DeJong, and Cotta, editors, Foundations of Genetic Algorithms 7, pages 329-346. Morgan Kaufmann, San Francisco, 2003.
71. J.E. Smith and T.C. Fogarty. Adaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm. In Voigt et al. [80], pages 441-450.
72. J.E. Smith and T.C. Fogarty. Recombination strategy adaptation via evolution of gene linkage. In ICEC-96 [43], pages 826-831.
73. J.E. Smith and T.C. Fogarty. Self adaptation of mutation rates in a steady state genetic algorithm. In ICEC-96 [43], pages 318-323.
74. J.E. Smith and T.C. Fogarty. Operator and parameter adaptation in genetic algorithms. Soft Computing, 1(2):81-87, 1997.
75. R.E. Smith and E. Smuda. Adaptively resizing populations: Algorithm, analysis and first results. Complex Systems, 9(1):47-72, 1995.
76. W.M. Spears. Adapting crossover in evolutionary algorithms. In J.R. McDonnell, R.G. Reynolds, and D.B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 367-384. MIT Press, Cambridge, MA, 1995.
77. L. Spector, E. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001). Morgan Kaufmann, San Francisco, 2001.
78. C.R. Stephens, I. Garcia Olmedo, J. Moro Vargas, and H. Waelbroeck. Self-adaptation in evolving systems. Artificial life, 4:183-201, 1998.
79. G. Syswerda. A study of reproduction in generational and steady state genetic algorithms. In G. Rawlins, editor, Foundations of Genetic Algorithms, pages 94-101. Morgan Kaufmann, San Francisco, 1991.
80. H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors. Proceedings of the 4th Conference on Parallel Problem Solving from Nature, number 1141 in Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, New York, 1996.
81. D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000). Morgan Kaufmann, San Francisco, 2000.
82. L.D. Whitley, K.E. Mathias, and P. Fitzhorn. Delta coding: An iterative search strategy for genetic algorithms,. In Belew and Booker [15], pages 77-84.
83. D.H. Wolpert and W.G. Macready. No Free Lunch theorems for optimisation. IEEE Transactions on Evolutionary Computation, 1(1):67-82, 1997.
84. B. Zhang and H. Mühlenbeim. Balancing accuracy and parsimony in genetic programming. Evolutionary Computing, 3(3):17-38, 1995.