A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems.
Melissa SánchezJorge M. Cruz-DuarteJosé Carlos Ortiz-BaylissHector G. CeballosHugo Terashima-MarínIván AmayaPublished in: IEEE Access (2020)
Keyphrases
- combinatorial optimization problems
- systematic review
- hyper heuristics
- metaheuristic
- optimization problems
- evolutionary algorithm
- empirical studies
- ant colony optimization
- combinatorial optimization
- examination timetabling
- tabu search
- genetic programming
- graph coloring
- simulated annealing
- discrete optimization
- genetic algorithm
- search space
- knapsack problem
- timetabling problem
- continuous optimization problems
- cutting stock problems
- job shop scheduling
- shortest path problem
- optimal solution
- condition action rules
- traveling salesman problem
- vehicle routing problem
- combinatorial problems
- search methods
- particle swarm optimization
- difficult problems
- job shop scheduling problem
- constraint satisfaction problems
- heuristic methods
- heuristic search
- search heuristics
- search procedure
- evolutionary computation
- lower bound
- solution quality
- benchmark problems
- search procedures
- min cost
- upper bound
- computational complexity