Memetic techniques for examination timetabling

doi:10.1007/s10479-013-1500-7

Return

Memetic techniques for examination timetabling

2013-11-23

PRE

Mohammed Azmi Al‐Betar *

Ahamad Tajudin Khader

Iyad Abu Doush

DOI：10.1007/s10479-013-1500-7

Original

Original request for help

Save

Abstract

En 中文

In this paper, we investigate the effectiveness of combining the main components of the memetic algorithms (MAs) on the quality of solutions produced for Uncapacitated Examination Timetabling Problem (UETP). These components are recombination, randomness, and neighbourhood structures. The Harmony Search Algorithm (HSA), which is a variation of MA, is used to perform different combinations of these components. It has three main components: Memory Consideration using the recombination, Random Consideration using the randomness and Pitch Adjustment using the neighbourhood structures (or local search). The combinations among MA components are evaluated using 17 different scenarios each of which reflects a combination of one, two or three components. The results show that the system that combines the three components (recombination, randomness, and neighbourhood structures) provides the best results. Furthermore, the best results obtained from the convergence scenarios were compared with 22 other methods that used a de facto dataset defined by Carter et al. (in Journal of the Operational Research Society 74:373-383, 1996) for UETP. The results exceed those produced by the previous methods in 2 out of 12 datasets.

Keywords:

Timetabling

Memetic algorithm

Harmony Search

Optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.