When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not.
Andrei LissovoiPietro S. OlivetoJohn Alasdair WarwickerPublished in: Artif. Intell. (2023)
Keyphrases
- evolutionary algorithm
- hyper heuristics
- simulated annealing
- evolutionary process
- genetic programming
- examination timetabling
- multi objective
- graph coloring
- optimization problems
- evolutionary computation
- differential evolution
- crossover operator
- fitness function
- multi objective optimization
- search procedure
- genetic algorithm
- metaheuristic
- condition action rules
- evolutionary search
- genetic operators
- cutting stock problems
- mutation operator
- evolution strategy
- solution quality
- neural network
- difficult problems
- differential evolution algorithm
- tabu search
- lower bound
- nsga ii
- timetabling problem
- memetic algorithm
- genetic algorithm ga
- combinatorial optimization
- selection algorithm