Analysis of diversity-preserving mechanisms for global exploration

Evolutionary Computation

Volumn 17, Issue 4, 2009, Pages 455-476

  Friedrich, Tobias ^a   Oliveto, Pietro S ^b   Sudholt, Dirk ^a,c   Witt, Carsten ^c,d  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c TU DORTMUND UNIVERSITY   (Germany)

^d TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Deterministic crowding; Diversity; Exploration; Fitness sharing; Runtime analysis

Indexed keywords

ALGORITHM; ARTICLE; COMPARATIVE STUDY; COMPUTER ANALYSIS;

ALGORITHMS; COMPUTING METHODOLOGIES;

EID: 72249120471     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2009.17.4.17401     Document Type: Article

References (22)

1. Chaiyaratana, N., Piroonratana, T., and Sangkawelert, N. (2007). Effects of diversity control in single-objective and multi-objective genetic algorithms. Journal of Heuristics, 13(1):1-34.
2. Fischer, S., and Wegener, I. (2005) The one-dimensional Ising model: Mutation versus recombination. Theoretical Computer Science, 344(2-3):208-225.
3. Friedrich, T., Hebbinghaus, N., and Neumann, F. (2007). Rigorous analyses of simple diversity mechanisms. In Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO '07), pp. 1219-1225.
4. Friedrich, T., Oliveto, P. S., Sudholt, D., and Witt, C. (2008). Theoretical analysis of diversity mechanisms for global exploration. In Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO '08), pp. 945-952.
5. Goldberg, D. E., Van Hoyweghen, C., and Naudts, B. (2002). From twomax to the Ising model: Easy and hard symmetrical problems. In Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO '02), pp. 626-633.
6. Hajek, B. (1982). Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14:502-525.
7. He, J., and Yao, X. (2004). A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35.
8. Hutter, M., and Legg, S. (2006). Fitness uniform optimization. IEEE Transactions on Evolutionary Computation, 10:568-589.
9. Jansen, T., and Wegener, I. (2001). Evolutionary algorithms: How to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5(6):589-599.
10. Jansen, T., and Wegener, I. (2005). Real royalroadfunctions:Where crossover provablyis essential. Discrete Applied Mathematics, 149(1-3):111-125.
11. Mahfoud, S. W. (1997). Niching methods. In T. Bäck, D. B. Fogel, and Z. Michalewicz (Eds.), Handbook of evolutionary computation (pp. C6.1:1-4). Bristol, UK: Institute of Physics Publishing and New York: Oxford University Press.
12. Motwani, R., and Raghavan, P. (1995). Randomized algorithms. Cambridge, UK: Cambridge University Press.
13. Oliveto, P. S., He, J., and Yao, X. (2007). Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281-293.
14. Oliveto, P. S., He, J., and Yao, X. (2008). Population-based evolutionary algorithms for the vertex cover problem. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC' 08), pp. 1563-1570.
15. Oliveto, P. S., and Witt, C. (2008). Simplified drift analysis for proving lower bounds in evolutionary computation. In Proceedings of the International Conference on Parallel Problem Solving From Nature (PPSN X), Vol. 5199 of LNCS, pp. 82-91. Berlin: Springer.
16. Pelikan, M., and Goldberg, D. E. (2000). Genetic algorithms, clustering, and the breaking of symmetry. In Proceedings of the International Conference on Parallel Problem Solving From Nature (PPSN VI), pp. 385-394.
17. Storch, T., and Wegener, I.(2004). Real royal road functions for constant population size. Theoretical Computer Science, 320:123-134.
18. Sudholt, D. (2005). Crossover is provably essential for the Ising model on trees. In Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO'05), pp. 1161-1167.
19. Sudholt, D. (2008). Memetic algorithms with variable-depth search to overcome local optima. In Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO '08), pp. 787-794.
20. Ursem, R. K. (2002). Diversity-guided evolutionary algorithms. In Proceedings of the International Conference on Parallel Problem Solving From Nature (PPSN VII), pp. 462-471.
21. Wegener, I., and Witt, C. (2005). On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing, 14:225-247.
22. Witt, C. (2006). Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14(1):65-86.