A step counting hill climbing algorithm applied to university examination timetabling

DOI10.1007/s10951-016-0469-xzbMath1347.90035OpenAlexW2332118307WikidataQ59474748 ScholiaQ59474748MaRDI QIDQ309075

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

zbMATH Keywords

metaheuristicssimulated annealingoptimisationexam timetablinglate acceptance hill climbingstep counting hill climbing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ The late acceptance hill-climbing heuristic ⋮ Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
• A survey of search methodologies and automated system development for examination timetabling
• A new adaptive multi-start technique for combinatorial global optimizations
• Recent research directions in automated timetabling
• The late acceptance hill-climbing heuristic
• Solving the examination timetabling problem in GPUs
• Measuring instance difficulty for combinatorial optimization problems
• Variants of simulated annealing for the examination timetabling problem
• 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 I, Graph Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

This page was built for publication: A step counting hill climbing algorithm applied to university examination timetabling