Adaptive linear combination of heuristic orderings in constructing examination timetables
In this paper, we investigate adaptive linear combinations of graph coloring heuristics with a heuristic modifier to address the examination timetabling problem. We invoke a normalisation strategy for each parameter in order to generalise the specific problem data. Two graph coloring heuristics were...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Published: |
Elsevier
2014
|
| Online Access: | https://eprints.nottingham.ac.uk/3386/ |