Search Optimization of The Shortest Route Using the Generate And Test Algorithm

Padma Mike Putri M(1*),

(1) AMIK KOSGORO
(*) Corresponding Author

Abstract


Searching is a search method that belongs to the science of Artificial intelligence. The Generate and Test algorithm is able to solve problems related to heuristic searches in the terminology of Artificial Intelligence. The problem that often occurs is the user's lack of understanding about the completion of the General and Test Algorithm so that it takes a lot of time and money to get the final value, for that we need a completion of the shortest path search to minimize costs and time. The General And test method is a method of solving search cases The shortest path using several points and weights of the journey where all points must be visited once and the end point of the journey is the same as the starting point of the journey. The final benefit of this research helps users to find a very good alternative to take a decision.

Full Text:

Pdf

References


Rachmat, Antonius. n.d. “Implementasi Algoritma Generate and Test,” no. 1: 1–10.

Y. I. Ilwaru dkk, V. 2017. “Perbandingan Algoritma Hill Climbing Dan Algoritma Ant Colony Dalam Penentuan Rute Optimum Comparison Of Hill Climbing Algorithm And Ant Colony Algorithm In Determining Optimum Route” 11: 139–50.

Dangkua, Eka Vickraien, Vincencius Gunawan, dan Kusworo Adi. 2015. “Penerapan Metode Hill Climbing Pada Sistem Informasi Geografis Untuk Mencari Lintasan Terpendek.” Jurnal Sistem Informasi Bisnis 5 (1): 19–25. https://doi.org/10.21456/vol5iss1pp19-25.

Youllia Indrawaty Nurhasanah, Sofia Umaroh, Ninda Halimah, dan Al Ghoniyyah. 2021. “Pencarian Rute Optimal Dengan Metode Steepest Ascent Hill Climbing Untuk Tempat Wisata Di Bandung Menggunakan Android 1 , 3 Program Studi Informatika , Institut Teknologi Nasional 2 Program Studi Sistem Informasi , Institut Teknologi Nasional membuat wisa” 4 (2): 113–24.

Desti Fitriati, Dkk. 2019. “Implementasi Algoritma Hill Climbing” Jurnal Riset Informatika 1 (3).

Gutin, Gregory. 2013. “Traveling Salesman Problems” 11 (1): 336–59. https://doi.org/10.1201/b16132-25.

Supriana, I Wayan. 2018. “Pencarian Rute Terbaik Untuk Distribusi Bank Sampah Menggunakan Travelling Salesman Problem (Tsp) Studi Kasus Kota Denpasar.” Jurnal Teknologi Informasi dan Komputer 3 (2). https://doi.org/10.36002/jutik.v3i2.298.

Umalia, Astria. 2017. “Minimasi Biaya Distribusi Dengan Menggunakan Metode Traveling Salesman Problem ( TSP ).” Jurnal UMJ, no. November 2017: 1–8. jurnal.umj.ac.id/index.php/semnastek.

Maulana, Algifari. 2021. “Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek” 3: 128–33. https://doi.org/10.30865/json.v3i2.3617.

Auliasari, Karina, Mariza Kertaningtyas, dan Diah Wilis Lestarining Basuki. 2018. “Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem.” Jurnal Sains, Teknologi dan Industri 16 (1): 15. https://doi.org/10.24014/sitekin.v16i1.6109.

Amozhita, K K, Amin Suyitno, dan Mashuri. 2019. “Menyelesaikan Travelling Salesman Problem (TSP) dengan Metode Dua Sisi Optimal pada PT. Es Malindo Boyolali.” Unnes Journal of Mathematics 8 (1): 20–29




DOI: https://doi.org/10.30645/ijistech.v6i1.209

Refbacks

  • There are currently no refbacks.







Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: