Black-box search by unbiased variation

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1441-1448

  Lehre, Per Kristián ^a   Witt, Carsten ^b  

^a UNIVERSITY OF BIRMINGHAM   (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; GAP FUNCTIONS; LOCAL SEARCH; LOWER BOUNDS; NP COMPLETE PROBLEMS; POLYNOMIAL COMPLEXITY; RUN-TIME ANALYSIS; RUNTIMES; SEARCH HEURISTICS; UNIMODAL FUNCTIONS; VARIATION OPERATOR; WORKING PRINCIPLES;

COMPUTER SIMULATION; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; SIMULATED ANNEALING;

EVOLUTIONARY ALGORITHMS;

EID: 77955871481     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830747     Document Type: Conference Paper

References (20)

1. V. Chvátal. The tail of the hypergeometric distribution. Discrete Mathematics, 25(3): 285-287, 1979.
2. M. Dorigo andT. Stützle. Ant Colony Optimization. MIT Press, 2004.
3. S. Droste, T. Jansen, andI. Wegener. On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276: 51-81, 2002.
4. S. Droste, T. Jansen, andI. Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4): 525-544, 2006.
5. S. Droste andD. Wiesmann. Metric based evolutionary algorithms. In Proceedings of Genetic Programming, European Conference, volume 1802 of LNCS, pages 29-43. Springer, 2000.
6. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 13(3): 502-525, 1982.
7. J. He andX. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1), 2004.
8. T. Jansen, K. A. D. Jong, andI. Wegener. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13(4): 413-440, 2005.
9. D. S. Johnson, C. H. Papadimitriou, andM. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37(1): 79-100, 1988.
10. J. Kennedy andR. C. Eberhart. Swarm intelligence. Morgan Kaufmann Publishers Inc., 2001.
11. S. Kirkpatrick, C. D. Gelatt, andM. P. Vecchi. Optimization by simulated annealing. Science, 220(4598): 671-680, May 1983.
12. P. Larrañaga andJ. A. Lozano. Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Academic Publishers, 2002.
13. P. K. Lehre andX. Yao. Runtime analysis of (1+1) EA on computing unique input output sequences. In Proceedings of 2007 IEEE Congress on Evolutionary Computation (CEC'07), pages 1882-1889. IEEE Press, 2007.
14. F. Neumann andI. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1): 32-40, 2007.
15. P. S. Oliveto, J. He, andX. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(1): 100-106, 2007.
16. P. S. Oliveto, P. K. Lehre, andF. Neumann. Theoretical analysis of rank-based mutation combining exploration and exploitation. In Proceedings of the 10th IEEE Congress on Evolutionary Computation (CEC '09), pages 1455-1462. IEEE, 2009.
17. P. S. Oliveto andC. Witt. Simplified drift analysis for proving lower bounds in evolutionary computation. In Proceedings of Parallel Problem Solving from Nature (PPSN'X), number 5199 in LNCS, pages 82-91, 2008.
18. J. E. Rowe, M. D. Vose, andA. H. Wright. Neighborhood graphs and symmetric genetic operators. In Proceedings of Foundations of Genetic Algorithms 9, number 4436 in LNCS, pages 110-122, 2007.
19. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, M. Mohammadian, and X. Yao, editors, Evolutionary Optimization, pages 349-369. Kluwer, 2002.
20. C. Witt. Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14(1):65-86, 2006.