Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method

Authors:
Wee-Kit Ho;Andrew Lim;Wee-Chong Oon
Affiliations:
-;-;-
Venue:
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Year:
2001

Citing 0
Cited 2

A multi vehicle routing algorithm for package delivery

NN'06 Proceedings of the 7th WSEAS International Conference on Neural Networks
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the desirable attributes of real-life examination timetabling solutions is the maximization of paper spread, which is a measure of the amount of study time that each student has between examinations. In this paper, we make use of the Push-Forward Insertion Heuristic (PFIH), a technique commonly employed in the Vehicle Routing Problem, to find timetable solutions that maximize paper spread. This is done by including PFIH as part of a hybrid exam-timetabling framework known as the Combined Method.