A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling

作者：Jat Sadaf Naseem; Yang Shengxiang^*

来源：Journal of Scheduling, 2011, 14(6): 617-637.

DOI：10.1007/s10951-010-0202-0

• Post enrolment course timetabling problem
• University course timetabling problem
• Guided search genetic algorithm
• Local search
• Tabu search

The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimisation problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve the PECTP in two phases. In the first phase, a guided search genetic algorithm is applied to solve the PECTP. This guided search genetic algorithm, integrates a guided search strategy and some local search techniques, where the guided search strategy uses a data structure that stores useful information extracted from previous good individuals to guide the generation of offspring into the population and the local search techniques are used to improve the quality of individuals. In the second phase, a tabu search heuristic is further used on the best solution obtained by the first phase to improve the optimality of the solution if possible. The proposed hybrid approach is tested on a set of benchmark PECTPs taken from the international timetabling competition in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed hybrid approach is able to produce promising results for the test PECTPs.

• 出版日期2011-12