ARTICLE
TITLE

Optimization of Course Scheduling Using Late Acceptance Hill Climbing Algorithms based on Hyper Heuristics

SUMMARY

Course scheduling is one area of ??operations research. This problem schedules a class without violating an existing constraint. At this time the problem of scheduling courses is becoming increasingly complex with existing limitations One of them is in International Timetabling Competition 2019 (ITC 2019) which released the latest real world dataset.This study focuses on optimizing the quality of course scheduling in order to reduce the value of the final solution of course scheduling. The algorithm used is Late Acceptance Hill Climbing (LAHC) with a hyper-heuristic approach using mutation Low Level Heuristics (LLH) and local search. The algorithm was applied to 30 ITC 2019 data sets with 100,000 iterations in 5 trials.The result is that the application of this algorithm is able to optimize with an average of 52% of the initial solution. In addition, this algorithm produces a consistent solution for 10 attempts on each dataset.

 Articles related

Khairul Saleh    

Abstract - In the world of education to achieve the level of success, of course, they have a benchmark for the success of students, one of them is the Grade Point Average (GPA). The purpose of this study is to determine the final GPA so that later it can... see more


Kustanto Kustanto    

Science and technology at the recently developed so rapidly. Along with that comes a variety of new problems, among others, issues of efficiency and optimization. In this study, the selected optimization problem is in the field of transportation distribu... see more


Agil Assagaf,Adelina Ibrahim,Catur Suranto    

Abstrak : Penjadwalan praktikum merupakan proses penyusunan jadwal pelaksanaan yang menginformasikan sejumlah mata kuliah, dosen yang mengajar, ruang, serta waktu kegiatan perkuliahan di laboratorium. Perlu diperhatikan beberapa aspek untuk menyusun jadw... see more


JarosÅ‚aw Rudy,Dominik Å»elazny    

In this paper the job shop scheduling problem (JSP) with minimizing two criteria simultaneously is considered. JSP is frequently used model in real world applications of combinatorial optimization. Multi-objective job shop problems (MOJSP) were rarely st... see more


Hasan Basri, Mohammad Syamsul Azis, Yesni Malau, Eka Wulansari Fridayanthie, Khairul Rizal, Harsih Rianto    

Advances in industrial technology 4.0 provide many changes in today's life. One example attached to the advancement of industrial technology 4.0 is the use of communication, transactions, even to the level of education using the acceleration of informati... see more