Grasp and Guided Local Search for the examination timetabling problem

Authors:
Drifa Hadjidj;Habiba Drias
Affiliations:
Faculte des Sciences, Departement d;Informatique, Universite M
Venue:
International Journal of Artificial Intelligence and Soft Computing
Year:
2010

Citing 12
Cited 0

A robust simulated annealing based examination timetabling system

Computers and Operations Research
New methods to color the vertices of a graph

Communications of the ACM
Guided Local Search — an Illustrative Example in Function Optimisation

BT Technology Journal
A Survey of Automated Timetabling

Artificial Intelligence Review
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Case-based heuristic selection for timetabling problems

Journal of Scheduling
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling
Ant algorithms for the exam timetabling problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A novel similarity measure for heuristic selection in examination timetabling

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Fuzzy multiple heuristic orderings for examination timetabling

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Examination timetabling is an optimisation problem, which regards the scheduling of a set of exams to a set of contiguous time slots, satisfying a set of constraints. The problem belongs to the class of NP-Complete problems and is usually tackled using heuristic methods. In this paper, we describe a solution algorithm and its implementation which makes use of the good features of a Greedy Randomised Adaptive Search Procedure (GRASP) and the Guided Local Search (GLS) meta-heuristic. The implementation of the algorithm has been experimented on the popular Carter's benchmarks and compared with the best recent results.