Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Dijkstra’s Algorithm

Sortuj według:

Ogranicz wyniki do:

AIS based shipping routes using the dijkstra algorithm

Silveira P., Teixeira A. P., Guedes-Soares C.

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

2019

Vol. 13, no. 3

565--571

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.

Analysis of Graph Searching Algorithms for Route Planning in Inland Navigation

Kazimierski W., Sawczak A., Wawrzyniak N.

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

2015

Vol. 9, no. 2

281--286

Route planning is one of the core functionalities of modern navigational systems also in inland waters. There is a possibility of at least partial automation of this process with the use of graph searching algorithms. Main problem here is to create a graph based on nautical spatial data. The paper presents research on examining dif-ferent graph searching methods for inland waters. The concept of using combined approach for vector and ras-ter data is given, followed by research results for raster data.

On the Fuel Saving Operation for Coastal Merchant Ships using Weather Routing

Takashima K., Mezaoui B., Shoji R.

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

2009

Vol. 3, no. 4

401--406

It is well known that Weather Routing is one of the effective ship operation methods to reduce fuel consumption and many studies have been conducted to develop the effective calculation methods. However, most studies were performed focusing on the ocean going ships, and there were few studies made for coastal ships. The authors propose a minimum fuel route calculation method for coastal ships that use the precise forecasted environmental data and the propulsion performance data of the ship on actual seas. In the proposed method, we use the Dijkstra’s algorithm to calculate an optimum minimum fuel route suitable for coastal ships. Simulation study was carried out to evaluate the effectiveness of the proposed method using two coastal ships. As the result of study, the authors confirmed that the proposed calculation method is effective for fuel consumption reduction and is applicable for the operation of coastal merchant ships.