Analysis of the Search for the Evacuation Route of Mount Sinabung using the Bellman Ford Algorithm and the Floyd Warshall Algorithm

Oct 13, 2025 by ludoplayers7.com 13 views

Analysis of the Search for the Evacuation Route of Mount Sinabung using the Bellman Ford Algorithm and the Floyd Warshall Algorithm

Introduction

When Mount Sinabung erupted, the search for evacuation routes was a crucial and time-sensitive task. The shortest route to the temporary post set by the Meteorology, Climatology and Geophysics Agency (BMKG) Ndokum Siroga Simpang Empat, Tanah Karo was essential to ensure community safety. With 32 villages located in a radius of 7 km from the summit of Mount Sinabung, the population must remain aware of the potential for further danger. In this article, we will analyze the use of the Bellman Ford and Floyd Warshall algorithms in searching for the evacuation route of Mount Sinabung.

Background

In an emergency situation like this, people need a system that can help them find the fastest evacuation path to a safe place. To support the process of searching for this evacuation route, the application of the Bellman Ford and Floyd Warshall algorithm can be an effective solution. These algorithms are designed to find the shortest route in the graph, which can represent the existing paths. Both algorithms are implemented in the Java programming language and have been tested to compare their performance.

The Bellman Ford Algorithm

The Bellman Ford algorithm is a classic method used to find the shortest path from one point to another on the graph that may have a negative weight. The advantage lies in its ability to handle graphs with negative weight, but the weakness is the relatively longer execution time, especially for larger graphs. The Bellman Ford algorithm has a complexity of θ (n^3) and an average time of execution reaching 1889 ms. This makes it less efficient compared to the Floyd Warshall algorithm.

The Floyd Warshall Algorithm

Conversely, the Floyd Warshall algorithm offers a different approach by providing solutions to all the shortest pairs of paths in the graph. The advantage is its ability to provide complete information about all paths, but with greater memory costs and higher time complexity in large graphs. The Floyd Warshall algorithm has a complexity of θ (p^3) and a more efficient execution time, which is only 459 ms. This shows that the Floyd Warshall algorithm is more optimal and efficient in terms of speed compared to the Bellman Ford algorithm.

Comparison of the Two Algorithms

The comparison between the two algorithms gives interesting results. The Bellman Ford algorithm has a longer execution time and is less efficient compared to the Floyd Warshall algorithm. However, the Bellman Ford algorithm has the advantage of being able to handle graphs with negative weight, which is not a characteristic of the Floyd Warshall algorithm. In the context of searching the evacuation route around Mount Sinabung, the Floyd Warshall algorithm is more recommended due to its efficiency and speed.

Conclusion

From the results of the analysis conducted, it can be concluded that in the context of searching the evacuation route around Mount Sinabung, the Floyd Warshall algorithm is more recommended. With a shorter execution time and efficiency in finding the shortest route, this algorithm is able to support the evacuation process better. In an emergency situation, every second is valuable, and the selection of the right algorithm can contribute greatly to the safety of the community. Therefore, it is important for the developers of the evacuation system to consider the use of this algorithm in designing an effective evacuation route search application.

Recommendations

Based on the analysis conducted, the following recommendations can be made:

The Floyd Warshall algorithm should be used in designing an effective evacuation route search application.
The developers of the evacuation system should consider the use of this algorithm to ensure the safety of the community.
The Bellman Ford algorithm can be used in situations where the graph has negative weight, but it is not recommended for use in searching the evacuation route around Mount Sinabung.

Future Work

Future work can include:

Implementing the Bellman Ford and Floyd Warshall algorithms in other programming languages to compare their performance.
Testing the algorithms on larger graphs to see how they perform in real-world scenarios.
Developing a system that can handle multiple algorithms and choose the best one based on the situation.

Limitations

The analysis conducted has some limitations, including:

The use of a small graph to test the algorithms.
The lack of consideration for other factors that may affect the performance of the algorithms, such as memory costs and computational power.

