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

Yaddarabullah Yaddarabullah

doi:10.14710/jtsiskom.7.3.2019.109-115

DOI: https://doi.org/10.14710/jtsiskom.7.3.2019.109-115

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

Department of Informatics, Universitas Trilogi, Indonesia

Received: 8 Jan 2019; Revised: 16 Jun 2019; Accepted: 23 Jul 2019; Available online: 4 Aug 2019; Published: 31 Jul 2019.

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

Citation Format:

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.

Fulltext View|Download Email colleagues

Keywords: modified Bellman-Ford algorithm; shortest path finding; TOPSIS

Funding: Universitas Trilogi

Article Metrics:

Article Info

Section: Original Research Articles

Language : ID

In Volume 7, Issue 3, Year 2019 (July 2019)

Most viewed articles

Data Mining using Apriori Algorithm for Product Recommendation for Customers Pembuatan Sistem Informasi Rental Mobil dengan Menggunakan Java dan Mysql Sistem Pengendali Peralatan Elektronik dalam Rumah secara Otomatis Menggunakan Sensor PIR, Sensor LM35, dan Sensor LDR Decision Support System for Thesis Graduation Recommendation Using AHP-TOPSIS Method Implementasi Sistem Informasi Geografis Daerah Pariwisata Kota Semarang Berbasis Android dengan Global Positioning System (GPS) More articles

Most cited articles

Decision Support System for Subsidizing the Repair Cost of Containers Damage Using Naive Bayes Speed Bump Enforcement System Based on Vehicle Speed Classified by Haar Cascade Classifier Perancangan dan Pengembangan Permainan “Super Sigi” Menggunakan Stencyl Sebagai Media Pengenalan Menyikat Gigi Comparative study of four indoor empirical propagation models for campus wireless network Perancangan dan Pembuatan Aplikasi Visualisasi 3D Interaktif Masjid Agung Jawa Tengah Menggunakan Unity3D More cited articles

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
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
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
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
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
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
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
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
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
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

Last update:

No citation recorded.

Last update: 2024-11-04 09:44:04

No citation recorded.

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

Starting from 2021, the author(s) whose article is published in the JTSiskom journal attain the copyright for their article and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. By submitting the manuscript to JTSiskom, the author(s) agree with this policy. No special document approval is required.

The author(s) guarantee that:

their article is original, written by the mentioned author(s),
has never been published before,
does not contain statements that violate the law, and
does not violate the rights of others, is subject to copyright held exclusively by the author(s), is free from the rights of third parties, and the necessary written permission to quote from other sources has been obtained by the author(s).

The author(s) retain all rights to the published work, such as (but not limited to) the following rights:

Copyright and other proprietary rights related to the article, such as patents,
The right to use the substance of the article in its own future works, including lectures and books,
The right to reproduce the article for its own purposes,
The right to archive all versions of the article in any repository, and
The right to enter into separate additional contractual arrangements for the non-exclusive distribution of published versions of the article (for example, posting them to institutional repositories or publishing them in a book), acknowledging its initial publication in this journal (Jurnal Teknologi dan Sistem Komputer).

Suppose the article was prepared jointly by more than one author. Each author submitting the manuscript warrants that all co-authors have given their permission to agree to copyright and license notices (agreements) on their behalf and notify co-authors of the terms of this policy. JTSiskom will not be held responsible for anything arising because of the writer's internal dispute. JTSiskom will only communicate with correspondence authors.

Authors should also understand that their articles (and any additional files, including data sets and analysis/computation data) will become publicly available once published. The license of published articles (and additional data) will be governed by a Creative Commons Attribution-ShareAlike 4.0 International License. JTSiskom allows users to copy, distribute, display and perform work under license. Users need to attribute the author(s) and JTSiskom to distribute works in journals and other publication media. Unless otherwise stated, the author(s) is a public entity as soon as the article is published.

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

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

EDITORIAL OFFICE OF JURNAL TEKNOLOGI DAN SISTEM KOMPUTER