Boosting genetic algorithms with self-adaptive selection

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 477-482

  Eiben, A E ^a   Schut, M C ^a   De Wilde, A R ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOLTZMANN MECHANISM; SELF-ADAPTIVE SELECTION; SUPERIMPOSED PARAMETERS;

BOLTZMANN EQUATION; COMPUTATION THEORY; GENETIC ALGORITHMS; PARAMETER ESTIMATION; USER INTERFACES;

ADAPTIVE SYSTEMS;

EID: 34547275767     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. E.H.L. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. Wiley, Chichester, UK, 1989.
2. 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, 2000.
3. T. Bäck, D.B. Fogel, and Z. Michalewicz, editors. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol, 2000.
4. Th. Bäck and M. Schütz. Intelligent mutation rate control in canonical genetic algorithms. In Zbigniew W. Ras and Maciej Michalewicz, editors, Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, volume 1079 of Lecture Notes in Computer Science, pages 158-167. Springer, Berlin, Heidelberg, New York, 1996.
5. A. Dukkipati, N. M. Musti, and S. Bhatnagar. Cauchy annealing schedule: An annealing schedule for boltzmann selection scheme in evolutionary algorithms. pages 55-62.
6. A.E. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2): 124-141, 1999.
7. A.E. Eiben, E. Marchiori, and V.A. Valko. Evolutionary Algorithms with on-the-fly Population Size Adjustment. In X. Yao et al., editor, Parallel Problem Solving from Nature, PPSN VIII, number 3242 in Lecture Notes in Computer Science, pages 41-50. Springer, Berlin, Heidelberg, New York, 2004.
8. A.E. Eiben and J.E. Smith. Introduction to Evolutionary Computing. Springer, 2003.
9. D.B. Fogel. Other selection methods. In Bäck et al. [3], chapter 27, pages 201-204.
10. L. Gonzalez and J. Cannady. A self-adaptive negative selection approach for anomaly detection. In 2004 Congress on Evolutionary Computation (CEC'2004), pages 1561-1568. IEEE Press, Piscataway, NJ, 2004.
11. P.J.B. Hancock. A comparison os selection mechanisms. In Bäck et al. [3], chapter 29, pages 212-227.
12. N. Hansen, A. Gawelczyk, and A. Ostermeier. Sizing the population with respect to the local progress in (1, lambda)-evolution strategies. In Proceedings of the IEEE Conference on Evolutionary Computation, pages 80-85. IEEE Press, 1995. (Authors in alphabetical order).
13. G. Hardin. The tradegy of the commons. Science, 162:1243-1248, December 1968.
14. M. Herdy. The number of offspring as a strategy parameters in hierarchically organized evolution strategies. ACM SIGBIO Newsletter, 13(2):2-9, 1993.
15. S.W. Mahfoud. Boltzmann selection. In Back et al. [3], chapter 26, pages 195-200.
16. E. Poupaert and Y. Deville. Acceptance driven local search and evolutionary algorithms. In 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), pages 1173-1180. Morgan Kaufmann, 2001.
17. W.M. Spears. Evolutionary Algorithms: the role of mutation and recombination. Springer, Berlin, Heidelberg, New York, 2000.
18. E. Zitzler and S. Künzli. Indicator-based selection in multiobjective search. In E.K. Burke X. Yao, J.A. Lozano, J. Smith, J.J.M. Guervos, J.A. Bullinaria, J.E. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel, editors, PPSN, number 3242 in Lecture Notes in Computer Science, pages 832-842. Springer, Berlin, Heidelberg, New York, 2004.