ALGORITMA GENETIK TABU SEARCH DAN ALGORITMA MEMETIKA PADA PERMASALAHAN PENJADWALAN KULIAH

• Main Authors: , MOH. ALI ALBAR, , Ir. Lukito Edi Nugroho, M.Sc., Ph.D.
• Format: Theses and Dissertations NonPeerReviewed
• Published: [Yogyakarta] : Universitas Gadjah Mada 2013
• Subjects: ETD
• Online Access: https://repository.ugm.ac.id/119575/; http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=59578
• Institution: Universitas Gadjah Mada

Scheduling at academic institution is vital importance and complex caused by student university, lecturer, class room and lecturing activity time with pay attention certain constraints. This research uses various metaheuristic methods in finishing of scheduling troubleshoot because they have uncertainty degree or random. Memetic Algorithm and Genetic Tabu Search Algorithm are examples of metaheuristic methods. Both algorithms are an extension from Algorithm Genetic. In Memetic Algorithm, the extension is on increasing of the Local Search, while Genetic Tabu Search Algorithm uses Tabu Search Algorithm in selection part. The proposed timetable solution may not be optimal, but it must be good and can be accepted according to the analysis criteria. The proposed timetable solution can be done with fast time although use many input datas. The optimal solution must not break hard constraints, soft constraints and fast execution time. This research compares performance between Memetic Algorithm and Genetic Tabu Search Algorithm in lecture scheduling system. The testing variables are hard constraints, soft constraints and execution time. The result show that Memetic Algorithm is superior compared to Genetic Tabu Search Algorithm. Memetic Algorithm has probability to be more superior with 91,67% than that of Genetic Tabu Search Algorithm with 8,33%.