Pencarian Rute Terpendek Tim Promosi Kampus dengan Menggunakan Algoritma Genetik

Isnaini Muhandhis, M Shubhan, Hisyam Ib Dani, Arkila Rakasyah, Alven S Ritonga, Mamik Usniyah Sari

Abstract

This research aims to make it easier for the campus marketing team to determine the minimum route when visiting several schools in one day. We develop an optimum route search model using a genetic algorithm. The selection method used is elitist selection and the mutation method used is Reciprocal Exchange Mutation. Mutation probability values were determined at 0.2 and 0.4 with different numbers of individuals. The results of this study, in general, a greater probability of mutation causes a significant change in the arrangement of chromosomes, so that the average fitness result is worse than the probability of a smaller mutation. The number of individuals in the population does not really matter. The best solution obtained is the route 0- 2- 8-7-5-4-9-6-3-1 as far as 73 km.

Keywords

optimal;performance;Reciprocal Exchange Mutation

Full Text:

PDF

References

A. Irianti, S. Cokrowibowo and Aswandi, "Optimasi Multiple Traveling Salesman Problem dengan Algoritma Genetika pada Kasus Model Rute Terpendek Penjemputan Sampah di Kabupaten Majene," in Konferensi Nasional Ilmu Komputer (KONIK), -, 2021.

W. T. Ina, S. Manu and T. Y. Mattahine, "PENERAPAN ALGORITMA GENETIKA PADA TRAVELLING SALESMAN PROBLEM (TSP) (STUDI KASUS: PEDAGANG PERABOT KELILING DI KOTA KUPANG)," Jurnal Media Elektro, vol. VIII, no. 1, pp. 48-53, 2019.

E. Sanggala, "Pengembangan Aplikasi Algoritma Genetika Berbasis Vba Excel Untuk Menyelesaikan Travelling Salesman Problem (Contoh Kasus: Tsp 20 Kota Di Rusia)," Media Jurnal Informatika, vol. 12, no. 1, pp. 5-11, 2020.

A. W. Widodo and W. F. Mahmudy, "PENERAPAN ALGORITMA GENETIKA PADA SISTEM REKOMENDASI WISATA KULINER," Jurnal Ilmiah KURSOR, vol. 5, no. 4, pp. 205-211, 2010.

S. Lukas, T. Anwar and W. Yuliani, "PENERAPAN ALGORITMA GENETIKA UNTUK TRAVELING SALESMAN PROBLEM DENGAN MENGGUNAKAN METODE ORDER CROSSOVER DAN INSERTION MUTATION," in Seminar Nasional Aplikasi Teknologi Informasi , Yogyakarta, 2005.

R. Hidayati, I. Guntoro and S. Junianti, "PENGGUNAAN METODE SIMULATED ANNEALING UNTUK PENYELESAIAN TRAVELLING SALESMAN PROBLEM," Journal of Computer Engineering System and Science, vol. 4, no. 2, pp. 217-221, 2019.

M. V. Andriansyah, R. A. Darajatun and D. N. Rinaldi, "OPTIMALISASI PENDISTRIBUSIAN DENGAN METODE TRAVELLING SALESMAN PROBLEM UNTUK MENENTUKAN RUTE TERPENDEK DI PT XYZ," Tekmapro : Journal of Industrial Engineering and Management, vol. 16, no. 2, pp. 84-95, 2021.

I. Saputra and D. Ahmad, "Algoritma Genetika Untuk Menentukan Jalur Terpendek Wisata Kota Bukittinggi," Journal of Mathematics UNP, vol. 3, no. 1, pp. 33-36, 2020.

H. Santoso and R. Sanuri, "Implementasi Algoritma Genetika Dan Google Maps API Dalam Penyelesaian Traveling Salesman Problem With Time Window (TSP-TW) Pada Penjadwalan Rute Perjalanan Divisi Pemasaran STMIK El Rahma," TEKNIKA, vol. 8, no. 2, pp. 110-118, 2019.

Rismayani, "Pemanfaatan teknologi google maps api untuk aplikasi laporan kriminal berbasis android pada Polrestabes Makasar," Jurnal Penelitian Pos dan Informatika, vol. 6, no. 2, pp. 185 - 200, 2016.

DOI: https://doi.org/10.31284/j.jtm.2023.v4i1.4106

Refbacks

  • There are currently no refbacks.