ANALISIS PERFORMA DARI ONE-POINT,  MULTI-POINT DAN ORDER CROSSOVER  DI ALGORITMA GENETIKA

Ahmad Miftah Fajrin

ANALISIS PERFORMA DARI ONE-POINT, MULTI-POINT DAN ORDER CROSSOVER DI ALGORITMA GENETIKA

Ahmad Miftah Fajrin

Abstract

Algoritma Genetika (GA) adalah salah satu algoritma yang powerful untuk menyelesaikan masalah penjadwalan mata kuliah. Pada GA, terdapat operator crossover yang berperan aktif dalam pembuatan anak atau offspring. Crossover juga menjadi fondasi dalam menghasilkan solusi yang optimal. Kesalahan dalam pemilihan crossover membuat meningkatnya tingkat pelanggaran atau fitness terhadap constraint. Semakin tinggi nilai Fitness maka semakin buruk solusi yang dihasilkan. Pada penelitian ini, dilakukan analisis terdapat jenis crossover yang ada di GA yaitu One-Point Crossover, Multi-Point Crossover dan Order Crossover. Analisis yang dilakukan pada penelitian ini adalah dengan membandingkan nilai fitness dan waktu eksekusi antara jenis crossover tersebut. Hasil penelitian menunjukkan bahwa nilai fitness yang paling kecil dapat dihasilkan oleh One-Point Crossover pada 9 dataset. Untuk waktu eksekusi yang paling cepat dapat dihasilkan oleh Multi-Point Crossover pada 12 dataset.

Kata kunci; Algoritma Genetika, Crossover, Penjadwalan, Pelanggaran

Full Text:

PDF

References

G. Panchal and D. Panchal, “Solving NP hard Problems using Genetic Algorithm,” vol. 6, no. 2, pp. 1824–1827, 2015.

V. Rohini and A. M. Natarajan, “Comparison of genetic algorithm with Particle Swarm Optimisation, ant colony optimisation and Tabu search based on university course scheduling system,” Indian J. Sci. Technol., vol. 9, no. 21, 2016, doi: 10.17485/ijst/2016/v9i21/85379.

K. Kumar, “Genetic Algorithm: Review and Application,” Int. J. Tech. Res., vol. 2, no. 3, 2013, [Online]. Available: http://www.csjournals.com/IJITKM/PDF 3-1/55.pdf.

T. Song, S. Liu, X. Tang, X. Peng, and M. Chen, “An iterated local search algorithm for the University Course Timetabling Problem,” Appl. Soft Comput. J., vol. 68, pp. 597–608, 2018, doi: 10.1016/j.asoc.2018.04.034.

S. Jaengchuea and D. Lohpetch, “A hybrid genetic algorithm with local search and tabu search approaches for solving the post enrolment based course timetabling problem: Outperforming guided search genetic algorithm,” Proc. - 2015 7th Int. Conf. Inf. Technol. Electr. Eng. Envisioning Trend Comput. Inf. Eng. ICITEE 2015, pp. 29–34, 2015, doi: 10.1109/ICITEED.2015.7408907.

M. W. S. Almeida, J. P. S. Medeiros, and P. R. Oliveira, “Solving the academic timetable problem thinking on student needs,” Proc. - 2015 IEEE 14th Int. Conf. Mach. Learn. Appl. ICMLA 2015, pp. 673–676, 2016, doi: 10.1109/ICMLA.2015.184.

J. Liu and W. Li, “Greedy Permuting Method for Genetic Algorithm on Traveling Salesman Problem,” Proc. 2018 IEEE 8th Int. Conf. Electron. Inf. Emerg. Commun. ICEIEC 2018, pp. 47–51, 2018, doi: 10.1109/ICEIEC.2018.8473531.

Q. Zhu et al., “A novel adaptive hybrid crossover operator for multiobjective evolutionary algorithm,” Inf. Sci. (Ny)., vol. 345, pp. 177–198, 2016, doi: 10.1016/j.ins.2016.01.046.

T. Informatika, “Pemilihan Crossover Pada Algoritma Genetika Untuk Program Aplikasi Pengenalan,” J. Ilmu Komput. dan Sist. Inf., pp. 69–72.

A. M. Fajrin and C. Fatichah, “Multi-parent order crossover mechanism of genetic algorithm for minimizing violation of soft constraint on course timetabling problem,” Regist. J. Ilm. Teknol. Sist. Inf., vol. 6, no. 1, 2020, doi: 10.26594/register.v6i1.1663.

S. Abdullah and H. Turabieh, “On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems,” Inf. Sci. (Ny)., vol. 191, pp. 146–168, 2012, doi: 10.1016/j.ins.2011.12.018.

F. A. Zainuddin, F. A. Samad, and D. Tunggal, “A Review of Crossover Methods and Problem Representation of Genetic Algorithm in Recent Engineering Applications Faculty of Mechanical Engineering , Universiti Teknikal Malaysia Melaka , Hang Tuah Jaya , 76100 2 . Principles of Genetic Algorithm,” vol. 29, no. 6, pp. 759–769, 2020.

G. A. Akbar and F. Shigeru, “Solving University Course Timetabling Problem Using Multi-Depth Genetic Algorithm,” vol. 01001, 2020.

W. Chinnasri, S. Krootjohn, and N. Sureerattanan, “Performance comparison of Genetic Algorithm’s crossover operators on University Course Timetabling Problem,” Comput. Technol. Inf. Manag. (ICCM), 2012 8th Int. Conf., vol. 2, pp. 781–786, 2012, doi: 10.4156/ijact.vol4.issue20.8.

R. Kumar and Jyotishree, “Blending Roulette Wheel Selection & Rank Selection in Genetic Algorithms,” Int. J. Mach. Learn. Comput., vol. 4, no. October, pp. 365–370, 2012, doi: 10.7763/IJMLC.2012.V2.146.

Refbacks

There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Editor's Address :

Informatics Engineering Department of Halu Oleo University, Engineering Faculty Building 3rd Floor
H.E.A. Mokodompit Street, Bumi Tridharma Green Campus, Halu Oleo University

Telp. (0401) 3196237
Fax. (0401) 3195287
Website:http://ojs.uho.ac.id/index.php/semantik/index
E-mail: semantik.informatika@uho.ac.id