Black-box search by unbiased variation

Algorithmica

Volumn 64, Issue 4, 2012, Pages 623-642

  Lehre, Per Kristian ^a   Witt, Carsten ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Black box complexity; Runtime analysis

Indexed keywords

BENCH-MARK PROBLEMS; BLACK BOXES; BLACK-BOX COMPLEXITY; BLACK-BOX MODEL; COMPLEXITY THEORY; LOCAL SEARCH; LOWER BOUNDS; OPTIMISATIONS; PSEUDO-BOOLEAN FUNCTION; RUN-TIME ANALYSIS; RUNTIMES; SEARCH HEURISTICS; UNIMODAL FUNCTIONS; VARIATION OPERATOR; WORKING PRINCIPLES;

BOOLEAN FUNCTIONS; SIMULATED ANNEALING;

HEURISTIC ALGORITHMS;

EID: 84868359214     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-012-9616-8     Document Type: Article

References (35)

1. Anil, G., Wiegand, R.P.: Black-box search by elimination of fitness functions: Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA'09), pp. 67-78. ACM Press, New York (2009)
2. Böttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the leadingones problem: Proceedings of the 11th international conference on Parallel Problem Solving from Nature (PPSN'10), pp. 1-10. Springer, Berlin (2010)
3. Cathabard, S., Lehre, P.K., Yao, X.: Non-uniform mutation rates for problems with unknown solution lengths: Proceedings of the 11th International Workshop on Foundations of Genetic Algorithms (FOGA'11), pp. 173-180. ACM, New York (2011)
4. Chvátal, V.: The tail of the hypergeometric distribution. Discrete Math. 25(3), 285-287 (1979)
5. Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO'10), pp. 1457-1464. ACM, New York (2010)
6. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
7. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1 + 1) Evolutionary Algorithm. Theor. Comput. Sci. 276, 51-81 (2002)
8. Droste, S., Jansen, T.,Wegener, I.: Upper and lower bounds for randomized search heuristics in blackbox optimization. Theory Comput. Syst. 39(4), 525-544 (2006)
9. Droste, S.,Wiesmann, D.: Metric based evolutionary algorithms: Proceedings of Genetic Programming, European Conference. LNCS, vol. 1802, pp. 29-43. Springer, Berlin (2000)
10. Fournier, H., Teytaud, O.: Lower bounds for comparison based evolution strategies using VCdimension and sign patterns. Algorithmica 59, 387-408 (2011)
11. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), pp. 415- 426 (2003)
12. Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 13(3), 502-525 (1982)
13. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1) (2004)
14. Jägersküpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theor. Comput. Sci. 39(3), 329-347 (2007)
15. Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13(4), 413-440 (2005)
16. Jansen, T., Sudholt, D.: Analysis of an asymmetric mutation operator. Evol. Comput. 18, 1-26 (2010)
17. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79-100 (1988)
18. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Mateo (2001)
19. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
20. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic, Dordrecht (2002)
21. Lehre, P.K., Witt, C.: Black-box search by unbiased variation: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO'10), pp. 1441-1448. ACM, New York (2010)
22. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
23. Neumann, F.,Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1), 32-40 (2007)
24. Neumann, F., Witt, C.: Ant colony optimization and the minimum spanning tree problem: Proceedings of Learning and Intelligent Optimization (LION'08), pp. 153-166 (2008)
25. Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity, 1st edn. Springer, New York (2010)
26. Oliveto, P.S., Lehre, P.K., Neumann, F.: Theoretical analysis of rank-based mutation - combining exploration and exploitation: Proceedings of the 10th IEEE Congress on Evolutionary Computation (CEC'09), pp. 1455-1462. IEEE, New York (2009)
27. Rowe, J.E., Vose, M.D.: Unbiased black box search algorithms: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation (GECCO'11), pp. 2035-2042. ACM, New York (2011)
28. Rowe, J.E., Vose, M.D., Wright, A.H.: Neighborhood graphs and symmetric genetic operators: Proceedings of the 9th International Workshop on Foundations of Genetic Algorithms (FOGA'07). LNCS, vol. 4436, pp. 110-122 (2007)
29. Sudholt, D.: General lower bounds for the running time of evolutionary algorithms: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN'10), pp. 124-133. Springer, Berlin (2010)
30. Teytaud, O., Gelly, S.: General lower bounds for evolutionary algorithms: Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN'06). LNCS, vol. 4193, pp. 21-31. Springer, Berlin (2006)
31. Teytaud, O., Gelly, S., Mary, J.: On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy: Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN'06). LNCS, vol. 4193, pp. 32-41. Springer, Berlin (2006)
32. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization, pp. 349-369. Kluwer Academic, Dordrecht (2002)
33. Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Comb. Probab. Comput. 14(1), 225-247 (2005)
34. Witt, C.: Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions. Evol. Comput. 14(1), 65-86 (2006)
35. Zarges, C.: Theoretical foundations of artificial immune systems. PhD thesis, Technische Universität Dortmund (2011)