Penjadwalan Mata Kuliah Otomatis Menggunakan Algoritma Late Acceptance Hill-Climbing Hyper Heuristics dengan Domain Permasalahan ITC
DOI:
https://doi.org/10.70340/jirsi.v3i3.168Keywords:
course scheduling, international timetabling competition, late acceptance hill climbing algorithm, hyper-heuristicsAbstract
The International Timetabling Competition is an international scheduling competition that aims to motivate further research on scheduling issues especially in scheduling in the field of education. In the world of education, scheduling problems have become a topic that is often encountered. One of the scheduling problems found in higher education is scheduling courses. Course scheduling is conducted routinely at the beginning of each semester, in scheduling must pay attention to the allocation of resources contained in the university. Scheduling is a long process, it is because in allocating resources in a scheduling problem must pay attention to various aspects or limits that have been set in order to get optimal results. This problem is classified as a Non-Polynomial hard problem, where there is no exact algorithm to solve it in a polynomial time. In the preparation of this final project subject scheduling is done using a tabu search algorithm - simulated annealing hyper-heuristics. The dataset used is a dataset obtained from the 2019 International Timetabling Competition. The results of this final project are java-based automatic scheduling applications which are expected to help solve problems related to scheduling subjects more optimally, and solutions that are produced competitive with benchmark algorithms.
Downloads
References
S. Putra, M. Iqbal, A. Putera, and U. Siahaan, “Analysis Of Course Distribution Scheduling For Lecturers Using Genetic Algorithms And Analysis Of Course Distribution Scheduling For Lecturers Using Genetic Algorithms And Constraint Satisfaction Methods At Batam University,” Informatika dan Sains, vol. 14, no. 04, p. 2024, doi: 10.54209/infosains.v14i04.
A. Muklason, A. Marom, and I. G. A. Premananda, “Automated Course Timetabling Optimization Using Tabu-Simulated Annealing Hyper-Heuristics Algorithm,” Khazanah Informatika : Jurnal Ilmu Komputer dan Informatika, vol. 10, no. 1, pp. 15–21, Apr. 2024, doi: 10.23917/khif.v10i1.4835.
A. Naskar, R. Pramanik, S. K. S. Hossain, S. Mirjalili, and R. Sarkar, “Late acceptance hill climbing aided chaotic harmony search for feature selection: An empirical analysis on medical data,” Expert Syst Appl, vol. 221, p. 119745, Jul. 2023, doi: 10.1016/j.eswa.2023.119745.
R. R. Hutama, “Pembentukan Solusi Awal International Timetabling Competition 2021,” JATISI (Jurnal Teknik Informatika dan Sistem Informasi), vol. 8, no. 4, pp. 1939–1944, Dec. 2021, doi: 10.35957/jatisi.v8i4.1155.
E. K. Burke et al., “Hyper-heuristics: a survey of the state of the art,” Journal of the Operational Research Society, vol. 64, no. 12, pp. 1695–1724, Dec. 2013, doi: 10.1057/jors.2013.71.
G. Nagarajan and L. D. Dhinesh Babu, “A hybrid of whale optimization and late acceptance hill climbing based imputation to enhance classification performance in electronic health records,” J Biomed Inform, vol. 94, p. 103190, Jun. 2019, doi: 10.1016/j.jbi.2019.103190.
J. H. Drake, E. Özcan, and E. K. Burke, “A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem,” Evol Comput, vol. 24, no. 1, pp. 113–141, Mar. 2016, doi: 10.1162/EVCO_a_00145.
D. Romaguera, J. Plender-Nabas, J. Matias, and L. Austero, “Development of a Web-based Course Timetabling System based on an Enhanced Genetic Algorithm,” Procedia Comput Sci, vol. 234, pp. 1714–1721, 2024, doi: 10.1016/j.procs.2024.03.177.
M. Kumar Sharma and B. Kumar Chauhan, “Timetable rationalization & Operational improvements by human intervention in an urban rail transit system: An exploratory study,” Transp Res Interdiscip Perspect, vol. 13, p. 100526, Mar. 2022, doi: 10.1016/j.trip.2021.100526.
S. Abdipoor, R. Yaakob, S. L. Goh, and S. Abdullah, “Meta-heuristic approaches for the University Course Timetabling Problem,” Intelligent Systems with Applications, vol. 19, p. 200253, Sep. 2023, doi: 10.1016/j.iswa.2023.200253.
T. Müller, H. Rudová, and Z. Müllerová, “Real-world university course timetabling at the International Timetabling Competition 2019,” Journal of Scheduling, Apr. 2024, doi: 10.1007/s10951-023-00801-w.
J. H. Drake, A. Kheiri, E. Özcan, and E. K. Burke, “Recent advances in selection hyper-heuristics,” Eur J Oper Res, vol. 285, no. 2, pp. 405–428, Sep. 2020, doi: 10.1016/j.ejor.2019.07.073.
A. Lamghari and R. Dimitrakopoulos, “Hyper-heuristic approaches for strategic mine planning under uncertainty,” Comput Oper Res, vol. 115, p. 104590, Mar. 2020, doi: 10.1016/j.cor.2018.11.010.
M. Alzaqebah, S. Jawarneh, M. Alwohaibi, M. K. Alsmadi, I. Almarashdeh, and R. Mustafa A. Mohammad, “Hybrid Brain Storm Optimization algorithm and Late Acceptance Hill Climbing to solve the Flexible Job-Shop Scheduling Problem,” Journal of King Saud University - Computer and Information Sciences, vol. 34, no. 6, pp. 2926–2937, Jun. 2022, doi: 10.1016/j.jksuci.2020.09.004.
J. Hall and K. M. Brown, “Creating feelings of inclusion in adventure tourism: Lessons from the gendered sensory and affective politics of professional mountaineering,” Ann Tour Res, vol. 97, p. 103505, Nov. 2022, doi: 10.1016/j.annals.2022.103505.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Cut Alna Fadhilla

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.