A step counting hill climbing algorithm applied to university examination timetabling
type: Item
instance of: scholarly article
title: A step counting hill climbing algorithm applied to university examination timetabling
zbMATH Open document ID: 1347.90035
author: Yuri Bykov
author: Sanja Petrovic
published in: Journal of Scheduling
publication date: 2016-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6624268
zbMATH Keywords: optimisation
zbMATH Keywords: metaheuristics
zbMATH Keywords: simulated annealing
zbMATH Keywords: late acceptance hill climbing
zbMATH Keywords: step counting hill climbing
zbMATH Keywords: exam timetabling
describes a project that uses: Hyperheuristics
MaRDI profile type: Publication
full work available at URL: s10951-016-0469-x
OpenAlex ID: W2332118307
Wikidata QID: Q59474748
cites work: An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
cites work: A new adaptive multi-start technique for combinatorial global optimizations
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: The late acceptance hill-climbing heuristic
cites work: A graph-based hyper-heuristic for educational timetabling problems
cites work: Recent research directions in automated timetabling
cites work: Q2779804
cites work: Q2779807
cites work: Solving the examination timetabling problem in GPUs
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: ITC2007 solver description: a hybrid approach
cites work: A survey of search methodologies and automated system development for examination timetabling
cites work: Measuring instance difficulty for combinatorial optimization problems
cites work: Variants of simulated annealing for the examination timetabling problem
DOI: 10.1007/S10951-016-0469-X
description: scientific article; zbMATH DE number 6624268