Theoretical analysis of diversity mechanisms for global exploration

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 945-952

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

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

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

Indexed keywords

COMPUTER SCIENCE; NATURAL RESOURCES EXPLORATION;

DETERMINISTIC CROWDING; DIVERSITY; FITNESS SHARING; GLOBAL EXPLORATION; RUN-TIME ANALYSIS; SEARCH SPACES; TEST FUNCTIONS;

EVOLUTIONARY ALGORITHMS;

EID: 57349164275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389276     Document Type: Conference Paper

References (18)

1. N. Chaiyaratana, T. Piroonratana, and N. Sangkawelert. Effects of diversity control in single-objective and multi-objective genetic algorithms. Journal of Heuristics, 13(1):1-34, 2007.
2. S. Fischer and I. Wegener. The one-dimensional Ising model: Mutation versus recombination. Theoretical Computer Science, 344(2-3):208-225, 2005.
3. T. Friedrich, N. Hebbinghaus, and F. Neumann. Rigorous analyses of simple diversity mechanisms. In Proc. of GECCO '07, pages 1219-1225. ACM Press, 2007.
4. O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. of STACS '03, pages 415-426. Springer, 2003.
5. D. E. Goldberg, C. Van Hoyweghen, and B. Naudts. From twomax to the Ising model: Easy and hard symmetrical problems. In Proc. of GECCO '02, pages 626-633. Morgan Kaufmann, 2002.
6. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14:502-525, 1982.
7. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1) :57-85, 2001.
8. T. Jansen and I. Wegener. 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, 2001.
9. T. Jansen and I. Wegener. Real royal road functions: where crossover provably is essential. Discrete Applied Mathematics, 149(1-3):111-125, 2005.
10. S. W. Mahfoud. Niching methods. In T. Back, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages C6.1:1-4. Institute of Physics Publishing and Oxford University Press, Bristol, New York, 1997.
11. P. Oliveto, J. He, and X. Yao. Population-based evolutionary algorithms for the vertex cover problem. In Proc. of CEC '08, 2008.
12. P. S. Oliveto, J. He, and X. Yao. Computational complexity analysis of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281-293, 2007.
13. M. Pelikan and D. E. Goldberg. Genetic algorithms, clustering, and the breaking of symmetry. In Proc. of PPSN VI, pages 385-394. Springer, 2000.
14. T. Storch and I. Wegener. Real royal road functions for constant population size. Theoretical Computer Science, 320:123-134, 2004.
15. D. Sudholt. Crossover is provably essential for the Ising model on trees. In Proc. of GECCO '05, pages 1161-1167. ACM Press, 2005.
16. D. Sudholt. Memetic algorithms with variable-depth search to overcome local optima. In Proc. of GECCO '08, 2008. To appear.
17. R. K. Ursem. Diversity-guided evolutionary algorithms. In Proc. of PPSN VII, pages 462-471. Springer, 2002.
18. C. Witt. Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14(1):65-86, 2006.