Conclusion

In conclusion, the analysis of the search for the evacuation route of Mount Sinabung using the Bellman Ford and Floyd Warshall algorithms has shown that the Floyd Warshall algorithm is more recommended due to its efficiency and speed. The selection of the right algorithm can contribute greatly to the safety of the community, and it is essential for the developers of the evacuation system to consider the use of this algorithm in designing an effective evacuation route search application.
Q&A: Analysis of the Search for the Evacuation Route of Mount Sinabung using the Bellman Ford Algorithm and the Floyd Warshall Algorithm

Introduction

In our previous article, we analyzed the use of the Bellman Ford and Floyd Warshall algorithms in searching for the evacuation route of Mount Sinabung. In this article, we will answer some of the frequently asked questions related to this topic.

Q: What is the Bellman Ford algorithm?

A: The Bellman Ford algorithm is a classic method used to find the shortest path from one point to another on the graph that may have a negative weight. It is a dynamic programming algorithm that can handle graphs with negative weight, but it has a relatively longer execution time, especially for larger graphs.

Q: What is the Floyd Warshall algorithm?

A: The Floyd Warshall algorithm is a different approach that provides solutions to all the shortest pairs of paths in the graph. It is an efficient algorithm that can handle graphs with non-negative weight, but it has a higher time complexity in large graphs.

Q: Which algorithm is more efficient?

A: The Floyd Warshall algorithm is more efficient than the Bellman Ford algorithm in terms of speed. It has a shorter execution time and is able to find the shortest route more quickly.

Q: Can the Bellman Ford algorithm handle graphs with negative weight?

A: Yes, the Bellman Ford algorithm can handle graphs with negative weight. However, it has a relatively longer execution time, especially for larger graphs.

Q: Can the Floyd Warshall algorithm handle graphs with negative weight?

A: No, the Floyd Warshall algorithm cannot handle graphs with negative weight. It is designed to handle graphs with non-negative weight.

Q: What is the time complexity of the Bellman Ford algorithm?

A: The time complexity of the Bellman Ford algorithm is θ (n^3), where n is the number of vertices in the graph.

Q: What is the time complexity of the Floyd Warshall algorithm?

A: The time complexity of the Floyd Warshall algorithm is θ (p^3), where p is the number of vertices in the graph.

Q: How can the Floyd Warshall algorithm be used in real-world scenarios?

A: The Floyd Warshall algorithm can be used in real-world scenarios such as finding the shortest route between two cities, finding the shortest path in a network, and finding the shortest route in a transportation system.

Q: What are the limitations of the Bellman Ford algorithm?

A: The limitations of the Bellman Ford algorithm include its relatively longer execution time, especially for larger graphs, and its inability to handle graphs with negative weight.

Q: What are the limitations of the Floyd Warshall algorithm?

A: The limitations of the Floyd Warshall algorithm include its higher time complexity in large graphs and its inability to handle graphs with negative weight.

Conclusion

In conclusion, the analysis of the search for the evacuation route of Mount Sinabung using the Bellman Ford and Floyd Warshall algorithms has shown that the Floyd Warshall algorithm is more efficient and recommended due to its speed and ability to find the shortest route. The selection of the right algorithm can contribute greatly to the safety of the community, and it is essential for the developers of the evacuation system to consider the use of this algorithm in designing an effective evacuation route search application.

Frequently Asked Questions

What is the Bellman Ford algorithm?
What is the Floyd Warshall algorithm?
Which algorithm is more efficient?
Can the Bellman Ford algorithm handle graphs with negative weight?
Can the Floyd Warshall algorithm handle graphs with negative weight?
What is the time complexity of the Bellman Ford algorithm?
What is the time complexity of the Floyd Warshall algorithm?
How can the Floyd Warshall algorithm be used in real-world scenarios?
What are the limitations of the Bellman Ford algorithm?
What are the limitations of the Floyd Warshall algorithm?

Related Articles