Stochastic Search Algorithms for Exam Scheduling

LAUR Repository

Show simple item record

dc.contributor.author Mansour, Nashat
dc.contributor.author Timany, Mazen
dc.date.accessioned 2016-01-26T12:26:38Z
dc.date.available 2016-01-26T12:26:38Z
dc.date.copyright 2007
dc.date.issued 2016-01-26
dc.identifier.issn 0973-1873 en_US
dc.identifier.uri http://hdl.handle.net/10725/2961
dc.description.abstract Scheduling final exams for large numbers of courses and students in universities is an intractable problem. Where scheduling is done manually, conflicts and unfairness are inevitable. Conflicts occur when simultaneous exams are scheduled for the same student, and unfairness to a student refers to consecutive exams or more than two exams on the same day. A good exam schedule should aim to minimize conflicts and the two unfairness factors based on user-assigned weights to these three factors and subject to some constraints such as classrooms’ number and capacities. In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. The two algorithms are a simulated annealing algorithm (SA) and a genetic algorithm (GA). We also propose an improvement to a ‘good’ clustering-based heuristic procedure, known as FESP, by using simulated annealing procedures. The improved heuristic is referred to as FESP-SA. Then, we empirically compare the three proposed algorithms and FESP using realistic data. Our experimental results show that SA and GA produce good exam schedules that are better than those of FESP heuristic procedure. Also, SA and GA allow a reduction in the number of exam days without much aggravating conflicts and unfairness. However, SA is more favorable since it is faster than GA. en_US
dc.language.iso en en_US
dc.title Stochastic Search Algorithms for Exam Scheduling en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 198629170 en_US
dc.author.woa N/A en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal International Journal of Computational Intelligence Research en_US
dc.journal.volume 3 en_US
dc.journal.issue 4 en_US
dc.article.pages 353-361 en_US
dc.keywords Clustering heuristics en_US
dc.keywords Exam scheduling en_US
dc.keywords Genetic algorithms en_US
dc.keywords Simulated annealing en_US
dc.keywords Timetabling en_US
dc.identifier.ctation Mansour, N., & Timani, M. (2007). Stochastic search algorithms for exam scheduling. Int J Comput Intell Res, 3(4), 353-361. en_US
dc.author.email mansour@lau.edu.lb
dc.identifier.url https://www.researchgate.net/profile/Nashat_Mansour/publication/239441404_Stochastic_Search_Algorithms_for_Exam_Scheduling/links/552f08db0cf2d495071aa7de.pdf

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account