An application of the Threshold Accepting metaheuristic for curriculum based course timetabling

Simple item page
dc.creatorGeiger, Martin Josef
dc.date2008-09-04
dc.date.accessioned2026-07-07T10:06:33Z
dc.date.available2026-07-07T10:06:33Z
dc.descriptionThe article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Timetabling Competition 2007 (ITC 2007). The heuristic search procedure is based on Threshold Accepting to overcome local optima. A stochastic neighborhood is proposed and implemented, randomly removing and reassigning events from the current solution. The overall concept has been incrementally obtained from a series of experiments, which we describe in each (sub)section of the paper. In result, we successfully derived a potential candidate solution approach for the finals of track 3 of the ITC 2007.
dc.identifierhttps://arxiv.org/abs/0809.0757
dc.identifierhttp://arxiv.org/abs/0809.0757
dc.identifierProceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling PATAT 2008, August 19-22, Montreal, Canada
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170363
dc.subjectArtificial Intelligence
dc.titleAn application of the Threshold Accepting metaheuristic for curriculum based course timetabling
dc.typetext

Files

Collections

arXiv