IMPLEMENTASI HYBRID ASSISTED GENETIC ALGORITHM DAN HILL CLIMBING UNTUK PENJADWALAN MATA PELAJARAN SEKOLAH DASAR

Aulia Miftah Razak, NIM.: 22106050079 (2026) IMPLEMENTASI HYBRID ASSISTED GENETIC ALGORITHM DAN HILL CLIMBING UNTUK PENJADWALAN MATA PELAJARAN SEKOLAH DASAR. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

[img]
Preview
Text (IMPLEMENTASI HYBRID ASSISTED GENETIC ALGORITHM DAN HILL CLIMBING UNTUK PENJADWALAN MATA PELAJARAN SEKOLAH DASAR)
22106050079_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version

Download (6MB) | Preview
[img] Text (IMPLEMENTASI HYBRID ASSISTED GENETIC ALGORITHM DAN HILL CLIMBING UNTUK PENJADWALAN MATA PELAJARAN SEKOLAH DASAR)
22106050079_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version
Restricted to Registered users only

Download (15MB) | Request a copy

Abstract

Timetable scheduling is a complex combinatorial optimization problem because it involves various resource constraints—such as teachers, classrooms, and time slots—that must be allocated simultaneously while satisfying a number of operational constraints. This complexity increases at the elementary school level due to the implementation of the homeroom teacher model, which creates dependencies between subjects within a single class. Manual scheduling approaches often result in schedule conflicts and difficulties in verifying multiple constraints simultaneously. This study aims to develop a web-based automatic scheduling system using a Hybrid Metaheuristics approach. The method integrates the Evolutionary Assisted Genetic Algorithm (EAGA) as a global search mechanism with the Matrix Locking technique to form an initial population closer to a feasible solution, as well as the Hill Climbing algorithm as a local optimization to improve the quality of the schedule structure. The system was developed using the Python programming language with the Extreme Programming methodology. Test results show that the system is capable of generating feasible schedules with a 100% success rate without violating hard constraints. The average computation time required is 10.97 seconds for a population size of 40 individuals. The integration of the Hill Climbing algorithm resulted in an average improvement in solution quality of 440 fitness points compared to the results of the pure Genetic Algorithm, achieved through the reduction of schedule fragmentation and the formation of more structured subject blocks. An evaluation by the school’s curriculum team indicated that the generated schedules are not only computationally valid but also suitable for use in school operations.

Item Type: Thesis (Skripsi)
Additional Information / Supervisor: Ir. Maria Ulfah Siregar, S.Kom., MIT., Ph.D.
Uncontrolled Keywords: Penjadwalan Otomatis, Genetic Algorithm, Hill Climbing, Hybrid Metaheuristics, Timetabling
Subjects: 000 Ilmu Komputer, Ilmu Informasi, dan Karya Umum > 000 Karya Umum > 006.3 Artificial Intelligence (Kecerdasan Buatan)
Divisions: Fakultas Sains dan Teknologi > Informatika (S1)
Depositing User: Muh Khabib, SIP.
Date Deposited: 19 May 2026 10:59
Last Modified: 19 May 2026 10:59
URI: http://digilib.uin-suka.ac.id/id/eprint/76466

Share this knowledge with your friends :

Actions (login required)

View Item View Item
Chat Kak Imum