Adapting And Hybrid Ising Harmony Search With Metaheuristic Components For University Course Timetabling

dc.contributor.authoral-Betar, Mohammed Azmi
dc.date.accessioned2017-02-17T08:25:08Z
dc.date.available2017-02-17T08:25:08Z
dc.date.issued2010-06
dc.description.abstractUniversity Course Timetabling Problem (UCTP) is a hard combinatorial scheduling prob- !em. Harmony Search Algorithm (HSA) is a recent metaheuristic population-based method. The major thrust of this algorithm I ies in its abiiity to integrate the key components of populationbased methods and local search-based methods in the same optimisation model. This dissertation presents a HSA adapted for UCTP. The adaptation involved modifying the HSA operators. The results were within the range of state of the art. However, some shortcomings in the convergence rate and local exploitation were identified and addressed through hybridisation with known metaheuristic components. Three hybridized versions are proposed which are incremental improvements over the preceding version: (i) Modified Harmony Search Algorithm (MHSA); (ii) Harmony Search Algorithm with Multi-Pitch Adjusting Rate (HSA-MPAR), and (iii) Hybrid Harmony Search Algorithm (HHSA). The results werecompared against 21 other methods using eleven de facto standard dataset of different sizes and complexity. The proposed hybridized versions achieved the optimal solution for the small datasets, with two best overall results for the medium datasets. Furthermore, in the large and most complex dataset the proposed hybrid methods achieved the best result.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/3751
dc.publisherUniversiti Sains Malaysiaen_US
dc.subjectUniversity Course Timetabling Problemen_US
dc.subjectcombinatorial scheduling prob!em.en_US
dc.titleAdapting And Hybrid Ising Harmony Search With Metaheuristic Components For University Course Timetablingen_US
dc.typeThesisen_US
Files
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: