Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
From MaRDI portal
Recommendations
- A graph-based hyper-heuristic for educational timetabling problems
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- A review of hyper-heuristics for educational timetabling
- Adaptive selection of heuristics for improving exam timetables
Cited in
(16)- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Solving the examination timetabling problem in GPUs
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- Hyper-heuristic approaches for the response time variability problem
- A graph-based hyper-heuristic for educational timetabling problems
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- A review of hyper-heuristics for educational timetabling
- Operational research in education
- A simulated annealing hyper-heuristic methodology for flexible decision support
- Memetic techniques for examination timetabling
- Adaptive selection of heuristics for improving exam timetables
- A survey of search methodologies and automated system development for examination timetabling
- A multi-objective evolutionary algorithm for examination timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
This page was built for publication: Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161783)