Pipelining Memetic Algorithms, Constraint Satisfaction, and Local Search for Course Timetabling
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
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 |
In this paper, we propose an automated software engineering approach, called task-based conceptual graphs (TBCG), to solving the university timetabling problem. Task-based conceptual graphs provides the automation of software development processes including specification acquisition, verification, and automatic programming. Modification can be directly performed on the specifications rather than on the source code, moreover, hard and soft constraints can be easily inserted or removed. Hence, our approach offers a certain degree of flexibility to support changes. A university timetabling system in the Department of Computer Science and Information Engineering at National Central University is used as an illustrative example for the proposed approach.