A step counting hill climbing algorithm applied to university examination timetabling
DOI10.1007/S10951-016-0469-XzbMATH Open1347.90035OpenAlexW2332118307WikidataQ59474748 ScholiaQ59474748MaRDI QIDQ309075FDOQ309075
Authors: Yuri Bykov, Sanja Petrovic 
Publication date: 7 September 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-016-0469-x
Recommendations
- Late acceptance hill-climbing for high school timetabling
- The late acceptance hill-climbing heuristic
- An adaptive flex-deluge approach to university exam timetabling
- Coupling Stochastic and Deterministic Local Search in Examination Timetabling
- A tabu search algorithm to schedule university examinations
simulated annealingoptimisationmetaheuristicsexam timetablinglate acceptance hill climbingstep counting hill climbing
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Recent research directions in automated timetabling
- ITC2007 solver description: a hybrid approach
- A graph-based hyper-heuristic for educational timetabling problems
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- A survey of search methodologies and automated system development for examination timetabling
- Measuring instance difficulty for combinatorial optimization problems
- A new adaptive multi-start technique for combinatorial global optimizations
- The late acceptance hill-climbing heuristic
- Solving the examination timetabling problem in GPUs
- Variants of simulated annealing for the examination timetabling problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
Cited In (5)
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
- Late acceptance hill-climbing for high school timetabling
- Algorithmic design for the examination arrangement system on a large scale for universities
- The late acceptance hill-climbing heuristic
- Educational timetabling: problems, benchmarks, and state-of-the-art results
Uses Software
This page was built for publication: A step counting hill climbing algorithm applied to university examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309075)
