University Course Timetabling Using Graph-based Hyper Heuristics
University course timetabling is a complex optimizationproblem. There are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. Eachcomponent enforces a set of normally conflicting constraints on thesolution space. The problem will be solved...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Tehran
2013-12-01
|
| Series: | مدیریت صنعتی |
| Subjects: | |
| Online Access: | https://imj.ut.ac.ir/article_50268_dbf7a8bab68476edd8852dbf4cacb020.pdf |
| _version_ | 1819108803993403392 |
|---|---|
| author | Khodakaram Salimifard Gholamreza Jamali Salman Babaeezadeh |
| author_facet | Khodakaram Salimifard Gholamreza Jamali Salman Babaeezadeh |
| author_sort | Khodakaram Salimifard |
| collection | DOAJ |
| description | University course timetabling is a complex optimizationproblem. There are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. Eachcomponent enforces a set of normally conflicting constraints on thesolution space. The problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set ofconstraints are satisfied. In this paper, a graph-based hyper-heuristic isproposed to find a solution to the problem. This is a two tiers modelingapproach combining hyper heuristic with graph coloring technique. Theupper tier heuristic is used to select a suitable heuristic to find a feasiblesolution on the lower tier. To find the suitability of the proposedapproach, it has been applied to a real world case. The proposed approachwas able to satisfy all the hard and soft constraints. Based on the researchfindings, it can be concluded that a graph-based hyper heuristic approachis a suitable and computationally efficient method to find a solution touniversity course timetabling problem. |
| first_indexed | 2024-12-22T03:15:45Z |
| format | Article |
| id | doaj.art-459c551ed93f4f91bc571b0ef72af557 |
| institution | Directory Open Access Journal |
| issn | 2008-5885 2423-5369 |
| language | fas |
| last_indexed | 2024-12-22T03:15:45Z |
| publishDate | 2013-12-01 |
| publisher | University of Tehran |
| record_format | Article |
| series | مدیریت صنعتی |
| spelling | doaj.art-459c551ed93f4f91bc571b0ef72af5572022-12-21T18:40:49ZfasUniversity of Tehranمدیریت صنعتی2008-58852423-53692013-12-0152497010.22059/imj.2013.5026850268University Course Timetabling Using Graph-based Hyper HeuristicsKhodakaram Salimifard0Gholamreza Jamali1Salman Babaeezadeh2Assistant Prof. of Management Science, Dep. of Industrial Management, Persian Gulf University of Boushehr, IranAssistant Prof. of Management Science, Dep. of Industrial Management, Persian Gulf University of Boushehr, IranM.Sc. in Industrial Management, Dep. of Industrial Management, Persian Gulf University of Boushehr, IranUniversity course timetabling is a complex optimizationproblem. There are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. Eachcomponent enforces a set of normally conflicting constraints on thesolution space. The problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set ofconstraints are satisfied. In this paper, a graph-based hyper-heuristic isproposed to find a solution to the problem. This is a two tiers modelingapproach combining hyper heuristic with graph coloring technique. Theupper tier heuristic is used to select a suitable heuristic to find a feasiblesolution on the lower tier. To find the suitability of the proposedapproach, it has been applied to a real world case. The proposed approachwas able to satisfy all the hard and soft constraints. Based on the researchfindings, it can be concluded that a graph-based hyper heuristic approachis a suitable and computationally efficient method to find a solution touniversity course timetabling problem.https://imj.ut.ac.ir/article_50268_dbf7a8bab68476edd8852dbf4cacb020.pdfGraph ColoringHyper heuristicsLocal SearchUniversity course timetabling |
| spellingShingle | Khodakaram Salimifard Gholamreza Jamali Salman Babaeezadeh University Course Timetabling Using Graph-based Hyper Heuristics مدیریت صنعتی Graph Coloring Hyper heuristics Local Search University course timetabling |
| title | University Course Timetabling Using Graph-based Hyper Heuristics |
| title_full | University Course Timetabling Using Graph-based Hyper Heuristics |
| title_fullStr | University Course Timetabling Using Graph-based Hyper Heuristics |
| title_full_unstemmed | University Course Timetabling Using Graph-based Hyper Heuristics |
| title_short | University Course Timetabling Using Graph-based Hyper Heuristics |
| title_sort | university course timetabling using graph based hyper heuristics |
| topic | Graph Coloring Hyper heuristics Local Search University course timetabling |
| url | https://imj.ut.ac.ir/article_50268_dbf7a8bab68476edd8852dbf4cacb020.pdf |
| work_keys_str_mv | AT khodakaramsalimifard universitycoursetimetablingusinggraphbasedhyperheuristics AT gholamrezajamali universitycoursetimetablingusinggraphbasedhyperheuristics AT salmanbabaeezadeh universitycoursetimetablingusinggraphbasedhyperheuristics |