On the choice of the population size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3102, Issue , 2004, Pages 748-760

  Storch, Tobias ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS;

EVOLUTIONARY ALGORITHMS (EAS); NEW FUNCTIONS; OPTIMIZERS; POPULATION SIZES; RUNNING TIME;

POPULATION STATISTICS;

EID: 35048856055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_76     Document Type: Article

References (7)

1. Jansen, T. and De Jong, K. (2002). An Analysis of the Role of the Offspring Population Size in Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2002, 238-246.
2. Jansen, T. and Wegener, I. (2001a). Evolutionary Algorithms - How to Cope with Plateaus of Constant Fitness and when to Reject Strings with the Same Fitness. IEEE Transactions on Evolutionary Computation 5, 589-599.
3. Jansen, T. and Wegener, I. (2001b). On the Utility of Populations in Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2001, 1034-1041.
4. Motwani, R. and Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press, Cambridge.
5. Rudolph, G. (1997). How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time. Evolutionary Computation 4(2), 195-205.
6. Wegener, I. (2002). Methods for the Analysis of Evolutionary Algorithms on PseudoBoolean Functions. In: Barker, R., Yao, X. and Mohammadian, M. (Eds.) Evolutionary Optimization, 349-369, Kluwer, New York.
7. Witt, C. (2003). Population Size vs. Runtime of a Simple EA. Proceedings of the Congress on Evolutionary Computation (CEC) 2003, 1996-2003.