On the utility of the multimodal problem generator for assessing the performance of evolutionary algorithms

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 2, Issue , 2006, Pages 1233-1240

  Lobo, Fernando G ^a   Lima, Cláudio F ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSIDADE DO ALGARVE   (Portugal)

Author keywords

Experimental research; Test problems

Indexed keywords

DECISION MAKING; MATHEMATICAL MODELS; MODAL ANALYSIS; PROBLEM SOLVING; STATISTICS;

EXPERIMENTAL RESEARCH; POPULATION SIZING MODELS; TEST PROBLEMS;

EVOLUTIONARY ALGORITHMS;

EID: 33750237838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144191     Document Type: Conference Paper

References (14)

1. E. Alba and J. M. Troya. Cellular evolutionary algorithms: Evaluating the influence of ratio. In H.-P. Schwefel et al., editors, Parallel Problem Solving from Nature - PPSN VI 6th International Conference, pages 29-38. Springer-Verlag, 2000.
2. K. A. De Jong, M. A. Potter, and W. M. Spears. Using problem generators to explore the effects of epistasis. In T. Bäck, editor, Proceedings of the International Conference on Genetic Algorithms (ICGA 1997), pages 338-345, San Francisco, 1997. Morgan Kaufmann.
3. A. E. Eiben, E. Marchiori, and V. A. Valko. Evolutionary algorithms with on-the-fly population size adjustment. In X. Yao et al., editors, Parallel Problem Solving from Nature PPSN VIII, LNCS 3242, pages 41-50. Springer, 2004.
4. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362, 1992.
5. Also IlliGAL Report No. 91010.
6. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-253, 1999.
7. S. Hill and C. O'Riordan. Inversion revisited - Analysis of an inversion operator using problem generators. In F. Rothlauf and D. Thierens, editors, Proceedings of the Analysis and Design of Representations and Operators (ADoRo), part of GECCO 2003, 2003.
8. J. Kennedy and W. M. Spears. Matching algorithms to problems: An experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator. In Proceedings of 1998 IEEE International Conference on Evolutionary Computation, pages 78-83, Piscataway, NJ, 1998. IEEE Press.
9. H. R. Lourenco, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 321-353, Norwell, MA, 2002. Kluwer Academic Publishers.
10. H. Mühlenbein. How genetic algorithms really work: I.Mutation and Hillclimbing. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 15-25, Amsterdam, The Netherlands, 1992. Elsevier Science.
11. H. Mühlenbein and D. Schlierkamp-Voosen. Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization. Evolutionary Computation, 1(1):25-49, 1993.
12. G. Ochoa, I. Harvey, and H. Buxton. On recombination and optimal mutation rates. In W. Banzhaf et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 488-495, San Francisco, CA, 1999. Morgan Kaufmann.
13. W. M. Spears. Evolutionary Algorithms: The role of mutation and recombination. Springer, 2002.
14. D. H. Wolpert and W. G. Macready. No Free Lunch Theorems for Optimization. IEEE Transactions, on Evolutionary Computation, 1(1):67-82, 1997.