OPTIMASI PEMBAGIAN KELOMPOK KKN UIN SUNAN KALIJAGA YOGYAKARTA MENGGUNAKAN ALGORITMA GENETIKA

SITI FATIMAH, NIM. 12650103 (2017) OPTIMASI PEMBAGIAN KELOMPOK KKN UIN SUNAN KALIJAGA YOGYAKARTA MENGGUNAKAN ALGORITMA GENETIKA. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

[img]
Preview
Text (OPTIMASI PEMBAGIAN KELOMPOK KKN UIN SUNAN KALIJAGA YOGYAKARTA MENGGUNAKAN ALGORITMA GENETIKA)
12650103_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf

Download (2MB) | Preview
[img] Text (OPTIMASI PEMBAGIAN KELOMPOK KKN UIN SUNAN KALIJAGA YOGYAKARTA MENGGUNAKAN ALGORITMA GENETIKA)
12650103_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf
Restricted to Registered users only

Download (5MB)

Abstract

Kuliah Kerja Nyata-KKN (Community Development Program) is a form of community service activities by students with cross-scientific and sectoral approaches at the time and area of interest. Service learning activities in UIN Sunan Kalijaga Yogyakarta is coordinated by Center for Research and Community Engagement (Lembaga Penelitian dan Pengabdian Masyarakat-LPPM), one of them is grouping KKN. During this time the distribution of the group was carried out by LPPM still using manual systems. Optimization is needed within these grouping KKN. Due to the distribution of the group KKN involves many criteria, such as: gender, faculty, study program, vehicle ownership and ownership records a history of illness, so that the process of division of the group becomes more complicated and longer. Optimization within these distribution KKN is required to seek the best solutions from the alternatives available in order to process the distribution of KKN easier and quickly. This study aims to solve the problem of the division of the group KKN with implementing the genetic algorithm. Steps in genetic algorithm including initial population generation, selection, crossover, mutation and the last elitism. Chromosome representation presented by partitioning based approach randomly generated. The rules within these divisions KKN serve as constraints with corresponding weights priority. The best solution is its fitness value of chromosome 1 and is able to provide solutions quickly. Results from this study is that the genetic algorithm is able to achieve the fitness value 1. Genetic algorithm is able to solve the problem of the division of the group KKN with the rules prescribed. The average time to takes get a solution to the division of the 1500 participants into 150 groups KKN is 15219.1 ms and 4.99% standart error ratio from average time needed to find a solution.

Item Type: Thesis (Skripsi)
Additional Information: Nurochman, M.Kom.
Uncontrolled Keywords: Genetic algorithm, Kuliah Kerja Nyata, Optimization
Subjects: Tehnik Informatika
Divisions: Fakultas Sains dan Teknologi > Teknik Informatika (S1)
Depositing User: Miftahul Ulum [IT Staff]
Date Deposited: 21 Jul 2017 08:07
Last Modified: 21 Jul 2017 08:07
URI: http://digilib.uin-suka.ac.id/id/eprint/26711

Share this knowledge with your friends :

Actions (login required)

View Item View Item
Chat Kak Imum