Optimasi Metode Travelling Salesman Problem (TSP) Dalam Menyelesaikan Kasus Rute Terpendek Pengiriman Barang

Authors

  • Padma Mike Putri M AMIK KOSGORO

DOI:

https://doi.org/10.54367/means.v8i1.2637

Keywords:

Optimization, Method of Traveling Salesman Problem (TSP), grade, Shortest route, Delivery of Goods

Abstract

The process of searching and tracking is very important in determining the success of the basic concepts of artificial intelligence. One science that is able to solve the shortest route concept is the Traveling Salesman Problem (TSP) Algorithm. The work form of this algorithm is in the form of determining the shortest route with the work process calculating all paths passed using predetermined concepts and rules. The form of the Traveling Salesman Problem (TSP) is in the form of a minimum weight on a connected graph, with the basic concept of visiting several cities and returning to the original city so that each city is visited exactly once with the shortest possible total distance traveled. The problem of this research is the lack of understanding Salesman in understanding algorithms that are able to provide instructions for the shortest path so that it is easy to find solutions in the form of information that can be used as a reference in saving time and costs on the way. The main objectives of this research are (1) to determine the route of delivery of goods, (2) to solve the Traveling Salesman Problem (TSP) algorithm, (3) to save time and money while traveling. The final results of this study found 24 paths that could be passed by salesmen. Each route has a different value. The value of the shortest route that can be used as a reference is the JLMK/KMLJ line. JLMK route value = 60 +40+40=160 and KMLJ route = =40 +40+60=140. The value of the shortest route found is a route point of 140.

References

Made, P., Raditya, R., & Dewi, C. (2018). Optimasi Multiple Travelling Salesman Problem ( M-TSP ) Pada Penentuan Rute Optimal Penjemputan Penumpang Travel Menggunakan Algoritme Genetika. Jurnal Pengembangan Teknologi Informasi Dan Ilmu Komputer, 2(10), 3560–3568. http://j-ptiik.ub.ac.id.

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. https://doi.org/10.24014/sitekin.v16i1.6109.

Saleh, K., Helmi, & Prihandono, B. (2015). Penentuan Rute Terpendek Dengan Menggunakan Algoritma Cheapest Insertion Heuristic (Studi Kasus: PT. Wicaksana Overseas International Tbk. Cabang Pontianak). Buletin Ilmiah Math. Stat. Dan Terapannya (Bimaster), 04(3), 295–304.

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. https://journal.unnes.ac.id/sju/index.php/ujm/article/view/14620.

Welianto, S., Santosa, R. G., & Chrismanto, A. R. (2012). Implementasi Algoritma Generate and Test Pada Pencarian Rute Terpendek. Jurnal Informatika, 7(2). https://doi.org/10.21460/inf.2011.72.103

Candrawati, L. G. A., & Kadyanan, I. G. A. G. A. (2017). Optimasi Traveling Salesman Problem (TSP) Untuk Rute Paket Wisata Di Bali dengan Algoritma Genetika. Jurnal Ilmiah Komputer, 10(1), 27–32.

Rahmadi, R. (2010). Implementasi Metode Generate and Test Dalam Menyelesaikan Travelling Salesman Problem Menggunakan Robot Bersensor. Seminar Nasional (SNATI), 2010(Snati), 29–34.

Naufal Hays, R. (2017). Implementasi Firefly Algorithm - Tabu Search Untuk Penyelesaian Traveling Salesman Problem. Jurnal Online Informatika, 2(1), 42–48. http://join.if.uinsgd.ac.id/index.php/join/article/view/v2i18/51

Gautama, I. P. W., & Hermanto, K. (2020). Penentuan Rute Terpendek dengan Menggunakan Algoritma Dijkstra pada Jalur Bus Sekolah. Jurnal Matematika, 10(2), 116. https://doi.org/10.24843/jmat.2020.v10.i02.p128.

Udjulawa, D., & Oktarina, S. (2022). Penerapan Algoritma Ant Colony Optimization Untuk Pencarian Rute Terpendek Lokasi Wisata. Klik - Jurnal Ilmu Komputer, 3(1), 26–33. https://doi.org/10.56869/klik.v3i1.326.

Made, P., Raditya, R., & Dewi, C. (2018). Optimasi Multiple Travelling Salesman Problem ( M-TSP ) Pada Penentuan Rute Optimal Penjemputan Penumpang Travel Menggunakan Algoritme Genetika. Jurnal Pengembangan Teknologi Informasi Dan Ilmu Komputer, 2(10), 3560–3568. http://j-ptiik.ub.ac.id

Bangun, P. B. J., Octarina, S., & Purba, B. V. (2015). Penyelesaian Travelling selesman problem(TSP) dengan metode Branch and Bound. Jurnal Matematika Fakultas MIPA, 399–408.

Downloads

Published

2023-05-26

How to Cite

M, P. M. P. . (2023). Optimasi Metode Travelling Salesman Problem (TSP) Dalam Menyelesaikan Kasus Rute Terpendek Pengiriman Barang. MEANS (Media Informasi Analisa Dan Sistem), 8(1), 34–39. https://doi.org/10.54367/means.v8i1.2637

Issue

Volume 8 Nomor 1

Section

Daftar Artikel

License

Copyright (c) 2023 Padma Mike Putri M

Creative Commons License

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

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.