Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space.
José Carlos Ortiz-BaylissHugo Terashima-MarínEnder OzcanAndrew J. ParkesSantiago E. Conant-PablosPublished in: IEEE Congress on Evolutionary Computation (2013)
Keyphrases
- hyper heuristics
- constraint satisfaction problems
- search space
- constraint satisfaction
- examination timetabling
- graph coloring
- constraint propagation
- genetic programming
- constraint programming
- np complete
- non binary
- evolutionary algorithm
- np hard
- combinatorial problems
- heuristic search
- timetabling problem
- arc consistency
- constraint networks
- search procedure
- sat problem
- constraint problems
- tabu search
- metaheuristic
- search algorithm
- forward checking
- partial constraint satisfaction
- soft constraints
- search strategy
- difficult problems
- heuristic methods
- global constraints
- fitness function
- upper bound
- backtracking search
- scheduling problem
- finding optimal solutions
- lower bound