文章基本信息

标题：Design of Mathematical Model and Local Search with Heuristics Optimization of Course Timetabling
本地全文：下载
作者：M. Nandhini ; S. Kanmani
期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2010
卷号：1
期号：2
页码：20-30
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：The goal of Combinatorial Optimization is finding the best possible solution from the set of feasible solutions. This can be solved using either Artificial Intelligence or Operation Research. Timetabling means scheduling activities to time slots in an order by satisfying hard constraints and soft constraints. Hard constraints should be satisfied but the violations of soft constraints to be minimized. In the paper, the problem of Course Timetabling of Department of Information Technology in Pondicherry Engineering College is studied extensively and its all hard and soft constraints are clearly represented in mathematical model. Also, the problem has been implemented with Local Search Steepest Ascent Hill Climbing algorithm with heuristics. The results are tabulated and analyzed with different parameters, like generation, number of combinations.
关键词：Constraints; heuristics; states space; optimal solution; course timetabling problem (CTP); mathematical model; steepest ascent hill climbing