A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems.
Lucero Ortiz-AguilarMartín CarpioAlfonso Rojas DomínguezManuel Ornelas-RodríguezHéctor José Puga SoberanesJorge Alberto Soria-AlcarazPublished in: Complex. (2021)
Keyphrases
- vehicle routing problem
- graph coloring
- hyper heuristics
- metaheuristic
- combinatorial problems
- np complete problems
- timetabling problem
- memetic algorithm
- tabu search
- combinatorial optimization
- traveling salesman problem
- routing problem
- job shop scheduling
- max sat
- combinatorial optimization problems
- constraint satisfaction problems
- optimization problems
- ant colony optimization
- simulated annealing
- exact algorithms
- heuristic methods
- search space
- job shop scheduling problem
- search strategies
- travel time
- search procedure
- np hard
- benchmark problems
- evolutionary algorithm
- genetic programming
- phase transition
- optimal solution
- scheduling problem
- np complete
- genetic algorithm
- search methods
- difficult problems
- search heuristics
- heuristic search
- search algorithm
- particle swarm optimization
- neural network
- symmetry breaking
- linear programming
- search procedures
- artificial bee colony
- constraint programming
- greedy algorithm
- knapsack problem