AIS Based Shipping Routes Using the Dijkstra Algorithm

Abstract

This paper proposes an approach for identifying and characterizing shipping routes using information contained in Automatic Identification System messages broadcasted by ships and recorded by the coastal Vessel Traffic Service centre. The approach consists of using historical Automatic Identification System data to build a graph, where nodes are cells of a grid covering the geographical area being studied and the weights of directional edges are inversely related to ship movements between cells. Based on this graph, the Dijkstra algorithm is used to identify a potential safe route, assumed to be the most used route by ships between two locations. A second graph is created simultaneously, with the same nodes and edges, but with edge weights equal to the average speed of transitions between cells, thus allowing the determination of the average speed profile for any possible path within the graph. The proposed approach is applied to two scenarios: an approach to the port of Lisbon and the entry through the fairway to a RO-RO terminal in the port of Setubal in Portugal. http://www.transnav.eu the International Journal on Marine Navigation and Safety of Sea Transportation Volume 13 Number 3

Generation of Ship’s Passage Plan Using Data-Driven Shortest Path Algorithms

“…Herein, AIS data were used differently from previous studies to generate ships' passage plans. In the study conducted by Silveira et al [3], the Dijkstra algorithm was applied using AIS data to extract a ship's route; however, it differed from this study, which generated a ship's passage plan from the departure point to the destination. Generating a ship's passage plan using AIS data has the following advantages.…”

“…At present, the passage planning of ships is conducted based on the navigational knowledge and experience of the navigation officers [3]. However, owing to the advent of maritime autonomous surface ships (MASSs), research on the automation of passage planning has been attracting considerable attention from both academia and industry [4,5].…”

“…For example, the distance, time, fuel consumption, and depth of water to a specific destination must be considered, and prescribed routes based on traffic separation schemes (TSS) must be followed and planned by referring to nautical publications [7]. Therefore, if a passage plan is established by referring to a ship trajectory where the ship has safely sailed, the overall navigation safety level and efficiency of passage planning can be increased by reducing uncertainty and risk [3]. Ship trajectories can be identified and analyzed through the automatic identification system (AIS) data installed on ships [8,9].…”

A Techno-Economic Analysis of a Cargo Ship Using Flettner Rotors

“…Once the best ship speed has been found for each element of the vectors of the route matrix, a Dijkstra's algorithm [31] is applied to evaluate the best succession of the single steps analysed, with the aim to bring the ship from the departure to the arrival point chosen. A similar approach has been used by P. Silveira et al in their work [32] to identify a potential safe route for ships, by using the information contained in the messages broadcasted by ships and recorded by the coastal traffic service centres.…”

Maritime Transport Network in Korea: Spatial-Temporal Density and Path Planning

“…For ships to navigate from the departure point to the destination, considering factors such as the economically shortest route, safe water depth, and compliance with designated routes is necessary. Dijkstra was the first to devise a method for generating the shortest route based on graph theory, and Silveira et al and Wang et al constructed the shortest route that ships can use using Dijkstra's algorithm [37][38][39]. In this study, Dijkstra's algorithm was used to calculate the shortest route, and the safety depth data were set as line obstacles in the network.…”