Putri Bunga Rahmalita
Fakultas Ilmu Komputer, Universitas Brawijaya

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Optimasi Penjadwalan Sidang Skripsi Menggunakan Algoritme Genetika Terdistribusi (Studi Kasus : Prodi Teknik Informatika Fakultas Ilmu Komputer Universitas Brawijaya) Putri Bunga Rahmalita; Agus Wahyu Widodo; Muh. Arif Rahman
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 5 (2019): Mei 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (369.844 KB)

Abstract

There are several problems on thesis scheduling in Informatics Engineering Study Program Faculty of Computer and Science Brawijaya University that makes thesis scheduling ineffective. Significant differences in the number of students and lecturers in 2017 as well as thesis trial registration in the adjacent time is often a problem in scheduling thesis hearings. Ineffective scheduling will take a long time. Therefore, need a system that can be made using a distributed genetic algorithm method to do thesis trial scheduling. The first step in system is randomize chromosomes and then the population will be divided into several subpopulations, and will go through the reproductive stage, then through evaluation to calculate the fitness value. Selection process will be selected for the next generation. In the distributed genetic algorithm a migration process will be carried out to increase the diversity of individuals by exchanging individuals from one subpopulation to another. Based on the test, the optimal parameter value in the thesis trial scheduling is 11 populations, 1750 generations, the crossover rate is 0.7 mutation rate 0.3 and sub-populations with an average fitness value of 0.00010232. From the results of the test, if there is more population and generation, the wider and bigger the search area for the solution will be, but a cost of a longer computing time.