The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).
If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.
Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.
BibTex Citation Data :
@article{JOIV1092, author = {Cheng Weng Fong and Pui Huang Leong and Hishammuddin Asmuni and Yee Yong Pang and Hiew Moi Sim and Radziah Mohamad and Jun Kit Chaw}, title = {University Examination Timetabling Using a Hybrid Black Hole Algorithm}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {6}, number = {2-2}, year = {2022}, keywords = {black hole algorithm; university examination timetabling; meta-heuristic; optimization}, abstract = {University timetabling construction is a complicated task that is encountered by universities in the world. In this study, a hybrid approach has been developed to produce timetable solution for the university examination timetabling problem. Black Hole Algorithm (BHA), a population-based approach that mimics the black hole phenomenon has been introduced in the literature recently and successfully applied in addressing various optimization problems. Although its effectiveness has been proven, there still exists inefficiency regarding the exploitation ability where BHA is poor in fine tuning search region in reaching for good quality of solution. Hence, a hybrid framework for university examination timetabling problem that is based on BHA and Hill Climbing local search is proposed (hybrid BHA). The aim of this hybridization is to improve the exploitation ability of BHA in fine tuning the promising search regions and convergence speed of the search process. A real-world university examination benchmark dataset has been used to evaluate the performance of hybrid BHA. The computational results demonstrate that hybrid BHA capable of generating competitive results and recording best results for three instances, compared to the reference approaches and current best-known recorded in the literature. Other than that, findings from the Friedman tests show that the hybrid BHA ranked second and third in comparison with hybrid and meta-heuristic approaches (total of 27 approaches) reported in the literature, respectively.}, issn = {2549-9904}, pages = {572--580}, doi = {10.30630/joiv.6.2-2.1092}, url = {https://joiv.org/index.php/joiv/article/view/1092} }
Refworks Citation Data :
@article{{JOIV}{1092}, author = {Fong, C., Leong, P., Asmuni, H., Pang, Y., Sim, H., Mohamad, R., Chaw, J.}, title = {University Examination Timetabling Using a Hybrid Black Hole Algorithm}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {6}, number = {2-2}, year = {2022}, doi = {10.30630/joiv.6.2-2.1092}, url = {} }Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610 (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id
View JOIV Stats
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.