Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek
DOI:
https://doi.org/10.30865/json.v3i2.3617Keywords:
Generate and Test Algorithm, Searching, Shortest Route, Dept. First Search, Artificial intelligenceAbstract
The Generate and Tesr algorithm is a very simple method in a heuristic search. The completion process of this algorithm is a combination of depth-first search with backtracking because the solution must be generated completely before testing. systematically and following procedures will find a solution. The problem in this study is that if the problem discussed in the Generate test algorithm is very broad, it takes a long time to solve it. The main purpose of this study is to find the shortest alternative route to find a solution in order to obtain the smallest route so as to save transportation costs. The final result of this study obtained 8 paths to the final destination, 2 paths that have the shortest route, namely the A-C-F-I-T and A-C-E-G-T routes. So that the tests carried out can pass through 2 paths to be able to visit the city.References
Chanda Halim and Hendri Prasetyo, “Penerapan Artificial Intelligence dalam Computer Aided Instructure(CAI),†Jurnal Sistem Cerdas, vol. 1, no. 1, pp. 50–57, 2018, doi: 10.37396/jsc.v1i1.6.
A. Rachmat, “Implementasi Algoritma Generate and Test,†no. 1, pp. 1–10.
D. T. Wiyanti and U. Semarang, “Algoritma optimasi untuk penyelesaian travelling salesman problem,†vol. 11, no. 1, pp. 1–6, 2013.
S. Rohman and L. Zakaria, “Optimisasi Travelling Salesman Problem dengan Algoritma Genetika pada Kasus Pendistribusian Barang PT . Pos Indonesia di Kota Bandar Lampung,†vol. 16, no. 1, pp. 61–73, 2020, doi: 10.24198/jmi.v16.n1.27804.61-73.
E. V. Dangkua, V. Gunawan, and K. Adi, “Penerapan Metode Hill Climbing Pada Sistem Informasi Geografis Untuk Mencari Lintasan Terpendek,†Jurnal Sistem Informasi Bisnis, vol. 5, no. 1, pp. 19–25, 2015, doi: 10.21456/vol5iss1pp19-25.
R. Rahmadi, “Implementasi Metode Generate and Test Dalam Menyelesaikan Travelling Salesman Problem Menggunakan Robot Bersensor,†Seminar Nasional (SNATI), vol. 2010, no. Snati, pp. 29–34, 2010.
V. Y. I. Ilwaru, T. Sumah, Y. A. Lesnussa, and Z. A. Leleury, “Perbandingan Algoritma Hill Climbing Dan Algoritma Ant Colony Dalam Penentuan Rute Optimum,†BAREKENG: Jurnal Ilmu Matematika dan Terapan, vol. 11, no. 2, pp. 139–150, 2017, doi: 10.30598/barekengvol11iss2pp139-150.
A. Satriyo, “Penerapan Metode Simple Hill Climbing Dalam Menentukan Rute Terpendek Pada Pengiriman ( Studi Kasus di Supplier Hotel ),†vol. X, pp. 79–83.
H. D. Hutahaean, “Penerapan Metode Best First Search Pada Permainan Tic Tac Toe,†Journal Of Computer Networks, Architecture and High Performance Computing, vol. 1, no. 1, pp. 10–15, 2018, doi: 10.47709/cnapc.v1i1.3.
D. F. Sulistiyani et al., “Implementasi Algoritma Generate And Test Untuk Optimalisasi,†vol. 4, no. 2, pp. 106–114, 2021.
C. Puspitasari, Y. Diah, and R. Yunita, “Optimasi Rute Sales Pengiriman Berdasarkan Jarak dengan Metode Simple Hill Climbing ( Studi Kasus CV Maju Jaya ),†pp. 1–8.
J. R. Informatika, “Implementasi Algoritma Hill Climbing Pada Penentuan,†vol. 1, no. 3, 2019.
J. T. Industri, F. Teknik, and U. Tanjungpura, “Pengoptimalan Saluran Distribusi Kue Dengan Metode Travelling Salesman Problem (TSP) Untuk Minimasi Jarak Dengan Rute Terpendek,†pp. 82–88.
