caa a22 4500 445838566 CHVBK 20180317145337.0 cr unu---uuuuu 170323e20111201xx s 000 0 eng 10.1007/s10951-010-0202-0 doi (NATIONALLICENCE)springer-10.1007/s10951-010-0202-0 A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling [Elektronische Daten] [Sadaf Jat, Shengxiang Yang] 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, aguided 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, atabu 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. Springer Science+Business Media, LLC, 2010 Post enrolment course timetabling problem nationallicence University course timetabling problem nationallicence Guided search genetic algorithm nationallicence Local search nationallicence Tabu search nationallicence Jat Sadaf Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK aut Yang Shengxiang Department of Information Systems and Computing, Brunel University, UB8 3PH, Uxbridge, Middlesex, UK aut Journal of Scheduling Springer US; http://www.springer-ny.com 14/6(2011-12-01), 617-637 1094-6136 14:6<617 2011 14 10951 https://doi.org/10.1007/s10951-010-0202-0 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-010-0202-0 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Jat Sadaf Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK aut NATIONALLICENCE 700 1- Yang Shengxiang Department of Information Systems and Computing, Brunel University, UB8 3PH, Uxbridge, Middlesex, UK aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/6(2011-12-01), 617-637 1094-6136 14:6<617 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer