Algoritma General and Test Menggunakan Metode Depth First Search Dalam Penentuan Jalur Rute Terpendek

Weni Lestari Putri(1*), Nanda Jarti(2),

(1) Universitas Ibnu Sina, Tiban Lama Kepuluan Riau, Indonesia
(2) Universitas Ibnu Sina, Batu Aji Kepuluan Riau, Indonesia
(*) Corresponding Author

Abstract


General and Test is a branch of knowledge that is included in the field of artificial intelligence. Success in using the system is the basic goal of artificial intelligence itself. General and test works in solving problems and finding the best solution which is used as a reference in determining the path to find the smallest value so that you can quickly go to the place to be visited and can save time and money while traveling to the location. General and test has the concept of looking for the smallest alternative path by how to find all the path values to be visited, after being processed as a whole for each path, alternative starling values will be obtained which can be used as directions. The way the General and test method works is to combine Depth First Search with a backracking system. All solutions must be discussed in full prior to testing. The procedure for working with this method must be carried out systematically in order to get a good solution. General and test has a working principle (1). Generate possible solutions (2). Test whether the solution is correct according to the required criteria. (3). If a solution has been found then exit, but if it has not been found then the next step is to repeat the steps until you find the highest result that can be used as a reference in finding the path with the least or shortest distance. The problem in this study is the lack of information in passing the smallest path because there are many paths that must be chosen to get to the destination. The benefit of this research is to help the user in providing information on the path to be passed so as to save time and costs. Alternative results are obtained that can be used as a solution, namely the A-B-G-J-M-T line = 23+15+5+11=54 KM. This discussion can be used as a reference by traders in finding the shortest alternative so as to save travel costs and time

Full Text:

PDF

References


M. Sobron dan Lubis, “Implementasi Artificial Intelligence Pada System Manufaktur Terpadu,” Seminar Nasional Teknik (SEMNASTEK) UISU, vol. 4, no. 1, hal. 1–7, 2021.

E. Gauss-jordan, K. Karim, dan A. P. Linear, “Penerapan Algoritma Breadth First Search pada,” vol. 12, hal. 171–182, 2016.

S. Lailiyah, A. Yusnita, dan T. A. Panotogomo, “Penerapan Algoritma Depth First Search Pada Sistem Pencarian Dokumen,” Snitt, hal. 174–179, 2017.

I. Fauzan, “Artificial Intelligence (Ai) Pada Proses Pengawasan Dan Pengendalian Kepegawaian – Sebuah Eksplorasi Konsep Setelah Masa Pandemi Berakhir,” Civil Service, vol. 14, no. 1, hal. 31–42, 2020.

N. Juliasari dan J. C. Sitompul, “Aplikasi Search Engine Dengan Metode Depth First Search (DFS),” Jurnal Teknik Informatika Universitas Budi Luhur. ISSN : 1693 -9166, vol. 9, no. 1, hal. 9–12, 2012.

A. Rismayani, “Aplikasi Berbasis Mobile untuk Pencarian Rute Angkutan Umum Kota Makassar Menggunakan Algoritma Depth First Search,” vol. 18, no. 3, hal. 171–180, 2015.

M. Febri Mayang Sari dan D. Permata Sari, “Artificial Intelegence Perbandingan Algoritma Simple Hill Climbing Dan Steepest Ascent Hill Climbing Dalam Media Pembelajaran Alfabert,” Jurnal Sains Komputer & Informatika (J-SAKTI, vol. 6, no. September, hal. 1256, 2022.

B. Prasetiyo dan M. R. Hidayah, “Penggunaan Metode Depth First Search (DFS) dan Breadth First Search (BFS) pada Strategi Game Kamen Rider Decade Versi 0.3,” vol. 1, no. 2, hal. 161–167, 2014.

A. Y. Prasetyo, “Penerapan Algoritma Depth First Search (DFS) Pada Aplikasi Game Traffic Plaze,” Jurnal Informatika, vol. 8, no. 1, hal. 33–41, 2021.

K. Kristina, K. Kartono, dan U. Wardana, “Penerapan Metode Depth First Search Pada Perancangan Sistem Pencarian Lokasi Bimbingan Belajar,” Inteksis, vol. 9, no. 1, hal. 1–10, 2022.




DOI: https://doi.org/10.30645/brahmana.v4i2.190

DOI (PDF): https://doi.org/10.30645/brahmana.v4i2.190.g189

Refbacks

  • There are currently no refbacks.


Published Papers Indexed/Abstracted By: