Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems
This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solutions. The heuristic permutations are then used to...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Online Access: | https://eprints.nottingham.ac.uk/375/ |