Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A multiobjective framework for heavily constrained examination timetabling problems

Mumford, Christine Lesley 2010. A multiobjective framework for heavily constrained examination timetabling problems. Annals of Operations Research 180 (1) , pp. 3-31. 10.1007/s10479-008-0490-3

Full text not available from this repository.

Abstract

University examination timetabling is a challenging set partitioning problem that comes in many variations, and real world applications usually carry multiple constraints and require the simultaneous optimization of several (often conflicting) objectives. This paper presents a multiobjective framework capable of solving heavily constrained timetabling problems. In this prototype study, we focus on the two objectives: minimizing timetable length while simultaneously optimizing the spread of examinations for individual students. Candidate solutions are presented to a multiobjective memetic algorithm as orderings of examinations, and a greedy algorithm is used to construct violation free timetables from permutation sequences of exams. The role of the multiobjective algorithm is to iteratively improve a population of orderings, with respect to the given objectives, using various mutation and reordering heuristics.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Computer software
Additional Information: From the issue entitled "Computational Intelligence and Scheduling."
Publisher: Springer Verlag
ISSN: 0254-5330
Last Modified: 04 Jun 2017 02:56
URI: http://orca.cf.ac.uk/id/eprint/14178

Citation Data

Cited 13 times in Google Scholar. View in Google Scholar

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

Cited 4 times in Web of Science. View in Web of Science.

Actions (repository staff only)

Edit Item Edit Item