SWS Academic Research eLibraryEarth & Planetary Sciences

Scholarly record

SHIP ROUTING IN THE BLACK SEA BASED ON DIJKSTRA ALGORITHM

Valerian Novac, Eugen Rusu, Carmen Gasparotti, Gheorghe Stăvărache

First published: 2020-09-20https://doi.org/10.5593/sgem2020/2.1/s07.039View metrics

Abstract

In the precursory section of the paper, the authors succinctly present the Black Sea basin's oceanographic features with a focus on factors that can lead to naval accidents. The Black Sea basin is characterized, especially in winter months, by sudden storms, big waves, and winds, seriously affecting the ships and crews' safety. The said basin has also confined areas with pleasure crafts and commercial ships, offshore platforms with accompanying auxiliary fleet and underwater pipes and installations or shallow waters, and wrecks all of them favoring naval accidents. The naval accidents can lead to the dramatic loss of human lives, damage or loss of property and negatively impact on the marine environment. In the paper, we establish a model based on realistic wind and wave conditions present in the Black Sea and analyze the output given by an adapted Dijkstra algorithm. The authors set a study area, from the whole Black Sea basin, chose a specific region, split it into squares, and the algorithm found the potential waypoints of the recommended path as the vertexes of the established squares. Finding the optimal route between two ports being the most efficient from an economic point of view, reduced emissions, and the safety of the crew and the ship is the main objective of the paper. Usually, the routing algorithms apply longer routes considerably. The proposed algorithm was meant to assist shipmasters' and owners' decisions and minimize fuel consumption by choosing the shortest and safest path related to shipping and sea conditions.

Publication Impact Profile

PlumX
  • Citations
  • CrossRef - Citation Indexes: 1
  • Scopus - Citation Indexes: 5
  • Captures
  • Mendeley - Readers: 10
PLUMX see details

Publication details

Title
SHIP ROUTING IN THE BLACK SEA BASED ON DIJKSTRA ALGORITHM
Authors
Valerian Novac, Eugen Rusu, Carmen Gasparotti, Gheorghe Stăvărache
Proceedings
SGEM International Multidisciplinary Scientific GeoConference EXPO Proceedings; 20th International Multidisciplinary Scientific GeoConference Proceedings SGEM 2020, Informatics, Geoinformatics and Remote Sensing
Publisher
STEF92 Technology
Year
2020
Pages
301-308
SWS Citekey
NOVAC20207301308
ISSN
1314-2704
ISBN
978-619-7603-06-4
Language
en
Publication type
Conference Paper
Keywords
Black Searouting algorithmweatheraccidentDijkstra.
References15

  1. Novac V., Rusu E., St?v?rache G, Black Sea naval accidents – intervention management, Mechanical Testing and Diagnosis, Volume 2, pp. 11-14, 2019;

  2. R. Schlitzer, Ocean Data View, 2016, http://odv.awi.de, accessed on 29.04.2020 12.00;

  3. www.marine.copernicus.eu, accessed on 28.04.2020 11.00;

  4. Delitala A. M. S., Gallino S., Villa L., Lagouvardos K., Drago A., Weather routing in long-distance Mediterranean routes, Theoretical and Applied Climatology, Vol. 102, pp. 125-137, 2010;

  5. Rusu L., A projection of the expected wave power in the Black Sea until the end of the 21st century, Proceedings of the 14th Conference on Sustainable Development of Energy, Water and Environment Systems (SDEWES2019), pp. 1-12, 2019;

  6. Bijlsma S. J., A Computational Method in Ship Routing Using the Concept of Limited Manoeuvrability, The Journal Of Navigation, Vol. 57, pp. 357 – 369, 2004;

  7. Zhang W., Jiang C., Optimization Studies on an Improved Dijkstra Algorithm. Proceedings of the 2011, 3rd International Conference on Information Technology and Scientific Management (ICITSM 2011), 2011;

  8. Idwan S., Etaiwi W., Dijkstra Algorithm Heuristic Approach for Large Graph, Journal of Applied Sciences, Vol. 11, pp. 2255-2259, 2011;

  9. Zhu X., Wang H., Shen Z., Lv H., Ship weather routing based on modified Dijkstra algorithm, 6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer (MMEBC 2016), pp. 696 – 699, 2016;

  10. Zheng S.F., Cao J.D., Lian X.M., Sector Dijkstra Algorithm for Shortest Routes between Customers in Complex road networks. J Tsinghua Univ (Sci & Tech), Vol. 49, No. 11, 2009;

  11. Tsou M.C., Cheng H.C., An Ant Colony Algorithm for Efficient Ship Routing, Polish Maritime Researsh, Vol. 20, pp. 28-38, 2013;

  12. Dijkstra E.W., A note on two problems in connexion with graphs. Numerische Mathematik 1, pp. 269–271, 1959;

  13. Zhang X., Wang Q., Adamatzky A., T. S. Chan F., Mahadevan S., Deng Y., An Improved Physarum polycephalum Algorithm for the Shortest Path Problem, The Scientific World Journal, Vol. 2014, Article ID 487069, p. 9, 2014;

  14. Deng Y., Chen Y., Zhang Y., Mahadevan S., Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment, Applied Soft Computing, vol. 12, no. 3, pp. 1231–1237, 2012;

  15. An approach for efficient ship routing, International Transactions in Operational Research, Vol. 20, pp. 767–794, 2013.

Citing literature

Number of times cited according to Crossref: 3

Open DOICrossref metadataOpenCitations
View or Download full articleAccess options
Full paper accessChoose SWS login, librarian support, or instant article download.

SWS access login

Login as SWS Scientific Committee

Authors and approved SWS contributors will read and export their own linked papers after identity matching by SWS profile, email and SGEM GlobalID.

For librarian assistance: [email protected]

Purchase Instant Access

48-hour online accessComing soon
Online-only accessComing soon
Download the full article in PDF formatEUR 35
  • Article can be downloaded after successful payment.
  • Article may be used according to SWS library access terms.
  • Article cannot be redistributed.
Get full paper

Back to publication list