Parameter setting in EAs: A 30 year perspective

Studies in Computational Intelligence

Volumn 54, Issue , 2007, Pages 1-18

  De Jong, Kenneth ^a  

^a George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34147150773     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-69432-8_1     Document Type: Review

References (44)

1. L. Altenberg. The schema theorem and Price's theorem. In M. Vose and D. Whitley, editors, Foundations of Genetic Algorithms 3, pages 23-49. Morgan Kaufmann, 1994.
2. J. Arabas, Z. Michalewitz, and J. Mulawka. Gavaps - a genetic algorithm with varying population size. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 73-78. IEEE Press, 1994.
3. T. Bac̈k. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
4. T.Bac̈k. On the behavior of evolutionary algorithms in dynamic fitness landscapes. In IEEE International Conference on Evolutionary Computation, pages 446-451. IEEE Press, 1998.
5. J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer, Boston, 2002.
6. L. Davis. Adapting operator probabilities in genetic algorithms. In Third International Conference on Genetic Algorithms, pages 61-69. Morgan Kaufmann, 1989.
7. L. Davis. The Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
8. K. De Jong. Analysis of Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI, 1975.
9. K. De Jong. Evolutionary Computation: A Unified Approach. MIT Press, Cambridge, MA, 2006.
10. K. De Jong and W. Spears. A formal analysis of the role of multi-point crossover in genetic algorithms. Annals of Mathematics and Artificial Intelligence, 5(1): 1-26, 1992.
11. A. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124-141, 1999.
12. A. Eiben, E. Marchiori, and V. Valko. Evolutionary algorithms with on-the-fly population size adjustment. In X. Yao et al., editor, Proceedings of PPSN VIII, pages 41-50. Springer-Verlag, 2004.
13. A. Eiben, M. Schut, and A. de Wilde. Is self-adaptation of selection pressure and population size possible? In T. Runarsson et al., editor, Proceedings of PPSN VIII, pages 900-909. Springer-Verlag, 2006.
14. L. Eshelman. The CHC adaptive search algorithm. In G. Rawlins, editor, Foundations of Genetic Algorithms 1, pages 265-283. Morgan Kaufmann, 1990.
15. S. Ficici and J. Pollack. Game-theoretic investigation of selection methods used in evolutionary algorithms. In D. Whitley, editor, Proceedings of CEC 2000, pages 880-887. IEEE Press, 2000.
16. L. Fogel, P. Angeline, and D. Fogel. An evolutionary programming approach to self-adaptation on finite state machines. In J. McDonnell, R. Reynolds, and D. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 355-365. MIT Press, 1995.
17. L.J. Fogel, A.J. Owens, and M.J.Walsh. Artificial Intelligence through Simulated Evolution. John Wiley & Sons, New York, 1966.
18. D. Goldberg. The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer, Boston, 2002.
19. D. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In G. Rawlins, editor, Proceedings of the First Workshop on Foundations of Genetic Algorithms, pages 69-92. Morgan Kaufmann, 1990.
20. D. Goldberg, K. Deb, and J. Clark. Accounting for noise in sizing of populations. In D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 127-140. Morgan Kaufmann, 1992.
21. D. Goldberg, K. Deb, and B. Korb. Don't worry, be messy. In R. K. Belew and L. B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 24-30. Morgan Kaufmann, 1991.
22. J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16(1):122-128, 1986.
23. N. Hansen and A. Ostermeier. Completely derandomized step-size adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195, 2001.
24. J.H. Holland. Outline for a logical theory of adaptive systems. JACM 9:297-314, 1962.
25. J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.
26. T. Jansen, K. De Jong, and I. Wegener. On the choice of offspring population size in evolutionary algorithms. Evolutionary Computation 13(4):413-440, 2005.
27. Thomas Jansen and Kenneth De Jong. An analysis of the role of offspring population size in EAs. In W. B. Langdon et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pages 238-246. Morgan Kaufman, 2002.
28. T. Jones. Evolutionary algorithms, fitness landscapes, and search. PhD thesis, University of New Mexico, 1995.
29. C. Lima and F. Lobo. Parameter-less optimization with the extended compact genetic algorithm and iterated local search. In K. Deb et al, editor, Proceedings of GECCO-2004, pages 1328-1339. Springer-Verlag, 2004.
30. S. Luke, G. Balan, and L. Panait. Population implosion in genetic programming. In Proceedings of GECCO-2003, volume 2724, pages 1729-1739. Springer LNCS Series, 2003.
31. B. Manderick, M. de Weger, and P. Spiessens. The genetic algorithm and the structure of the fitness landscape. In R. K. Belew and L. B. Booker, editors, The Fourth International Conference on Genetic Algorithms and Their Applications, pages 143-150. Morgan Kaufmann, 1991.
32. R. Morrison. Designing Evolutionary Algorithms for Dynamic Environments. Springer-Verlag, Berlin, 2004.
33. George Price. Selection and covariance. Nature, 227:520-521, 1970.
34. I. Rechenberg. Cybernatic solution path of an experimental problem. In Library Translation 1122. Royal Aircraft Establishment, Farnborough, 1965.
35. I. Rechenberg. Evolutionsstrategie '94. Frommann-Holzboog, Stuttgart, 1994.
36. H.-P. Schwefel. Evolutionsstrategie und numerishe Optimierung. PhD thesis, Technical University of Berlin, Berlin, Germany, 1975.
37. H.-P. Schwefel. Evolution and Optimum Seeking. John Wiley & Sons, New York, 1995.
38. C. Shaefer. The ARGOT strategy: Adaptive representation genetic optimizer technique. In J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 50-58. Lawrence Erlbaum, 1987.
39. R. Smith. Adaptively resizing populations: An algorithm and analysis. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms and their Applications, page 653. Morgan Kaufmann, 1993.
40. W. Spears and K. De Jong. On the virtues of parameterized uniform crossover. In R. K. Belew and L. B. Booker, editors, International Conference on Genetic Algorithms, volume 4, pages 230-236. Morgan Kaufmann, 1991.
41. W.M. Spears. Adapting crossover in evolutionary algorithms. In J. McDonnell, R. Reynolds, and D.B. Fogel, editors, Proceedings of the Fourth Conference on Evolutionary Programming, pages 367-384. MIT Press, 1995.
42. D. Whitley. The Genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms pages 116-121. Morgan Kaufmann, 1989.
43. D. Whitley, K. Mathias, and P. Fitzhorn. Delta coding: An iterative search strategy for genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proceeding of the Fourth International Conference on Genetic Algorithms, pages 77-84. Morgan Kaufmann, 1991.
44. D. Wolpert and W. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1:67-82, 1997