Syaifullah, Muhammad Bagus (2025) Implementasi Algoritma Dijkstra Untuk Menentukan Rute Terpendek Dalam Pendistribusian Produk. Masters thesis, Institut Teknologi Sepuluh November.
![[thumbnail of 6032201001-Master_Thesis.pdf]](http://repository.its.ac.id/style/images/fileicons/text.png) |
Text
6032201001-Master_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 April 2027. Download (3MB) | Request a copy |
Abstract
Tenun Ikat Parengan merupakan kerajinan yang diproduksi oleh masyarakat Desa Parengan di sentra industri Paradila, Kecamatan Maduran Kabupaten Lamongan. Hasil produksinya kemudian didistribusikan ke beberapa agen yang telah bekerja sama dengan Paradila di daerah Kampung Arab, Surabaya, untuk kemudian diekspor ke daerah Timur Tengah. Dalam proses penentuan rute distribusi seringkali dilakukan secara manual atau mengandalkan pengalaman dari kurir. Sehingga perlu dikaji dalam segi efisiensi dalam pengambilan keputusan rute distribusi yang dilakukan selama ini. Dalam Google Maps memang sudah terdapat fitur untuk pencarian rute terpendek antara satu lokasi dengan lainnya. Namun, data rute terpendek yang dihasilkan perlu di optimasi kembali dengan pertimbangan jarak, waktu dan biaya transportasi agar lebih efisien. Penelitian ini bertujuan untuk mengembangkan aplikasi pencarian rute terpendek berbasis web untuk meningkatkan efisiensi distribusi produk dari Paradila ke Kampung Arab Surabaya. Algoritma Dijkstra diimplementasikan untuk menentukan rute optimal. Hasil penelitian menunjukkan bahwa aplikasi yang dikembangkan menghasilkan rute dengan jarak 73,7 km, waktu tempuh 115 menit, dan biaya transportasi Rp. 62.647. Dibandingkan dengan Google Maps, aplikasi ini memberikan hasil yang lebih baik dalam hal jarak dan biaya, meskipun sedikit kurang optimal dalam waktu tempuh. Aplikasi ini memiliki kelemahan dalam menampilkan kondisi jalan secara real time, sehingga navigasi bersifat statis. Penelitian ini menyimpulkan bahwa implementasi Algoritma Dijkstra efektif dalam optimasi rute distribusi, namun pengembangan lebih lanjut diperlukan untuk mengatasi keterbatasan navigasi real time.= Tenun Ikat Parengan is a craft produced by the people of Parengan Village in the Paradila industrial center, Maduran District, Lamongan Regency. The production results are then distributed to several agents who have collaborated with Paradila in the Kampung Arab area, Surabaya, to be subsequently exported to the Middle East. In the process of determining distribution routes, it is often done manually or relies on the experience of the couriers. Therefore, it is necessary to examine the efficiency of the distribution route decision-making that has been carried out so far. In Google Maps, there is indeed a feature for finding the shortest route between one location and another. However, the shortest route data generated needs to be optimized again considering distance, time, and transportation costs to be more efficient. This research aims to develop a web-based shortest route search application to improve the efficiency of product distribution from Paradila to Kampung Arab Surabaya. The Dijkstra algorithm was implemented to determine the optimal route. The research results show that the developed application generates a route with a distance of 73.7 km, a travel time of 115 minutes, and a transportation cost of Rp. 62,647. Compared to Google Maps, this application provides better results in terms of distance and cost, although it is slightly less optimal in travel time. This application has a weakness in displaying real time road conditions, making navigation static. This study concludes that the implementation of Dijkstra's Algorithm is effective in route optimization for distribution, but further development is needed to address the limitations of real time navigation.
===================================================================================================================================
Parengan Ikat Weaving is a craft produced by the people of Parengan Village in the Paradila industrial center, Maduran District, Lamongan Regency. The production results are then distributed to several agents who have collaborated with Paradila in the Kampung Arab area, Surabaya, to then be exported to the Middle East. In the process of determining the distribution route, it is often done manually or relying on the experience of the courier. So it needs to be studied in terms of efficiency in making decisions about the distribution route that has been carried out so far. In Google Maps, there is already a feature for searching for the shortest route between one location and another. However, the shortest route data produced needs to be re-optimized by considering distance, time and transportation costs to be more efficient. This study aims to develop a web-based shortest route search application to improve the efficiency of product distribution from Paradila to Kampung Arab Surabaya. The Dijkstra algorithm is implemented to determine the optimal route. The results of the study showed that the application developed produced a route with a distance of 73.7 km, a travel time of 115 minutes, and a transportation cost of Rp. 62,647. Compared to Google Maps, this application provides better results in terms of distance and cost, although slightly less optimal in travel time. This application has a weakness in displaying road conditions in real time, so that navigation is static. This study concludes that the implementation of the Dijkstra Algorithm is effective in optimizing distribution routes, but further development is needed to overcome the limitations of real-time navigation. = Tenun Ikat Parengan is a craft produced by the people of Parengan Village in the Paradila industrial center, Maduran District, Lamongan Regency. The production results are then distributed to several agents who have collaborated with Paradila in the Kampung Arab area, Surabaya, to be subsequently exported to the Middle East. In the process of determining distribution routes, it is often done manually or relies on the experience of the couriers. Therefore, it is necessary to examine the efficiency of the distribution route decision-making that has been carried out so far. In Google Maps, there is indeed a feature for finding the shortest route between one location and another. However, the shortest route data generated needs to be optimized again considering distance, time, and transportation costs to be more efficient. This research aims to develop a web-based shortest route search application to improve the efficiency of product distribution from Paradila to Kampung Arab Surabaya. The Dijkstra algorithm was implemented to determine the optimal route. The research results show that the developed application generates a route with a distance of 73.7 km, a travel time of 115 minutes, and a transportation cost of Rp. 62,647. Compared to Google Maps, this application provides better results in terms of distance and cost, although it is slightly less optimal in travel time. This application has a weakness in displaying real time road conditions, making navigation static. This study concludes that the implementation of Dijkstra's Algorithm is effective in route optimization for distribution, but further development is needed to address the limitations of real time navigation
| Item Type: | Thesis (Masters) |
|---|---|
| Uncontrolled Keywords: | Tenun Ikat Parengan, Algoritma Dijkstra, Rute Terpendek, Distribusi Produk, Tenun Ikat Parengan, Dijkstra's Algorithm, Shortest Route, Product Distribution |
| Subjects: | T Technology > T Technology (General) > T58.62 Decision support systems |
| Divisions: | Interdisciplinary School of Management and Technology (SIMT) > 61101-Master of Technology Management (MMT) |
| Depositing User: | M Bagus Syaifullah |
| Date Deposited: | 05 Feb 2025 06:54 |
| Last Modified: | 05 Feb 2025 06:54 |
| URI: | http://repository.its.ac.id/id/eprint/118237 |
Actions (login required)
 |
View Item |