Misbahul Ilmi, Muhammad (2015) Optimasi jadwal perkuliahan menggunakan algoritma particle swarm optimization: Studi kasus Fakultas Sains dan Teknologi Universitas Islam Negeri Maulana Malik Ibrahim Malang. Undergraduate thesis, Universitas Islam Negeri Maulana Malik Ibrahim.
|
Text (Fulltext)
09650035.pdf - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview |
Abstract
INDONESIA:
Penjadwalan merupakan proses menempatkan data penjadwalan pada hari, ruang dan waktu yang sesuai bobot SKS. Penempatan posisi tersebut tidak boleh melanggar hard constraints. Sistem ini menggunakan algoritma particle swarm optimization. Pembentukan solusi dengan particle swarm optimization masih ada kemungkinan mata kuliah yang belum terjadwal, karena particle swarm optimization digunakan untuk membuat jadwal sehingga jadwal yang dihasilkan tidak melanggar hard constraint. Particle swarm optimization akan digunakan untuk membentuk jadwal yang tidak melanggar hard constraints. Pada awal dibangkitkan dengan jadwal acak, lalu dilanjutkan dengan algoritma particle swarm optimization untuk mengatur agar tidak melanggar hard constraints.Hasil uji coba penjadwalan yang dihasilkan oleh particle swarm optimization tidak ada matakuliah yang melanggar hard constraints. Jadwal yang tidak melanggar hard constraints bisa dikatakan jadwal yang valid.
ENGLISH:
Scheduling is the process of putting the scheduling data subject on day, space and time corresponding weights credits. The placement must not violate hard constraints and soft constraints. This application uses particle swarm optimization (PSO). The formation of the initial solution with particle swarm optimization is still a possibility that the course has not been scheduled, because the PSO will make the schedule so that resulting schedule does not violate the hard constraint. First step, awakening schedul with random the schedule. Then, the random schedule will process with particle swarm optimization algorithm to make the schedule so that resulting schedule does not violate the hard constraints and no subject missed. However, although there are schedule that violates hard constraints that schedule is said to be a valid class schedules.
Item Type: | Thesis (Undergraduate) | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Supervisor: | Fatchurrochman, Fatchurrochman and Syauqi, A’la | |||||||||
Contributors: |
|
|||||||||
Keywords: | Particle Swarm Optimization; Penjadwalan Mata Kuliah; Optimasi; Scheduling; Optimization | |||||||||
Departement: | Fakultas Sains dan Teknologi > Jurusan Teknik Informatika | |||||||||
Depositing User: | Dian Anesti | |||||||||
Date Deposited: | 19 Jul 2016 17:21 | |||||||||
Last Modified: | 19 Jul 2016 17:21 | |||||||||
URI: | http://etheses.uin-malang.ac.id/id/eprint/3422 |
Downloads
Downloads per month over past year
Actions (login required)
![]() |
View Item |