Finding and Comparing Shortest Path Solutions by Using Various Methods on a Detailed Network of the Aegean Sea

Abstract

Shortest path algorithms are frequently used in important sectoral areas such as maritime, aeronautical and land transport, and are still highly popular. The different side of our work is that it is on the ports of Greece and Turkey on the Aegean Sea and that the nodes are prepared on the actual map based on the actual coordinates and depths. Our study differs from previous studies in that it focuses on Greek and Turkish ports on the Aegean Sea and the nodes are prepared on an actual map based on actual coordinates and depths. The study is part of an intelligent system capable of actually planning the route of a sailing vessel. It is designed to evaluate the methods that an intelligent system can use. The intelligent system will be a system that can dynamically change and optimize the route depending on changing conditions such as weather, current and navigational information. This is the reason why the node map is obtained using real and detailed information. The Breadth-First, Bellman-Ford and Dijkstra’s algorithms were used to calculate the shortest routes between ports and the results were evaluated in terms of the route, distance and calculation time used.