Please use this identifier to cite or link to this item: http://repository.uinjkt.ac.id/dspace/handle/123456789/42980
Title: Application of Genetic Algorithm in the Concept of Class Scheduling Faculty of Science and Technology UIN Syarif Hidayatullah Jakarta
Authors: Sunan Parera
Husni Teja Sukmana
Luh Kesuma Wardhani
Issue Date: 2016
Publisher: IEEE
Series/Report no.: International Conference on Cyber and IT Service Management (CITSM);Vol. 1 (Hal. 118-122)
Abstract: The objective of this research is about building a class scheduling application using genetic algorithm. The parameters used in genetic algorithms namely: iteration, PM (Probability Mutation), PC (Probability crossover). In Faculty of Science and Technology UIN Jakarta, class schedule built by a staff. The staff faces numbers of obstacles when building the schedule, among others: the limitations of the classroom and schedule of lectures, and large number of students. However, it is able to overcome the obstacles but it takes quite a long time to build. To optimize the tasks, an application using genetic algorithm is suggested. In this research, interviews and literature studies are used as research methodology, Waterfall as application development methods and genetic algorithms for scheduling. This application was developed using HTML, PHP, and MySQL. To get the optimal parameter values, some variance of iteration (ns), PC, PM values were tested. The results show that the optimal value for gaining the best schedule are maximum of 20 iterations, PC 0.8 and PM 0.01. Using this values, the class scheduling application generates approximately 1,201 without any clash among the data and this application can facilitate the building of class schedule.
metadata.dc.description.uri: http://ieeexplore.ieee.org/document/7577525/
URI: http://repository.uinjkt.ac.id/dspace/handle/123456789/42980
ISBN: 978-1-4673-8442-1
Appears in Collections:Artikel

Files in This Item:
File SizeFormat 
HUSNI TEJA SUKMANA-FST.pdf240.22 kBAdobe PDFView/Open


Items in UINJKT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.