Expert System Troubleshooting Shortest Route Finding Using Traveling Salesman Problem (TSP)

Rika Widya Perdana(1*),

(*) Corresponding Author


The search for the shortest route is a path that is very functional in helping human activities. The Traveling Salesman Problem (TSP) is a method of finding the shortest route that a salesman can take when they want to visit several cities without having to visit the same city more than once. The case of Route Selection plays an important role because it must be on time and choose the alternative with the smallest value to the destination. Problems that occur in the form of lack of information and logic to obtain efficient information. The aim of this research is to minimize the distance. The search for a solution to the problem is to combine each distance taken to get to a place so that the Salesman can choose the Smallest alternative. The alternative mileage that has the smallest value is STRU, USTR, and URTS with an alternative value of 18.

Full Text:



Pratama, R. R., Rerung, R. R., Erfina, A., Informatika, T., Nusa, U., Informasi, S., & Nusa, U.(2020). Penyelesaian Travelling Salesman Problem. 2(1).

Gutin, G. (2013). Traveling Salesman Problems. 11(1), 336–359.

Supriana, I. W. (2018). Pencarian Rute Terbaik Untuk Distribusi Bank Sampah Menggunakan Travelling Salesman Problem (Tsp) Studi Kasus Kota Denpasar. Jurnal Teknologi Informasi dan Komputer, 3(2).

Yumalia, A. (2017). Minimasi Biaya Distribusi Dengan Menggunakan Metode Traveling Salesman Problem ( TSP ). Jurnal UMJ, November 2017, 1–8.

Maulana, A. (2021). Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek. 3, 128–133.

Auliasari, K., Kertaningtyas, M., & Basuki, D. W. L. (2018). Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem. Jurnal Sains, Teknologi dan Industri, 16(1), 15.

Amozhita, K. K., Suyitno, A., & 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.

Welianto, S., Santosa, R. G., & Chrismanto, A. R. (2012). Implementasi Algoritma Generate and Test Pada Pencarian Rute Terpendek. Jurnal Informatika, 7(2).

Rahayu, S., Kusumah, A. B., Supriyadi, S., & Widyarto, W. O. (2019). Optimization of Total Production of Refined Sugar From Raw Sugar Raw Materials and Supporting Raw Materials Using the Generate-And-Test Method at PT. DSI Banten. Journal of Machine Learning and Soft Computing, 1(2), 29.

Maulana Algifar, i (2021). Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek. Jurnal System Komputer Dan Informatika (JSON) 128-133.



  • There are currently no refbacks.

Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: