A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling
The University course timetabling problem involves the allocation of courses to rooms and timeslots subject to satisfaction of hard and soft constraints. The hard constraints must be satisfied, while the soft constraints are desired to be satisfied. The problem also has an objectice function that ne...
Saved in:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/35854/1/SalisuMusaBorodoMFSKSM2013.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my-utm-ep.35854 |
---|---|
record_format |
uketd_dc |
spelling |
my-utm-ep.358542017-09-11T01:36:34Z A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling 2013-01 Borodo, Salisu Musa QA75 Electronic computers. Computer science The University course timetabling problem involves the allocation of courses to rooms and timeslots subject to satisfaction of hard and soft constraints. The hard constraints must be satisfied, while the soft constraints are desired to be satisfied. The problem also has an objectice function that need to be maximised. Several methodologies have been used for solving timetabling problem such as the sequential methods, graph coloring, cluster methods, constraint based and meta heuristic methods. The Hybrid Clonal Selection Algorithm with Conflict Based Statistics (Hybrid CLONALG-CBS) was chosen based on CLONALGs’ positive track record in optimization tasks and the ability of CBS in avoiding conflicting value assignments to a variable. The Hybrid CLONALG-CBS start with an initial solution, the initialized solution then undergo selection, cloning and mutation; the mutated solutions are used for the generation of improved solutions. The dataset is from Faculty of Computer Science and Information System, Universiti Teknologi Malaysia. The experimental results showed the Hybrid CLONALG-CBS fared better than the manual method and CLONALG algorithm in timeslot utilization, room utilization, Lecture spread and objective function. 2013-01 Thesis http://eprints.utm.my/id/eprint/35854/ http://eprints.utm.my/id/eprint/35854/1/SalisuMusaBorodoMFSKSM2013.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:70003?site_name=Restricted Repository masters Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems Faculty of Computer Science and Information Systems |
institution |
Universiti Teknologi Malaysia |
collection |
UTM Institutional Repository |
language |
English |
topic |
QA75 Electronic computers Computer science |
spellingShingle |
QA75 Electronic computers Computer science Borodo, Salisu Musa A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
description |
The University course timetabling problem involves the allocation of courses to rooms and timeslots subject to satisfaction of hard and soft constraints. The hard constraints must be satisfied, while the soft constraints are desired to be satisfied. The problem also has an objectice function that need to be maximised. Several methodologies have been used for solving timetabling problem such as the sequential methods, graph coloring, cluster methods, constraint based and meta heuristic methods. The Hybrid Clonal Selection Algorithm with Conflict Based Statistics (Hybrid CLONALG-CBS) was chosen based on CLONALGs’ positive track record in optimization tasks and the ability of CBS in avoiding conflicting value assignments to a variable. The Hybrid CLONALG-CBS start with an initial solution, the initialized solution then undergo selection, cloning and mutation; the mutated solutions are used for the generation of improved solutions. The dataset is from Faculty of Computer Science and Information System, Universiti Teknologi Malaysia. The experimental results showed the Hybrid CLONALG-CBS fared better than the manual method and CLONALG algorithm in timeslot utilization, room utilization, Lecture spread and objective function. |
format |
Thesis |
qualification_level |
Master's degree |
author |
Borodo, Salisu Musa |
author_facet |
Borodo, Salisu Musa |
author_sort |
Borodo, Salisu Musa |
title |
A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
title_short |
A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
title_full |
A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
title_fullStr |
A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
title_full_unstemmed |
A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
title_sort |
hybrid clonal selection algorithm with conflict based ststistics for university course timetabling |
granting_institution |
Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems |
granting_department |
Faculty of Computer Science and Information Systems |
publishDate |
2013 |
url |
http://eprints.utm.my/id/eprint/35854/1/SalisuMusaBorodoMFSKSM2013.pdf |
_version_ |
1747816371980337152 |