A step counting hill climbing algorithm applied to university examination timetabling

DOI10.1007/S10951-016-0469-XMaRDI QIDQ309075zbMATH OpenOpenAlexWikidataFDO

Authors Yuri Bykov, Sanja Petrovic

Publication date 7 September 2016

Published in Journal of Scheduling (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10951-016-0469-x

zbMATH Keywords

simulated annealingoptimisationmetaheuristicsexam 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)

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

Cites work

• scientific article; zbMATH DE number 1728534 (Why is no real title available?)
• scientific article; zbMATH DE number 1728536 (Why is no real title available?)
• A graph-based hyper-heuristic for educational timetabling problems
• A new adaptive multi-start technique for combinatorial global optimizations
• A survey of search methodologies and automated system development for examination timetabling
• An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
• ITC2007 solver description: a hybrid approach
• Measuring instance difficulty for combinatorial optimization problems
• 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
• Recent research directions in automated timetabling
• Setting the research agenda in automated timetabling: the second international timetabling competition
• Solving the examination timetabling problem in GPUs
• The late acceptance hill-climbing heuristic
• Variants of simulated annealing for the examination timetabling problem

Cited in

(5)

• Educational timetabling: problems, benchmarks, and state-of-the-art results
• Late acceptance hill-climbing for high school timetabling
• The late acceptance hill-climbing heuristic
• Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
• Algorithmic design for the examination arrangement system on a large scale for universities

Describes a project that uses

Uses Software

• Hyperheuristics

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)