Finding and Comparing Shortest Path Solutions by Using Various Methods on a Detailed Network of the Aegean Sea
Article Sidebar
Main Article Content
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. 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.
Keywords: Shortest path, Dijkstra, Bellman-Ford, breadth-first, aegean sea, decision support systems
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Global Journal of Computer Sciences: Theory and Research is an Open Access Journal. All articles can be downloaded free of charge. Articles published in the Journal are Open-Access articles distributed under CC-BY license [Attribution 4.0 International (CC BY 4.0)]
Birlesik Dunya Yenilik Arastirma ve Yayincilik Merkezi (BD-Center) is a gold open access publisher. At the point of publication, all articles from our portfolio of journals are immediately and permanently accessible online free of charge. BD-Center articles are published under the CC-BY license [Attribution 4.0 International (CC BY 4.0)], which permits unrestricted use, distribution, and reproduction in any medium, provided the original authors and the source are credited.