Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan)

Authors

  • Ester Tetri H Hutasoit STMIK Budi Darma

DOI:

https://doi.org/10.30865/json.v1i1.1367

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.

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.

Downloads

Published

2019-08-21

How to Cite

Hutasoit, E. T. H. (2019). Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan). Jurnal Sistem Komputer Dan Informatika (JSON), 1(1), 20–25. https://doi.org/10.30865/json.v1i1.1367

Issue

Vol. 1 No. 1 (2019): September 2019

Section

Articles

License

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

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).