Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan)
Abstract
Every human being wants to get to his destination on time. But often congestion causes human desires are blocked. Therefore, we need a way to overcome this problem by knowing the minimum distance to reach a place. The service sector is a field that offers services by helping consumers in various ways. The service sector is a field that will never experience bankruptcy even in difficult conditions because everyone certainly needs the help of others in completing or completing various things. Freight forwarding services are one of the services most widely used, especially in saving time and costs (cost). In the freight forwarding service, the route of shipping the goods becomes very important because without a structured route, the delivery of goods becomes not timely and can be detrimental to the company itself. The loss that will be experienced by the company is that the delivery time will be longer because the delivery distance will be further. In this study the calculation of the application using the Bellman-Ford algorithm is performed which aims to find the shortest path from the office of PT. JNE Medan to Helvetia. The algorithm used is Bellman-Ford. The Belmman-Ford algorithm is used to calculate all paths from origin to destination formed in a graph to find the shortest path.
Full Text:
PDFArticle Metrics
Abstract view : 1552 timesPDF - 6069 times
References
H. Sunandar, “STUDI TENTANG PENYELAMATAN TRAVELING SALESMAN DENGAN MENGGUNAKAN METODE REDUKSI PADA TEORI GRAF ( Studi Kasus : Perusahaan Kimia Farma ),” no. September, pp. 21–24, 2014.
R. Munir, MATEMATIKA DISKRIT, Ketiga. 2010.
R. Munir, MATEMATIKA DISKRIT, Kelima. BANDUNG, 2012.
M. Santika, S. Hansun, and J. First, “Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang,” vol. VI, no. 2, pp. 94–99, 2014.
T. Dengan, A. Semut, and D. A. N. Algoritma, “Pemanfaatan Metode Heuristik dalam Pencarian Jalur Terpendek dengan Algoritma Semut dan Algoritma Genetika,” no. January 2017, 2007.
Jogiyanto, Analisis & Desain Sistem Informasi. Yogyakarta: ANDI, 2005.
R. H. S., Visual Basic 2008 for Pemula Banget. Jakarta: PT.Elex Media Komputindo, 2009.
Refbacks
- There are currently no refbacks.
Copyright (c) 2019 Jurnal Sistem Komputer dan Informatika (JSON)
Jurnal Sistem Komputer dan Informatika (JSON)
Dikelola oleh STMIK Budi Darma
Sekretariat : Jln. Sisingamangaraja No. 338 Telp 061-7875998
email : jurnal.json@gmail.com
This work is licensed under a Creative Commons Attribution 4.0 International License.