Determination of the shortest path in the university campus of Serres: Using the Dijkstra and Bellman‐Ford algorithms
Citations Over Time
Abstract
This research paper presents the application of theDijkstra and Bellman‐Ford algorithms at the premises of thecampus of the International Hellenic University in Serres, for theapproximation of the shortest routes from selected locations todifferent buildings. The facilities of the educational institutionwere depicted in the form of a graph, whose nodes are theselected locations and buildings, while the edges are the pathswith their weights representing their lengths. Making decisionsto create optimal routes and designing maps with the proposedroutes is a complex problem that can be solved by applying ashorter path algorithm. In conclusion, the specific application ofthe Dijkstra and Bellman‐Ford algorithms has proven to beeffective in approaching optimal ‐ shortest routes and can besuccessfully implemented to even more sophisticated routes.Finally, the application of two different algorithms approachingthe same problem enables the validity of their results.
Related Papers
- A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application(2014)
- → Analysis of algorithms for shortest path problem in parallel(2016)7 cited
- → The Research and Improvement of Path Optimization in Vehicle Navigation(2011)2 cited
- Efficient Implementation of Dijkstra Algorithm in GIS(2005)
- Study of Informed Searching Algorithm for Finding the Shortest Path(2019)