Please use this identifier to cite or link to this item:
|Title:||A noval approach of genetic algorithm for solving examination timetabling problems: A case study of Thai Universities||Authors:||Innet, Supachate||Keywords:||evolution computing;examination timetable;genetic algorithm||Issue Date:||2013||Publisher:||University of the Thai Chamber of Commerce||Source:||Supachate Innet (2013) A noval approach of genetic algorithm for solving examination timetabling problems: A case study of Thai Universities., 233-237.||Conference:||13th International Symposium on Communications and Information Technologies: Communication and Information Technology for New Life Style Beyond the Cloud, ISCIT 2013||Abstract:||Arranging examination timetable is problematic. It differs from other timetabling problems in terms of conditions. A complete timetable must reach several requirements involving course, group of student sitting the exam in that course, etc. It is similar tothe course's timetable but not the same. Many differences between them include the way to create and the requirements. This paper proposes an adaptive genetic algorithm model applied for improving effectiveness of automatic arranging examination timetable. Hard constraints and soft constraints for this specific problem were discussed. In addition, the genetic elements were designed and the penalty cost function was proposed. Three genetic operators: crossover, mutation, and selection were employed. A simulation was conducted to obtain some results. The results show that the proposed GA model works well in arranging an examination timetable. With 0.75 crossover rate, there is no hard constraints appeared in the timetable.||URI:||https://scholar.utcc.ac.th/handle/6626976254/3460||Rights:||This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.|
|Appears in Collections:||RSO: Conference Papers|
Show full item record Recommend this item
checked on Jul 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.