期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2014
卷号：3
期号：6
页码：6409-6413
出版社：IJECS
摘要：A college timetable is a temporal arrangement of a set of lectures and classroomsin which all given constraints are satisfied.Hence, timetabling problem is one of the best examples of a Constraint Satisfaction Problem (CSP). Memetic Algorithm is one of the besttechniques to solve the Constraint Satisfaction Problem(CSP) and it is a combination of standard genetic algorithm and hill climbingalgorithm. In this paper Course Timetable Scheduling System (CTSS) is developed to solve Timetabling – Constraint SatisfactionProblemwhich makes use of Memetic algorithm
关键词：Course Timetable Scheduling System (CTSS); Constraint Satisfaction Problem (CSP); Hard Constraints; Fitness Function;Memetic Algorithm.
