DocumentCode :
1507779
Title :
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
Author :
Yang, Shengxiang ; Jat, Sadaf Naseem
Author_Institution :
Dept. of Inf. Syst. & Comput., Brunei Univ., Uxbridge, UK
Volume :
41
Issue :
1
fYear :
2011
Firstpage :
93
Lastpage :
106
Abstract :
The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper investigates genetic algorithms (GAs) with a guided search strategy and local search (LS) techniques for the UCTP. The guided search strategy is used to create offspring into the population based on a data structure that stores information extracted from good individuals of previous generations. The LS techniques use their exploitive search ability to improve the search efficiency of the proposed GAs and the quality of individuals. The proposed GAs are tested on two sets of benchmark problems in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed GAs are able to produce promising results for the UCTP.
Keywords :
combinatorial mathematics; computational complexity; education; genetic algorithms; search problems; NP hard problem; combinatorial optimization problem; genetic algorithms; search strategies; university course timetabling problem; Benchmark testing; Computer science; Councils; Data mining; Data structures; Genetic algorithms; Information systems; NP-hard problem; Polynomials; Resource management; Genetic algorithm (GA); guided search; local search (LS); university course timetabling problem (UCTP);
fLanguage :
English
Journal_Title :
Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on
Publisher :
ieee
ISSN :
1094-6977
Type :
jour
DOI :
10.1109/TSMCC.2010.2049200
Filename :
5477159
Link To Document :
بازگشت