Brilliant, Thomas Felix (2026) Rancang Bangun Program Penjadwalan Mata Kuliah Teknik Informatika ITS Surabaya Menggunakan Metode Simulated Annealing. Other thesis, Institut Teknologi Sepuluh Nopember.
|
Text
05111940000062-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (2MB) | Request a copy |
Abstract
Penjadwalan mata kuliah di Departemen Teknik Informatika ITS merupakan permasalahan NP-hard yang sulit diselesaikan secara manual karena kompleksitas variabel dosen, waktu, dan ruang. Penelitian ini bertujuan mengotomatisasi proses tersebut menggunakan algoritma simulated annealing melalui optimasi konfigurasi parameter. Sistem dikembangkan menggunakan bahasa pemrograman Python berbasis Command Line Interface (CLI).Penelitian berfokus pada evaluasi kinerja algoritma melalui analisis sensitivitas parameter. Hasil pengujian menunjukkan bahwa konfigurasi suhu awal T = 10.000 dengan laju pendinginan alpha = 0,9995 merupakan kombinasi paling optimal. Skenario ini mampu menghasilkan solusi jadwal yang valid dengan rata-rata waktu komputasi kurang dari 2 menit, tingkat keberhasilan pemenuhan hard constraint mencapai 100%, serta distribusi beban kerja dosen yang lebih merata dibandingkan metode manual.
========================================================================================================================
Course timetabling at the Department of Informatics, Institut Teknologi Sepuluh Nopember (ITS), is an NP-hard problem that is challenging to solve manually due to the complexity of lecturer, time, and room variables. This study aims to automate this process using the Simulated Annealing algorithm through parameter configuration optimization. The system was developed using the Python programming language with a Command Line Interface (CLI). The research focuses on evaluating algorithm performance through parameter sensitivity analysis. The test results indicate that the configuration of an initial temperature of t = 10.000 with a cooling rate of alpha = 0,9995 is the optimal combination. This scenario is capable of generating valid schedule solutions with an average computation time of less than 2 minutes, achieving a 100% success rate in hard constraint satisfaction, and providing a more balanced lecturer workload distribution compared to the manual method.
| Item Type: | Thesis (Other) |
|---|---|
| Uncontrolled Keywords: | Penjadwalan Mata Kuliah, Simulated Annealing, Optimasi Kombinatorial, Otomatisasi, Metaheuristik, Course Timetabling, Combinatorial Optimization, Automation, Meta-Heuristic |
| Subjects: | T Technology > T Technology (General) T Technology > T Technology (General) > T57.84 Heuristic algorithms. |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
| Depositing User: | Thomas Felix Brilliant |
| Date Deposited: | 30 Jan 2026 03:11 |
| Last Modified: | 30 Jan 2026 03:11 |
| URI: | http://repository.its.ac.id/id/eprint/131227 |
Actions (login required)
![]() |
View Item |
