A time-dependent metaheuristic algorithm for post enrolment-based course timetabling

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X 2012. A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Annals of Operations Research 194 (1) , pp. 273-289. 10.1007/s10479-010-0696-z

Preview

PDF - Submitted Pre-Print Version Download (195kB) | Preview

Abstract

A metaheuristic-based algorithm is presented for the post enrolment-based course timetabling problem used in track-2 of the Second International Timetabling Competition (ITC2007). The featured algorithm operates in three distinct stages—a constructive phase followed by two separate phases of simulated annealing—and is time dependent, due to the fact that various run-time parameters are calculated automatically according to the amount of computation time available. Overall, the method produces results in line with the official finalists to the timetabling competition, though experiments show that this algorithm also seems to find certain instances more difficult to solve than others. A number of reasons for this latter feature are discussed.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Uncontrolled Keywords:	ITC2007 - Post enrolment timetabling - Metaheuristics - Neighbourhood operators
Publisher:	Springer
ISSN:	0254-5330
Last Modified:	11 May 2023 01:43
URI:	https://orca.cardiff.ac.uk/id/eprint/11332

Citation Data

Cited 22 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item