Comparison of Genetic Algorithm with Differential Evolution in Study Scheduling Nur Lukman 1, Mohamad Irfan 2, Adi Nugraha3
Department Informatic Engineering, UIN Sunan Gunung Djati Bandung
Abstract
This Pa per proposes to discuss the complexity of scheduling by comparing two optimization methods that are genetic algorithms with differential Evolution. Genetic Algorithms can solve the most simple to complex problems as well. Therefore the Genetic algorithm is precisely applied to the scheduling of subjects. Then another appropriate optimization method for completing optimization is the Differential Evolution (DE) algorithm. DE algorithm is a fast and effective search algorithm in solving numerical and finding optimal global solutions. The steps of the two algorithms are initialization, participation, mutation, crossover, and selection. The scheduling system produces non-optimal schedules for teacher conflicts and empty slot schedules. After the genetic algorithm and differential evolution are applied, an analysis of the results of the subject scheduling is then performed by comparing the fitness values and the execution speed of the two algorithms. genetic algorithm found only 2 perfect schedules out of 10 experiments, whereas in the implementation of differential algorithms, there are 7 perfect schedules out of 10 experiments. Thus it can be concluded that by determining the value of the producing parameters 5, generation 50, mutation 0.6, and crossover 0.2, the differential evolution produces better output or conformity values using genetics
