The lower bounds on the runtime of the (1 + (λ, λ)) GA on the minimum spanning tree problem.
Matvey ShnytkinDenis AntipovPublished in: GECCO Companion (2021)
Keyphrases
- lower bound
- genetic algorithm ga
- upper bound
- genetic algorithm
- fitness function
- branch and bound algorithm
- branch and bound
- objective function
- quadratic assignment problem
- upper and lower bounds
- lower and upper bounds
- np hard
- hybrid genetic algorithm
- multi objective
- hybrid algorithm
- evolutionary algorithm
- hybrid particle swarm optimization
- hybrid ga
- optimization method
- neural network
- ant colony optimization
- genetic programming
- worst case
- particle swarm optimization pso
- simulated annealing
- optimal solution
- genetic operators
- set of randomly generated instances
- tabu search
- metaheuristic
- linear programming relaxation
- lower bounding
- parallel genetic algorithm
- polynomial approximation
- messy genetic algorithm