Open AccessModifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan
Author(s) -
Yaddarabullah Yaddarabullah
Publication year - 2019
Publication title -
jurnal teknologi dan sistem komputer
Language(s) - English
Resource type - Journals
eISSN - 2620-4002
pISSN - 2338-0403
DOI - 10.14710/jtsiskom.7.3.2019.109-115
Subject(s) - shortest path problem , mathematics , mathematical optimization , preference , travel time , graph , ideal solution , transport engineering , engineering , statistics , combinatorics , physics , thermodynamics
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.