IMPLEMENTASI ALGORITMA SIMULATED ANNEALING PADA MASALAH PENJADWALAN PERKULIAHAN (STUDI KASUS DEPARTEMEN PENDIDIKAN MATEMATIKA FPMIPA UPI)

Anisa Dwi Wahyuni, - (2022) IMPLEMENTASI ALGORITMA SIMULATED ANNEALING PADA MASALAH PENJADWALAN PERKULIAHAN (STUDI KASUS DEPARTEMEN PENDIDIKAN MATEMATIKA FPMIPA UPI). S1 thesis, Universitas Pendidikan Indonesia.

[img] Text
S_MAT_1804074_Title.pdf

Download (170kB)
[img] Text
S_MAT_1804074_Chapter1.pdf

Download (47kB)
[img] Text
S_MAT_1804074_Chapter2.pdf
Restricted to Staf Perpustakaan

Download (113kB)
[img] Text
S_MAT_1804074_Chapter3.pdf

Download (205kB)
[img] Text
S_MAT_1804074_Chapter4.pdf
Restricted to Staf Perpustakaan

Download (273kB)
[img] Text
S_MAT_1804074_Chapter5.pdf

Download (29kB)
[img] Text
S_MAT_1804074_Appendix.pdf
Restricted to Staf Perpustakaan

Download (173kB)
Official URL: http://repository.upi.edu/

Abstract

Penelitian ini membahas tentang masalah penjadwalan perkuliahan di Departemen Pendidikan Matematika FPMIPA Universitas Pendidikan Matematika. Penjadwalan perkuliahan (University Course Timetabling Problem (UCTP)) merupakan salah satu masalah optimisasi kombinatorial yang sulit diselesaikan menggunakan metode konvesional karena kompleksitasnya dan termasuk NP-Hard Problem (Nondeterministic Polynomial Time). Pada penelitian ini penulis mengimplementasikan algoritma Simulated Annealing untuk menyelesaikan masalah tersebut. Simulated Annealing merupakan salah satu algoitma percarian lokal (metaheuristic) bersifat generik yang mengadopsi proses pendinginan cairan logam hingga akhirnya menjadi kristal atau disebut annealing. Hasil penelitian menunjukkan bahwa Algoritma Simulated Annealing dapat diimplementasikan pada masalah penjadwalan perkuliahan di Departemen Pendidkan Matematika FPMIPA Universitas Pendidikan Indonesia dan mendapatkan solusi layak yang optimal karena memenuhi seluruh hard constraint dan soft constraint. This research discuss about university course timetabling problem at Department of Mathematics Education, Faculty of Mathematics and Natural Science Education, Indonesia. University course timetabling problem (UCTP) is a combinatorial optimization problem that is hard to solve using conventional methods because of its complexity and because it is a NP-Hard Problem (Nondeterministic Polynomial Time). In this research, we use Simulated Annealing Algorithm to solve the problem. Simulated Annealing is a local search (metaheuristic) algorithm that adopts the cooling process of a molten metal until finally it becomes a crystal. The reseach result show that Simulated Annealing Algorithm can be implemented in the university course timetabling problem at Department of Mathematics Education, Faculty of Mathematics and Natural Science Education, Indonesia University of Education and get an optimal feasible solution because it meets all the hard constraints and soft constraints.

Item Type: Thesis (S1)
Additional Information: Link Google Scholar : 1. https://scholar.google.co.id/citations?user=O2cofUEAAAAJ&hl=en 2. https://scholar.google.co.id/citations?user=udPAIdq9jeAC&hl=id ID SINTA Dosen Pembimbing Khusnul Novianingsih : 258640 Cece Kustiawan : 6674760
Uncontrolled Keywords: Penjadwalan Perkuliahan, Algoritma Simulated Annealing, Model Optimisasi, Solusi Optima
Subjects: L Education > L Education (General)
Q Science > QA Mathematics
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan)
Depositing User: Anisa Dwi Wahyuni
Date Deposited: 20 Sep 2022 04:22
Last Modified: 20 Sep 2022 04:22
URI: http://repository.upi.edu/id/eprint/80587

Actions (login required)

View Item View Item