Modified Bellman-Ford Algorithm for Finding the Shortest Path Based on Road Conditions
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diponegoro University
2019-07-01
|
| Series: | Jurnal Teknologi dan Sistem Komputer |
| Subjects: | |
| Online Access: | https://jtsiskom.undip.ac.id/index.php/jtsiskom/article/view/13240 |
| Summary: | 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. |
|---|---|
| ISSN: | 2338-0403 |