A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
The University Course Timetabling Problem (UCTP) such as the curriculum-based course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution.The Curric...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MAXWELL Science Publication
2015
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/18608/1/RJASET%2010%208%202015%20882-889.pdf http://repo.uum.edu.my/18608/ http://doi.org/10.19026/rjaset.10.2443 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Utara Malaysia |
Language: | English |
id |
my.uum.repo.18608 |
---|---|
record_format |
eprints |
spelling |
my.uum.repo.186082016-08-22T07:43:48Z http://repo.uum.edu.my/18608/ A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem Teoh, Chong Keat Haron, Habibollah Wibowo, Antoni Ngadiman, Mohd Salihin QA Mathematics The University Course Timetabling Problem (UCTP) such as the curriculum-based course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution.The Curriculum-Based University Course Timetabling Problem (CB-UCTP) has a high conflict-density and searching for an improved solution is not trivial.In this study, the authors propose a heuristic room matching algorithm which improves the seed of the CB-UCTP.The objective is to provide a reasonable search point to carry out any improvement phase and the results obtained indicate that the matching algorithm is able to provide very promising results as the fitness score of the solution is significantly enhanced in a very short period of time. MAXWELL Science Publication 2015 Article PeerReviewed application/pdf en cc4_by http://repo.uum.edu.my/18608/1/RJASET%2010%208%202015%20882-889.pdf Teoh, Chong Keat and Haron, Habibollah and Wibowo, Antoni and Ngadiman, Mohd Salihin (2015) A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem. Research Journal of Applied Sciences, Engineering and Technology, 10 (8). pp. 882-889. ISSN 2040-7459 http://doi.org/10.19026/rjaset.10.2443 doi:10.19026/rjaset.10.2443 |
institution |
Universiti Utara Malaysia |
building |
UUM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Utara Malaysia |
content_source |
UUM Institutionali Repository |
url_provider |
http://repo.uum.edu.my/ |
language |
English |
topic |
QA Mathematics |
spellingShingle |
QA Mathematics Teoh, Chong Keat Haron, Habibollah Wibowo, Antoni Ngadiman, Mohd Salihin A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
description |
The University Course Timetabling Problem (UCTP) such as the curriculum-based course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution.The Curriculum-Based University Course Timetabling Problem (CB-UCTP) has a high conflict-density and searching for an improved solution is not trivial.In this study, the authors propose a heuristic room matching algorithm which improves the seed of the CB-UCTP.The objective is to provide a reasonable search point to carry out any improvement phase and the results obtained indicate that the matching algorithm is able to provide very promising results as the fitness score of the solution is significantly enhanced in a very short period of time. |
format |
Article |
author |
Teoh, Chong Keat Haron, Habibollah Wibowo, Antoni Ngadiman, Mohd Salihin |
author_facet |
Teoh, Chong Keat Haron, Habibollah Wibowo, Antoni Ngadiman, Mohd Salihin |
author_sort |
Teoh, Chong Keat |
title |
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
title_short |
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
title_full |
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
title_fullStr |
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
title_full_unstemmed |
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
title_sort |
heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem |
publisher |
MAXWELL Science Publication |
publishDate |
2015 |
url |
http://repo.uum.edu.my/18608/1/RJASET%2010%208%202015%20882-889.pdf http://repo.uum.edu.my/18608/ http://doi.org/10.19026/rjaset.10.2443 |
_version_ |
1644282493035085824 |