Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Harmony search algorithm (HSA) is a population-based metaheuristic optimization algorithm that imitates the music improvisation process where musicians improvise their instruments’ pitch by searching for a perfect state of harmony. Previous studies have shown that HSA has been successfully adapted f...
| Main Author: | |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
Institute of Graduate Studies, UiTM
2017
|
| Subjects: | |
| Online Access: | http://ir.uitm.edu.my/id/eprint/19762/ http://ir.uitm.edu.my/id/eprint/19762/1/ABS_JULIANA%20WAHID%20TDRA%20VOL%2011%20IGS%2017.pdf |
| id |
uitm-19762 |
|---|---|
| recordtype |
eprints |
| spelling |
uitm-197622018-06-07T07:09:29Z http://ir.uitm.edu.my/id/eprint/19762/ Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid Wahid, Juliana Malaysia Harmony search algorithm (HSA) is a population-based metaheuristic optimization algorithm that imitates the music improvisation process where musicians improvise their instruments’ pitch by searching for a perfect state of harmony. Previous studies have shown that HSA has been successfully adapted for solving combinatorial optimization problems such as university course timetabling problem (UCTP). However, HSA encountered a setback in which the convergence rate and accuracy of the obtained results are reduced because of the solutions in the population are eventually about the same during the final iterations. Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. SA is chosen to be hybridize with HSA for solving CBCTT because in literature, SA was successfully hybridize with HSA to solve other domain of problems. GD is chosen to be hybridize with HSA for solving CBCTT because GD has the related procedure with SA… Institute of Graduate Studies, UiTM 2017 Book Section PeerReviewed text en http://ir.uitm.edu.my/id/eprint/19762/1/ABS_JULIANA%20WAHID%20TDRA%20VOL%2011%20IGS%2017.pdf Wahid, Juliana (2017) Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid. In: The Doctoral Research Abstracts. IGS Biannual Publication, 11 (11). Institute of Graduate Studies, UiTM, Shah Alam. |
| repository_type |
Digital Repository |
| institution_category |
Local University |
| institution |
Universiti Teknologi MARA |
| building |
UiTM Institutional Repository |
| collection |
Online Access |
| language |
English |
| topic |
Malaysia |
| spellingShingle |
Malaysia Wahid, Juliana Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid |
| description |
Harmony search algorithm (HSA) is a population-based metaheuristic optimization algorithm that imitates the music improvisation process where musicians improvise their instruments’ pitch by searching for a perfect state of harmony. Previous studies have shown that HSA has been successfully adapted for solving combinatorial optimization problems such as university course timetabling problem (UCTP). However, HSA encountered a setback in which the convergence rate and accuracy of the obtained results are reduced because of the solutions in the population are eventually about the same during the final iterations. Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. SA is chosen to be hybridize with HSA for solving CBCTT because in literature, SA was successfully hybridize with HSA to solve other domain of problems. GD is chosen to be hybridize with HSA for solving CBCTT because GD has the related procedure with SA… |
| format |
Book Section |
| author |
Wahid, Juliana |
| author_facet |
Wahid, Juliana |
| author_sort |
Wahid, Juliana |
| title |
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid |
| title_short |
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid |
| title_full |
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid |
| title_fullStr |
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid |
| title_full_unstemmed |
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid |
| title_sort |
hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / juliana wahid |
| publisher |
Institute of Graduate Studies, UiTM |
| publishDate |
2017 |
| url |
http://ir.uitm.edu.my/id/eprint/19762/ http://ir.uitm.edu.my/id/eprint/19762/1/ABS_JULIANA%20WAHID%20TDRA%20VOL%2011%20IGS%2017.pdf |
| first_indexed |
2023-09-18T23:03:14Z |
| last_indexed |
2023-09-18T23:03:14Z |
| _version_ |
1777418312976695296 |