Adapti ve Selection of Heuristics within a GRASP for Exam Timetabling Problems

@inproceedings{Burke2009AdaptiVS,
  title={Adapti ve Selection of Heuristics within a GRASP for Exam Timetabling Problems},
  author={Edmund K. Burke and Rong Qu and Amr Soghier},
  year={2009}
}
In this paper, we describe the development of a Greedy Random Adaptive Search Procedure (GRASP) where two low-level graph heuristics, Saturation Degree (SD) and Largest Weighted Degree (LWD) are dynamically hybridised in the construction phase to construct solutions for exam timetabling problems. The problem is initially solved using an intelligent adaptive LWD and SD graph hyper-heuristic which constructs the restricted can- didate list (RCL) in the first phase of GRASP. It is observed that… CONTINUE READING

Figures and Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Hyper-Heuristics for Educational Timetabling

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Hyper-Heuristics: Theory and Applications

  • Natural Computing Series
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

Greedy Randomized Adaptive Search Procedures

  • Encyclopedia of Optimization
  • 2009
VIEW 1 EXCERPT

Search Methodologies: Introductory Tutorials in Optimisation and Decision Support

E. K. Burke, G. Kendall, editors
  • 2005
VIEW 1 EXCERPT