Modifikasi Algoritma Bellman-Ford Untuk Pencarian Rute Terpendek Berbasis Kondisi Jalan

Modified Bellman-Ford Algorithm for Finding the Shortest Path Based on Road Conditions

*Yaddarabullah Yaddarabullah -  Department of Informatics, Universitas Trilogi, Indonesia
Received: 8 Jan 2019; Revised: 16 Jun 2019; Accepted: 23 Jul 2019; Published: 31 Jul 2019; Available online: 4 Aug 2019.
Open Access Copyright (c) 2019 Jurnal Teknologi dan Sistem Komputer
Citation Format:
Article Info
Section: Articles
Language: ID
Statistics: 199
Abstract
Bellman-ford algorithm was used to find the shortest path both weighted and unweighted graph. This algorithm had some weakness in determining the shortest path based on road conditions such as traffic density, distance, and travel time. The algorithms also cannot find an alternative path. This study modified the Bellman-Ford algorithm using the Technique for Order of Preference by Similarity to the Ideal Solution method for providing assessments based on road condition criteria used to make decisions when determining the alternative path chosen. The modified Bellman-Ford performs better in finding the shortest path, that is lower by 1% than the unmodified bellman-ford and the street density level can be used as a criterion in optimizing the shortest path search.
Keywords
modified Bellman-Ford algorithm; shortest path finding; TOPSIS

Article Metrics:

  1. M. A. M. AgustianAji P, SholehHadi Pramono and ?, “Optimasi Jalur Tercepat dengan Menggunakan Modifikasi Algoritma Bellman Ford,” J. EECIS, vol. 9, no. 2, pp. 168–172, 2015.
  2. A. Dan, I. Algoritma, and B. Ford, “Analisa dan implementasi algoritma bellman ford dalam mnentukan jalur terpendek pengantaran barang dalam kota,” J. Mantik Penusa, vol. 18, no. 2, pp. 118–123, 2015.
  3. M. Rofiq and R. Fathul Uzzy, “Penentuan Jalur Terpendek Menuju Cafe Di Kota Malang Menggunakan Metode Bellman-Ford Dengan Location Based Service Berbasis Android,” J. Ilm. Tek. dan Inf. ASIA, vol. 8, no. 2, pp. 49–64, 2014.
  4. S. Hamdi, “Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran ( Studi Kasus : Kecamatan Praya Kota ),” J. Ilm. Ilmu-Ilmu Tek., vol. 8, no. 1, pp. 26–32, 2018.
  5. J. O. Agung, T. Efendi, and H. Agung, “Analisis Perbandingan Algoritma Floyd-Warshall Dengan Algoritma Bellman-Ford Dalam Pencarian Rute Terpendek Menuju Museum di Jakarta,” J. Sains dan Teknol., vol. 5, no. 1, pp. 1–7, 2018.
  6. A. R. Wibowo and I. Soesanti, “Analisis data time series dan VCR kepadatan lalu lintas ( studi kasus : Jalan Adisucipto depan Ambarukmo Plaza ),” J. Elinvo, vol. 2, no. 2, pp. 131–137, 2015.
  7. S. P. Beasiswa, A. Musthafa, H. Suyono, and M. Sarosa, “Perbandingan Kinerja Algoritma C . 45 dan AHP-TOPSIS Sebagai Pendukung Keputusan Proses Seleksi Penerima Beasiswa,” J. EECCIS, vol. 9, no. 2, pp. 109–114, 2015.
  8. H. Wibisana and N. Utomo, “Pemetaan Kecepatan Dan Kerapatan Lalu Lintas Di Ruas Jalan Arteri Kota Surabaya,” J. Tek. Sipil, vol. 12, no. 2, pp. 99–181, 2016.
  9. E. S. Alhani, Komala Erwan, “Analisa Lalu Lintas Terhadap Kapasitas Jalan Di Pinggiran Kota Pontianak (Kasus Jalan Sungai Raya Dalam),” 2015.
  10. F. Anggraini and S. Mingparwoto, “Penerapan Metode Algoritma Bellman – Ford Dalam Aplikasi Pencarian Lokasi Perseroan Terbatas di PT . Jakarta Industrial Estate Pulogadung ( PT . JIEP ),” J. Teknol., vol. 7, no. 1, pp. 28–34, 2015