Implementation of The Shortest Route Value Calculation Using The Generate and Test Algorithm

Andri Yunaldi(1*),

(1) AMIK KOSGORO
(*) Corresponding Author

Abstract


Search and tracking issues are important in determining the success of a system based on Artificial Intelligence. One that is well known is the Generate and Test method which is one of several heuristic search models in Artificial Intelligence terminology. Generate and Test is an algorithm that performs tests to find the shortest route in the case of a trip. Generete and test is suitable for measuring the smallest distance. The benefit of this research is to save time and money in traveling the distance to a city. How it works in this algorithm is to see the initial state as a star point and see the final state as a goal state. Perform all calculations to each distance provided that it starts from the initial strat and ends with the end strat. Count all values, choose the smallest value to reach the Final goal. If the search results have been found then the search is stopped, if not the solution then the search continues until it finds the smallest result to find a solution.

Full Text:

Pdf

References


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.

Candrawati, Luh Gede Ayu, dan I Gusti Agung Gede Arya Kadyanan. 2017. “Optimasi Traveling Salesman Problem (TSP) Untuk Rute Paket Wisata Di Bali dengan Algoritma Genetika.” Jurnal Ilmiah Komputer 10 (1): 27–32.

Hutahaean, H. D. (2018). Penerapan Metode Best First Search Pada Permainan Tic Tac Toe. Journal Of Computer Networks, Architecture and High Performance Computing, 1(1), 10–15. https://doi.org/10.47709/cnapc.v1i1.3.

Made, Pande, Rai Raditya, dan Candra Dewi. 2018. “Optimasi Multiple Travelling Salesman Problem ( M-TSP ) Pada Penentuan Rute Optimal Penjemputan Penumpang Travel Menggunakan Algoritme Genetika” 2 (10): 3560–68.

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.

Feddy Setio, dan Anggraini Mulwinda. 2020. “Pencarian Rute Terpendek Dengan Menggunakan Algoritma Depth First , Breath First Dan Hill Climbing ( Study Comparative ),” 1–10.

Puspitasari, Citra, Yesy Diah, dan Rosita Yunita. n.d. “Optimasi Rute Sales Pengiriman Berdasarkan Jarak dengan Metode Simple Hill Climbing ( Studi Kasus CV Maju Jaya ),” 1–8.

Rahmadi, Ridho. 2010. “Implementasi Metode Generate And Test Dalam Menyelesaikan Travelling Salesman Problem Menggunakan Robot Bersensor” 2010 (Snati): 29–34.

Rohman, Saiful, La Zakaria, Asmiati Asmiati, dan Aang Nuryaman. 2020. “Optimisasi Travelling Salesman Problem dengan Algoritma Genetika pada Kasus Pendistribusian Barang PT. Pos Indonesia di Kota Bandar Lampung.” Jurnal Matematika Integratif 16 (1): 61. https://doi.org/10.24198/jmi.v16.n1.27804.61-73.

Sisi, D U A, Optimal Pada, P T Es, dan Malindo Boyolali. 2019. “Menyelesaikan Travelling Salesman Problem Dengan Metode” 8 (1).

Sulistiyani, D. F., Ramadhany, Z.. (2021). Implementasi Algoritma Generate And Test Untuk Optimalisasi. 4(2), 106–114




DOI: https://doi.org/10.30645/ijistech.v6i2.233

Refbacks

  • There are currently no refbacks.







Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: