Jurnal Teknoif Teknik Informatika Institut Teknologi Padang
Vol 11 No 2 (2023): TEKNOIF OKTOBER 2023

A, Analisis Pengaruh Probabilitas Crossover Terhadap Kinerja Algoritma Genetika Dalam Optimasi Penjadwalan Matakuliah

Salman, Rudi (Unknown)
Suprapto (Unknown)
Irfandi (Unknown)



Article Info

Publish Date
30 Oct 2023

Abstract

Genetic Algorithm speed is determined by computation time. Computing time in AG for finding the optimum value is strongly influenced by the following parameters: population size, crossover probability (Pc), mutation probability (Pm), and the selected selection method. Pc is one of the essential parameters in AG. A chromosome that will reach the best solution can be obtained from the crossover process of the two parent chromosomes. The Pc value strongly influences the crossover process. Determining the appropriate and correct Pc value indicates how large the parent chromosome will experience crossover.The method used to analyze the effect of Pc on AG performance is changing the Pc value between 0.80-0.95. The simulation used MATLAB R2012b to obtain the best computational time for each Pc value. Meanwhile, the other AG parameters remained the same: Pm=0.05 and population size=100 for each change of Pc value.The test results using MATLABR2012b show that the fastest computing time is in the range of Pc values between 0.85-0.95 with an average computation time of 0.14564s. This indicates that for the case of optimizing the scheduling of courses in the Unimed Electrical Engineering study program, the Pc value between 0.85-0.95 will provide the fastest computation time.

Copyrights © 2023






Journal Info

Abbrev

teknoif

Publisher

Subject

Computer Science & IT Control & Systems Engineering

Description

The editors of the Jurnal TeknoIf Institut Teknologi Padang (Teknoif) are pleased to present this call for papers on Information Technology. Teknoif specifically focuses on experimental study, design, planning and modeling, implementation method, and literature study. Topics include, but are not ...