Penentuan Rute Optimal Untuk Jasa Pengiriman Barang Menggunakan Algoritma Genetika

  • Gatra Cahya Ramadhan Universitas Islam Majapahit
  • Pratama Bagus W Universitas Islam Majapahit
  • Yesy Diah Rosita Universitas Islam Majapahit
Keywords: Freight Forwarding Services, TSP, Genetic Algorithms, Optimal Route Search

Abstract

In the delivery process there is a problem commonly known as the Travelling Salesman Problem (TSP), therefore a program is needed that can minimize shipping costs and find a quick route to maximize the profits obtained. Then, set up alternative routes and optimum routes so that the problem can be solved. The purpose of this research is to determine the route or route and the minimum distance search results in goods delivery services using the method of genetic algorithms. Using 27 randomly selected data points from four sub-districts in the Mojokerto district, Clustering data is divided into three clusters and tested using MATLAB software. Using a crossover probability of 0.6, the probability of mutation is 0.4, and the total population is 27. The results of the test in finding the optimal route and the fast track are in the second cluster with a distance of 20 km and the optimal route of 5-8-7-1-9-4 -10-3-6-2-5, i.e., Dsn. Mojoroto, Banjartanggul, Dsn. Sumber Bendo, Perum Mojo Asri, Wonokoyo, Dsn. Trawas, Wonokusumo, Dsn. Pecuk, Dsn. Resik Bulu, Damarsi, Etc. Mojoroto From the optimal route generated in this study, it is expected that the shipping service can get the optimal route to speed up the delivery of goods.

Downloads

Download data is not yet available.

References

[1] M. Metode, F. Multiple, C. Decision, M. Fmcdm, and D. Yogyakarta, “Indonesian Journal of Business Intelligence,” vol. 3, no. 2, pp. 54–60, 2020.
[2] R. A. Pratama, E. C. Djamal, and A. Komarudin, “Optimalisasi Pengantaran Barang dalam Perdagangan Online Menggunakan Algoritma Genetika,” Semin. Nas. Apl. Teknol. Inf., pp. 11–15, 2017.
[3] P. D. Bangsa and I. Hermawan, “Jurnal Teknologi Terpadu,” J. Teknol. Terpadu, vol. 7, no. 1, pp. 15–22, 2021, [Online]. Available: https://media.neliti.com/media/publications/493730-water-ph-and-turbidity-control-system-in-0a553e14.pdf
[4] N. D. Priandani and W. F. Mahmudy, “Optimasi Travelling Salesman Problem With Time Windows ( Tsp-Tw ) Pada Penjadwalan Paket Rute Wisata,” Semin. Nas. Sist. Inf. Indones., no. November, pp. 2–3, 2015.
[5] A. B. Prakoso, Y. Ariyanto, and A. R. T. Hayati Ririd, “Optimasi Rute Lokasi Wisata Kota Malang Menggunakan Metode Algoritma Genetika,” J. Inform. Polinema, vol. 3, no. 3, p. 48, 2017, doi: 10.33795/jip.v3i3.34.
[6] A. Wijanarko, E. L. Amalia, and ..., “Pencarian Rute Terpendek Dengan Pendekatan TSP Menggunakan Metode Algoritma Genetika Studi Kasus Kabupaten Nganjuk,” Semin. Inform. …, pp. 100–105, 2021, [Online]. Available: http://jurnalti.polinema.ac.id/index.php/SIAP/article/view/884
[7] V. Risqiyanti, H. Yasin, and R. Santoso, “Pencarian Jalur Terpendek Menggunakan Metode Algoritma ‘Ant Colony Optimization’ Pada GUI Matlab (Studi Kasus: PT Distriversa Buana Mas cabang Purwokerto),” J. Gaussian, vol. 8, no. 2, pp. 272–284, 2019, doi: 10.14710/j.gauss.v8i2.26671.
[8] B. Rahmat et al., “Implemetasi k-means clustering pada rapidminer untuk analisis daerah rawan kecelakaan,” Semin. Nas. Ris. Kuantitatif Terap. 2017, no. April, pp. 58–60, 2017, [Online]. Available: https://ojs.innov-center.org/index.php/snrkt2017/article/download/10/9
[9] W. T. Ina, S. Manu, T. Y. Mattahine, T. Elektro, U. Nusa, and C. Kupang, “PENERAPAN ALGORITMA GENETIKA PADA TRAVELLING SALESMAN PROBLEM ( TSP ) ( STUDI KASUS : PEDAGANG PERABOT KELILING DI KOTA KUPANG ),” vol. VIII, no. 1, pp. 48–53.
[10] B. Menggunakan Algoritma Genetika Di Buka Mata Adv Teguh Nurhadi Suharsono and M. Reza Saddat, “Penentuan Optimalisasi TSP (Travelling Salesman Problem) Distribusi,” pp. 326–335, 2017.
[11] I. Print and I. Online, “Jurnal Manajemen Industri dan Logistik RANCANG BANGUN DECISION SUPPORT SYSTEM UNTUK PEMILIHAN RUTE PENGIRIMAN PAKET PADA PERUSAHAAN PENYEDIA JASA LOGISTIK,” no. November, 2018.
[12] T. A. Gani, Y. Away, M. T. Elektro, T. Elektro, and U. S. Kuala, “Fitness sharing ApplicationFor diversity Control with Evolutionary Algorithm To ResolveTravelling Salesman problem ( TSP ),” vol. 5, no. 1, pp. 1–7, 2016.
[13] T. Listyorini et al., “IMPLEMENTASI POPULATION RESIZING ON FITNESS IMPROVEMENT GENETIC ALGORITHM ( PROFIGA ) UNTUK OPTIMASI RUTE KUNJUNGAN PROMOSI UNIVERSITAS MURIA KUDUS BERBASIS,” vol. 7, no. 1, pp. 59–68, 2016.
[14] Y. D. Darmi and A. Setiawan, “Penerapan Metode Clustering K-Means Dalam Pengelompokan Penjualan Produk,” J. Media Infotama, vol. 12, no. 2, pp. 148–157, 2017, doi: 10.37676/jmi.v12i2.418.
Published
2023-05-29
How to Cite
[1]
G. C. Ramadhan, P. Bagus W, and Y. Diah Rosita, “Penentuan Rute Optimal Untuk Jasa Pengiriman Barang Menggunakan Algoritma Genetika”, jtim, vol. 5, no. 1, pp. 48-55, May 2023.
Section
Articles