Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the impact of objective function transformations on evolutionary and black-box algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
How randomized search heuristics find maximum cliques in planar graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
Evolutionary Computation
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
Quantifying ruggedness of continuous landscapes using entropy
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analysis of an asymmetric mutation operator
Evolutionary Computation
Theoretical analysis of local search in software testing
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
Black-box search by unbiased variation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
General lower bounds for the running time of evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Tight bounds for blind search on the integers and the reals
Combinatorics, Probability and Computing
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science
Illustration of fairness in evolutionary multi-objective optimization
Theoretical Computer Science
Using markov-chain mixing time estimates for the analysis of ant colony optimization
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Non-uniform mutation rates for problems with unknown solution lengths
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Black-box complexities of combinatorial problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Too fast unbiased black-box algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Memory-restricted black-box complexity of OneMax
Information Processing Letters
General lower bounds for evolutionary algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Information perspective of optimization
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Running time analysis of Ant Colony Optimization for shortest path problems
Journal of Discrete Algorithms
Lower bounds for randomized direct search with isotropic sampling
Operations Research Letters
Reducing the arity in unbiased black-box complexity
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Lower bounds for hit-and-run direct search
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Black-box complexities of combinatorial problems
Theoretical Computer Science
Black-Box complexity: breaking the O(n logn) barrier of leadingones
EA'11 Proceedings of the 10th international conference on Artificial Evolution
Scalability of population-based search heuristics for many-objective optimization
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Lessons from the black-box: fast crossover-based genetic algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Black-box complexity: from complexity theory to playing mastermind
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.01 |
Randomized search heuristics like local search, tabu search, simulated annealing, or all kinds of evolutionary algorithms have many applications. However, for most problems the best worst-case expected run times are achieved by more problem-specific algorithms. This raises the question about the limits of general randomized search heuristics. Here a framework called black-box optimization is developed. The essential issue is that the problem but not the problem instance is knownto the algorithm which can collect information about the instance only by asking for the value of points in the search space. All known randomized search heuristics fit into this scenario. Lower bounds on the black-box complexity of problems are derived without complexity theoretical assumptions and are compared with upper bounds in this scenario.