Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
A Software Engineering Approach to University Timetabling
MSE '00 Proceedings of the 2000 International Conference on Microelectronic Systems Education
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Constructing university timetable using constraint satisfaction programming approach
CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
An Artificial Intelligence Approach to Course Timetabling
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Solving Timetabling Problem Using Genetic and Heuristic Algorithms
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Exploring the solution of course timetabling problems through heuristic segmentation
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Hi-index | 0.00 |
This paper introduces a hybrid algorithm that combines local search and constraint satisfaction techniques with memetic algorithms for solving Course Timetabling hard problems. These problems require assigning a set of courses to a predetermined finite number of classrooms and periods of time, complying with a complete set of hard constraints while maximizing the consistency with a set of preferences (soft constraints). The algorithm works in a three-stage sequence: first, it creates an initial population of approximations to the solution by partitioning the variables that represent the courses and solving each partition as a constraint-satisfaction problem; second, it reduces the number of remaining hard and soft constraint violations applying a memetic algorithm; and finally, it obtains a complete and fully consistent solution by locally searching around the best memetic solution. The approach produces competitive results, always getting feasible solutions with a reduced number of soft constraints inconsistencies, when compared against the methods running independently.