文章基本信息

标题：Integrating a Repairing-based Genetic Algorithm-Neighborhood Search Structure in Solving the Course Timetabling Problem
本地全文：下载
作者：Teoh, Chong-Keat ; Haron, Habibollah ; Wibowo, Antoni 等
期刊名称：Journal of Computer Science
印刷版ISSN：1549-3636
出版年度：2016
卷号：12
期号：10
页码：510-516
DOI：10.3844/jcssp.2016.510.516
出版社：Science Publications
摘要：The course timetabling problem is not a trivial task as it is an NP-hard and NP-complete problem and many solutions have been proposed due to its high complexity search landscape. In essence, the nature of the course timetabling problem is to assign a lecturer-course entity to existing teaching venue and timeslot in an academic institution. In this article, the authors propose a Genetic Algorithm-Neighborhood Search (GANS) to construct a feasible timetable for courses offered by a department in the faculty of a local university in Malaysia. The framework of the solution is as follow: The feasible timetable is first constructed by Genetic Algorithm, which includes are pair operator which attempts to repair infeasible timetables. Upon feasibility, the second phase exploits the initial feasible solution using three neighborhood structures to search for an improved solution and global optimum. The experimental results demonstrate the efficiency and effectiveness of the various neighborhood structures in exploiting the feasible solutions to yield the global optimum.
关键词：Genetic Algorithm; Neighborhood Search; Repair Operator; University Course Timetabling Problem