Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.
Benjamin DoerrPublished in: Evol. Comput. (2021)
Keyphrases
- evolutionary algorithm
- lower bound
- multi objective
- upper bound
- optimization problems
- evolutionary computation
- positive and negative
- multi objective optimization
- branch and bound
- branch and bound algorithm
- genetic programming
- mutation operator
- differential evolution
- np hard
- differential evolution algorithm
- objective function
- vc dimension
- fitness function
- simulated annealing
- genetic algorithm
- evolution strategy
- concept drift
- nsga ii
- worst case
- optimal solution
- lower and upper bounds
- evolutionary process
- genetic operators
- optimization algorithm
- evolutionary search
- multiobjective optimization
- upper and lower bounds
- initial population
- statistical queries
- knapsack problem
- evolvable hardware
- optimal cost