Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Teknikal Malaysia Melaka
2016
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/20503/1/JTEC%208%208%202016%2092%2095.pdf |
| _version_ | 1825804381732208640 |
|---|---|
| author | Wahid, Juliana Mohd Hussin, Naimah |
| author_facet | Wahid, Juliana Mohd Hussin, Naimah |
| author_sort | Wahid, Juliana |
| collection | UUM |
| description | The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions |
| first_indexed | 2024-07-04T06:13:37Z |
| format | Article |
| id | uum-20503 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:13:37Z |
| publishDate | 2016 |
| publisher | Universiti Teknikal Malaysia Melaka |
| record_format | eprints |
| spelling | uum-205032017-01-03T03:39:12Z https://repo.uum.edu.my/id/eprint/20503/ Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics Wahid, Juliana Mohd Hussin, Naimah QA75 Electronic computers. Computer science The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions Universiti Teknikal Malaysia Melaka 2016 Article PeerReviewed application/pdf en cc_by https://repo.uum.edu.my/id/eprint/20503/1/JTEC%208%208%202016%2092%2095.pdf Wahid, Juliana and Mohd Hussin, Naimah (2016) Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics. Journal of Telecommunication, Electronic and Computer Engineering, 8 (8). pp. 92-95. ISSN 2180-1843 http://journal.utem.edu.my/index.php/jtec/article/view/1325 |
| spellingShingle | QA75 Electronic computers. Computer science Wahid, Juliana Mohd Hussin, Naimah Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics |
| title | Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics |
| title_full | Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics |
| title_fullStr | Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics |
| title_full_unstemmed | Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics |
| title_short | Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics |
| title_sort | construction of initial solution population for curriculum based course timetabling using combination of graph heuristics |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/20503/1/JTEC%208%208%202016%2092%2095.pdf |
| work_keys_str_mv | AT wahidjuliana constructionofinitialsolutionpopulationforcurriculumbasedcoursetimetablingusingcombinationofgraphheuristics AT mohdhussinnaimah constructionofinitialsolutionpopulationforcurriculumbasedcoursetimetablingusingcombinationofgraphheuristics |