Modifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan

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

*Yaddarabullah Yaddarabullah orcid scopus  -  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
Creative Commons License This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Citation Format:
Article Info
Section: Original Research Articles
Language: ID
Statistics: 532 157
Abstract
The application of the Bellman-ford algorithm for finding the shortest path both weighted and unweighted graph has a weakness in determining the shortest path based on road conditions. This study modified the Bellman-Ford algorithm by adding the Technique for Order of Preference by Similarity to the Ideal Solution method to provide alternative road assessments based on its condition criteria including road density, road width, travel time, and distance. This modified Bellman-Ford has better performance in finding the alternative shortest path by choosing a road with smoother conditions, even though distance and travel time increase.
Keywords: modified Bellman-Ford algorithm; shortest path finding; TOPSIS

Article Metrics:

  1. A. Aji, S. H. Pramono, and M. A. Muslim,“ Optimasi Jalur Tercepat dengan Menggunakan Modifikasi Algoritma Bellman Ford,” Jurnal EECCIS, vol. 9, no. 2, pp. 168–172, 2015.
  2. P. M. Hasugian, “Analisa dan Implementasi Algoritma Bellman Ford dalam Menentukan Jalur Terpendek Pengantaran Barang Dalam Kota,” Jurnal Mantik Penusa, vol. 18, no. 2, pp. 118–123, 2015.
  3. M. Rofiq and R. F. Uzzy, “Penentuan Jalur Terpendek Menuju Cafe di Kota Malang Menggunakan Metode Bellman-Ford Dengan Location Based Service Berbasis Android,” Jurnal Ilmiah Teknologi dan Informasi 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),” Energy, 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,” Jurnal Sains dan Teknologi, 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),” Elinvo (Electronics, Informatics, and Vocational Education), vol. 2, no. 2, pp. 131–137, 2015.
  7. A. Musthafa, H. Suyono, and M. Sarosa, “Perbandingan Kinerja Algoritma C.45 dan AHP-TOPSIS Sebagai Pendukung Keputusan Proses Seleksi Penerima Beasiswa,” Jurnal 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,” Jurnal Teknik Sipil Maranatha, 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),” Jurnal Mahasiswa Teknik Sipil Universitas Tanjungpura, vol. 4, no. 4, pp. 1-7, 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),” Jurnal Teknologi, vol. 7, no. 1, pp. 28–34, 2015.

No citation recorded.