Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek

Authors

  • Algifanri Maulana Universitas Putera Batam, Kepuluan Riau

DOI:

https://doi.org/10.30865/json.v3i2.3617

Keywords:

Generate and Test Algorithm, Searching, Shortest Route, Dept. First Search, Artificial intelligence

Abstract

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.

Downloads

Published

2021-12-31

How to Cite

Maulana, A. (2021). Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek. Jurnal Sistem Komputer Dan Informatika (JSON), 3(2), 128–133. https://doi.org/10.30865/json.v3i2.3617

Issue

Vol. 3 No. 2 (2021): Desember 2021

Section

Articles

License

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

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).